Data Structures Through C (C-21) (UNIT 3 & 4)

What is the best time complexity of bubble sort (optimized)?

• • N^2

• • N logN

• • N

• • N(logN)^2

What is the worst case time complexity of insertion sort where position of the data to be inserted is calculated using binary search?

• • N

• • N*log(N)

• • N²

• • N*log(N)²

Which sorting algorithm will take least time when all elements of input array are identical?

• • Insertion Sort

• • Bubble Sort

• • Merge Sort

• • Selection Sort

Which of the following sorting algorithms has the lowest worst-case complexity?

• • Bubble Sort

• • Quick Sort

• • Merge Sort

• • Selection Sort

Consider an array of elements arr[5]= {5,4,3,2,1} , what are the steps of insertions done while doing insertion sort in the array.  

• • 4 5 3 2 1

    2 3 4 5 1

    3 4 5 2 1

    1 2 3 4 5

• • 5 4 3 1 2

    5 4 1 2 3

    5 1 2 3 4

    1 2 3 4 5

• • 4 3 2 1 5

    3 2 1 5 4

    2 1 5 4 3

    1 5 4 3 2

• 4 5 3 2 1

  • 3 4 5 2 1

    2 3 4 5 1

    1 2 3 4 5

Which is the correct order of the following algorithms with respect to their time Complexity in the best case ?

• Merge sort > Quick sort >Insertion sort > selection sort

• Merge sort > selection sort > quick sort > insertion sort

• insertion sort < Quick sort < Merge sort < selection sort

• Merge sort > Quick sort > selection sort > insertion sort

What is the best sorting algorithm to use for the elements in array are more than 1 million in general?

• • Merge sort.

• • Quick sort.

• Bubble sort.

• Insertion sort.

Which of the below given sorting techniques has highest best-case runtime complexity.

• Selection sort

• Insertion sort

• • Bubble sort

• Quick sort

Which of the following sorting algorithms needs the minimum number of swaps?

• • Quick sort

• • Insertion sort

• • Selection sort

• Heap sort

What does a bubble sort do?

• • Sort the list by choosing a pivot element

• • Finds an item of data in a list

• By dividing and merging a list

• • Sorts a list by comparing two items that are side by side, to see which is out of order