EEE-A QUIZ-5 DS LAB

Which of the following sorting algorithms is the fastest?

• 
  Merge sort

• Quick sort

• Insertion sort

• Shell sort

Quick sort follows Divide-and-Conquer strategy.

• True

• False

What is the worst case time complexity of a quick sort algorithm?

• O(N)

• O(N log N)

• O(N²)

• O(log N)

How many sub arrays does the quick sort algorithm divide the entire array into?

• one

• two

• three

• four

What is the average case time complexity of merge sort?

• O(n log n)

• O(n²)

• O(n² log n)

• O(n log n²)