Sorting Algorithms MCQ question and answer with solution | Data Structure MCQs

A. stupid sort

B. permutation sort

C. donkey sort

D. monkey sort

A. true

B. false

A. Because insertion sort is faster and adaptive

B. Because insertion sort requires less space

C. Because insertion sort is easy to implement

D. Because insertion sort is easy to understand

A. Quick sort

B. Shell sort

C. Insertion sort

D. Heap sort

A. O(N)

B. O(N log N)

C. O(log N)

D. O(N²)

A. Quick sort

B. Insertion sort

C. Selection sort

D. Merge sort

A.

for (int i = 0; i < n; i++) 
{ 
         int j;
        for (j = 0; j < max; j++); 
        //max is the maximum value element of given array a[]  
        a[i] = j; 
i}

B.

for (int i = 0; i < n; i++) 
{ 
         int j;
        for (j = 0; j < max && beads[i * max + j]; j++); 
        //max is the maximum value element of given array a[]
        a[i] = j; 
}

C.

for (int i = 0; i < n; i++) 
{ 
         int j;
        for (j = 0; j < beads[i * max + j]; j++); 
       //max is the maximum value element of given array a[]  
        a[j] = i; 
}

D.

for (int i = 0; i < n; i++) 
{ 
         int j;
        for (j = 0; j < max && beads[i * max + j]; j++); 
       //max is the maximum value element of given array a[]  
        a[j] = i; 
}

A. O(n)

B. O(n log n)

C. O(n²)

D. O(log n)

A. generating random permutations of its input

B. partitioning the array

C. dividing the value of input elements

D. generating permutations according to the value of first element of array

A. O(n)

B. O(1)

C. O(n²)

D. O(n log n)