Register

best algo to sort 1 million item

• edited by
1,258 views
0 votes
0 votes
what is the  best algorithm to  sort a list of more than 1 million items  in an array

a)quicksort   b) merge sort  c)heap sort d) bubble sort
• edited by
User Avatar

1 Answer

0 votes
0 votes
Merge sort obviously as for LL it will become inplace and it is most preferable for large arrays
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
GateMaster Prime asked Dec 28, 2014
1,322 views
Best algorithm in terms of time to sort numbers within range 1 to n^5
User Avatar
0 votes
0 votes
3 answers
2
radha gogia asked Sep 16, 2015
2,724 views
To sort n randomly generated numbers. One should prefer which sorting algo ,Quick or Heap
To sort n randomly generated numbers. One should prefer which sorting algo ,Quick or Heap?
To sort n randomly generated numbers. One should prefer which sorting algo ,Quick or Heap?
User Avatar
0 votes
0 votes
3 answers
3
radha gogia asked Jul 17, 2015
1,005 views
why is merge sort better if we try to do sorting on linked lists and also insertion sort and why not any other algo like quick sort or selection sort ?
If we talk about that since since we cant access any random element in a linked list for that reason quick sort cant be used for linked lists ,then in merge sort also we ...
User Avatar
1 votes
1 votes
1 answer
4
Himanshu1 asked Jan 20, 2016
1,308 views
Heap Sort best case
What is the Best Case run time of Heap Sort ? A. $O(1)$ B. $O(n)$ C. $O(n \log n)$ D. $O(\log n)$
What is the Best Case run time of Heap Sort ?A. $O(1)$B. $O(n)$C. $O(n \log n)$D. $O(\log n)$
User Avatar
Link Copied!