Interested to Buy Any Domain ? << Click Here >> for more details...
Which sorting algorithm has minimum number of swaps?
- 0 Answers
- 889 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like. [ I ended up giving about 4 or 5 different solutions for this, each supposedly better than the others ].
Write an algorithm to find middle element in the linked list.
What is the minimum number of queues that can be used to implement a priority queue?
Is array of data structure?
Can hashset contain null?
What exactly is a thread?
Is bubble sort faster than selection sort?
Define the term “percolate down”?
What is scalar data type?
Define heap?
Can binary tree have 1 child?
Which interfaces are implemented by hashmap?
Windows 
