A sort which iteratively passes through a list to exchange the first e – McqOptions

MCQOPTIONS

1.	A sort which iteratively passes through a list to exchange the first element with any element less than it and then repeats with a new first element is called
A.	insertion sort
B.	selection sort
C.	heap sort
D.	quick sort
Answer» C. heap sort

Discussion

No Comment Found

Related MCQs

Consider the following definition in c programming language
Consider an implementation of unsorted doubly linked list. Suppose it has its representation with a head pointer and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time?
Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list
Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time?
A sort which iteratively passes through a list to exchange the first element with any element less than it and then repeats with a new first element is called
How many times the program will print "Amrutvahini" ? #include
What will be the output of the program? #include
What will be output if you will compile and execute the following c code? #include int main(){
What will be output if you will compile and execute the following c code? #include
What is error in following declaration?