348 views
0 votes
0 votes

An algorithm performs (log N)1/2 find operations , N insert operations, (log N)1/2 delete operations, and (log N)1/2 decrease-key operations on a set of data items with keys drawn from a linearly ordered set . For a delete operation, a pointer is provided to the record that must be deleted . For the decrease-key operation, a pointer is provided to the record that has its key decreased. Which one of the following data structures is the most suited for the algorithm to use, if the goal is to achieve the best total asymptotic complexity considering all the operations?

  1. Unsorted array
  2. Min - heap
  3. Sorted array
  4. Sorted doubly linked list

1 Answer

Related questions

0 votes
0 votes
0 answers
1
1 votes
1 votes
2 answers
3
1 votes
1 votes
0 answers
4
hem chandra joshi asked Aug 9, 2017
351 views
Can any one describe this figure ?Query is(i) Control Memory is pointing towards Control address register which again pointing towards it .What is logic behind it?