Analyze that whether the following sorting algorithm perform better if they
run on “n” number of processors.
1.Bubble Sort
2.Insertion Sort
3.Selection Sort
4.Shell Sort
5.Quick Sort
6.Merge Sort
7.Radix sort
And if not then why? What's the reason?
Analyze that whether the following sorting algorithm perform better if they
run on “n” number of processors.
1.Bubble Sort
2.Insertion Sort
3.Selection Sort
4.Shell Sort
5.Quick Sort
6.Merge Sort
7.Radix sort
And if not then why? What's the reason?
5 seconds with google, and you could just copy/paste your answer.
Sorting algorithm - Wikipedia, the free encyclopedia
Next time, put some effort in (signing up and copy/pasting your question doesn't count).
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
When the post reads like a command for me to do something, because the poster is too lazy to even write any introductory sentence or even a single word of their own, they get nothing from me.
If I wanted to just see bunch of problem descriptions then I'd browse Project Euler rather than coming here!
My homepage
Advice: Take only as directed - If symptoms persist, please see your debugger
Linus Torvalds: "But it clearly is the only right way. The fact that everybody else does it some other way only means that they are wrong"
