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

A.

If(high<=low) 
{ 
    If(Item>a[low])
    return low+1;
    return low;
}

B.

If(high>=low)
{
    If(Item<a[low])
    return low+1;
    return low;
}

C.

If(high<=low)
{
    If(Item<a[low])
    return low;
    return low+1;
}

D.

If(high<=low)
{  
    If(Item>a[low])
    return low;
    return low+1;
}

A. Algorithm that uses tape or disk during the sort

B. Algorithm that uses main memory during the sort

C. Algorithm that involves swapping

D. Algorithm that are considered 'in place'

A. Comb sort is an in place sorting algorithm

B. Comb sort is a stable sorting algorithm

C. Comb sort is more efficient

D. It has no advantage

A. true

B. false

A. Both statements are true

B. Statement 2 is true but statement 1 is false

C. Statement 2 is false but statement 1 is true

D. Both statements are false

A. It has a better time complexity as compared to the standard version

B. It has a better space complexity as compared to the standard version

C. it takes less number of comparisons in the best case as compared to the standard version

D. it takes less number of comparisons in the worst case as compared to the standard version

A. the input is non uniformly distributed

B. the input is uniformly distributed

C. the input is randomly distributed

D. the input range is large

A. O(n)

B. O(n log n)

C. O(n²)

D. O(log n)

A. 8, 21, 32, 34, 51, 64

B. 8, 32, 34, 51, 64, 21

C. 8, 34, 51, 64, 32, 21

D. 8, 34, 64, 51, 32, 21

A. Insertion sort

B. Merge sort

C. LSD radix sort

D. Quick sort