mplement an open addressing hash table to store a list of integers your task js to handle collisions using open addressing and implement basic operations such as insertion, deletion,and searching. The open addressing technique you will use is linear probing

USING C LANGUAGE IN NETBEANS : Write a program menu that creates and manages Fibonacci heaps. The program must implement the following operations: creation, insertion, find min, extract min, decrease key, and deletion. **NOTE: The program should present a menu where user may choose from implemented options.

Implement the following algorithms in Java:The pseudocode for QUICKSORT introduced in (slide 14), includingprocedure PARTITION implementing right-most element pivot selection (slide 13). Slide 13:PARTITION(A,p,r)  x := A[r]  i := p – 1  for j = p to r - 1    if A[j]  x      i := i + 1      SWAP(A[i],A[j])  SWAP(A[i+1],A[r])   return i + 1 Slide 14:QUICKSORT(A,p,r)  if p < r    q := PARTITION(A,p,r)    QUICKSORT(A,p,q-1)    QUICKSORT(A,q+1,r)

Implement a nonrecursive version of quicksort basedon a main loop where a subarray is popped from a stack to be partitioned, and the resulting subarrays are pushed onto the stack. Note : Push the larger of the subarrays ontothe stack first, which guarantees that the stack will have at most lg N entries.

We push all the elements of an array A in order (starting from index 0 of the array A) into a stack. We then pop all the elements from the stack and store them in order (starting from index 0) in A. Which of the following is true after all pop operations complete? O The elements of A are reversed Each element of A is in its original location O The elements of A are in random new locations The array A is empty O None of the above