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

A. quick sort

B. bead sort

C. cycle sort

D. heap sort

A. recursive bubble sort

B. merge sort

C. radix sort

D. counting sort

A. True

B. False

A.

void partition_random(int arr[], int low, int high) 
{     
    srand(time(NULL)); 
    int random = low + rand() % (high - low); 
    swap(arr[random], arr[high]); 
}

B.

void partition_random(int arr[], int low, int high) 
{    
    srand(time(NULL)); 
    int random = high + rand() % (high - low); 
    swap(arr[random], arr[high]); 
}

C.

void partition_random(int arr[], int low, int high) 
{     
    srand(1); 
    int random = low + rand() % (high - low); 
    swap(arr[random], arr[high]); 
}

D.

void partition_random(int arr[], int low, int high) 
{     
    srand(time(NULL)); 
    int random = low + rand() % (high - low-1); 
    swap(arr[low], arr[high]); 
}

A. selection sort

B. quick sort

C. merge sort

D. heap sort

A. true

B. false

A. true

B. false

A. first element

B. last element

C. median-of-three partitioning

D. random element

A. 2N log N-O(N)

B. 2N log N-O(N log N)

C. 2N log N-O(N log log N)

D. 2N log N-O(log N)

A. Quick sort

B. Cocktail sort

C. Bubble sort

D. Merge sort