Interested to Buy Any Domain ? << Click Here >> for more details...
Which sorting algorithm is the best?
- 1 Answers
- 1129 Views
- I also Faced
- E-Mail Answers
Answer / glibwaresoftsolutions
Bubble sort, fast sort, balloon sort, merge sort, radix sort, and more are examples of the various kinds of sorting algorithms.
Since each algorithm was created for a certain kind of data structure where it works best, none of them can be regarded as the best or fastest.
| Is This Answer Correct ? | 0 Yes | 0 No |
what is the difference between. system call and library function?
What is the advantage of using #define to declare a constant?
0 Answers Agilent, ZS Associates,
What are pointers really good for, anyway?
array contains zeros and ones as elements.we need to bring zeros one side and one other side in single parse. ex:a[]={0,0,1,0,1,1,0,0} o/p={0,0,0,0,0,1,1,1}
What is the meaning of && in c?
why the execution starts from main function
what is volatile in c language?
9 Answers Cap Gemini, HCL, Honeywell, TCS, Tech Mahindra,
What is volatile variable in c?
How many bytes is a struct in c?
What is a protocol in c?
What is the role of && operator in a program code?
What kind of sorting is this? SORT (k,n) 1.[Loop on I Index] repeat thru step2 for i=1,2,........n-1 2.[For each pass,get small value] min=i; repeat for j=i+1 to N do { if K[j]<k[min] min=j; } temp=K[i];K[i]=K[min];K[min]=temp; 3.[Sorted Values will be returned] A)Bubble Sort B)Quick Sort C)Selection Sort D)Merge Sort
C 
