5. 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
- 2 Answers
- 5211 Views
- Accenture, I also Faced
- E-Mail Answers
Answer Posted / murali
Bubble sort
| Is This Answer Correct ? | 5 Yes | 2 No |
Post New Answer View All Answers
How can you avoid including a header more than once?
7-Given an index k, return the kth row of the Pascal's triangle. For example, when k = 3, the row is [1,3,3,1]. For reference look at the following standard pascal’s triangle.
Explain what is the benefit of using enum to declare a constant?
What is the difference between typedef struct and struct?
What is difference between structure and union in c programming?
Differentiate between the expression “++a” and “a++”?
Differentiate Source Codes from Object Codes
How do I use void main?
Why c is called top down?
How can you increase the allowable number of simultaneously open files?
Which built-in library function can be used to match a patter from the string?
Define recursion in c.
Hai,I have done with my bachelor of commerce and planing to ms,please suggest me how to convince vo for shifting from commerce to computers. Visa on 8 DEC 2014 Npu university
Difference between strcpy() and memcpy() function?
What's a good way to check for "close enough" floating-point equality?
