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
Answer Posted / rajesh
Selection Sort
| Is This Answer Correct ? | 3 Yes | 1 No |
Post New Answer View All Answers
Explain what are the __date__ and __time__ preprocessor commands?
how do you execute a c program in unix.
what is ur strangth & weekness
What is zero based addressing?
What are nested functions in c?
Difference between exit() and _exit() function?
Write a program to print numbers from 1 to 100 without using loop in c?
What does int main () mean?
GIVEN A FLOATING POINT NUMBER HOW IS IT ACTUALLY STORED IN MEMORY ? CAN ANYONE EXPLAIN?? THE 32 BIT REPRESENTATION OF A FLOATING POINT NUMBER ALLOTS: 1 BIT-SIGN 8 BITS-EXPONENT 23 BITS-MANTISSA
Differentiate between full, complete & perfect binary trees.
What is void pointers in c?
What is a dynamic array in c?
Is it better to use a pointer to navigate an array of values, or is it better to use a subscripted array name?
Can the size of an array be declared at runtime?
What is the difference between scanf and fscanf?