Which one is the efficient sorting technique for arranging the books
in a library?
a) Bubble Sort
b) Selection Sort
c) Insertion Sort
d) Heap Sort
Regards
Shashank
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group,
insertion sort in IMHO
On Tue, Dec 21, 2010 at 5:44 PM, bittu shashank7andr...@gmail.com wrote:
Which one is the efficient sorting technique for arranging the books
in a library?
a) Bubble Sort
b) Selection Sort
c) Insertion Sort
d) Heap Sort
Regards
Shashank
--
You received this
insertion sort
On Tue, Dec 21, 2010 at 6:49 PM, Ankur Khurana ankur.kkhur...@gmail.comwrote:
insertion sort in IMHO
On Tue, Dec 21, 2010 at 5:44 PM, bittu shashank7andr...@gmail.com wrote:
Which one is the efficient sorting technique for arranging the books
in a library?
a) Bubble
IMHO
1.When books are nearly sorted : Insertion sort and can be incorporated with
Shell sort technique @ O(n^1.5) provided number of books are in '000s
2.If number of books are huge in millons so its Heap sort will be better and
taking the burden of coding build heap @ O(N) is justified.This