top button
Flag Notify
    Connect to us
      Facebook Login
      Site Registration Why to Join

Facebook Login
Site Registration

Which is the quickest sorting method and why?

+4 votes
Which is the quickest sorting method and why?
posted Nov 18, 2013 by anonymous

Share this question
Facebook Share Button Twitter Share Button LinkedIn Share Button

1 Answer

+1 vote

The complexity of following sort is O(nlogn).
Merge Sort.
Quick Sort
Heap sort.

Merge Sort. => Need extra space .
Quick Sort => worst case complexity O(n2).
Heap Sort => Always grantee the complexity O(nlogn).
IN RTOS heap Sort is used.

answer Nov 18, 2013 by Vikas Upadhyay
Similar Questions
+5 votes

Help me to write a C program which can generate list of numbers which are palindrome in decimal and octal notion. You can take some max as a limit find out all numbers which satisfy the given property between 1 to n.

+6 votes

For example: It returns ‘b’ when the input is “abaccdeff”.

+5 votes
     20 60
     /\  \
   10 30  80
      /   /\
     25  70 90

longest path 
25 30 20 40 60 80 70 75 
    25 ----> 75
+4 votes

You have two arrays A1 and A2. Delete all element from A1 which are already in A2 and return new array.

Contact Us
+91 9880187415
#280, 3rd floor, 5th Main
6th Sector, HSR Layout
Karnataka INDIA.