Sorting Algorithms

Explain the Bubble Sort algorithm.

• Bubble Sort algorithm only compares elements once

• Bubble Sort algorithm compares adjacent elements and swaps them if they are in the wrong order, repeating this process until the list is sorted.

• Bubble Sort algorithm is the fastest sorting method

• Bubble Sort algorithm sorts elements randomly

What is the time complexity of Bubble Sort?

• O(1)

• O(nlogn)

• O(n^2)

• O(n)

Describe the Insertion Sort algorithm.

• Insertion Sort algorithm iterates through the array by consuming one input element at each repetition, and grows a sorted output list. At each iteration, it removes one element from the input data, finds the location it belongs within the sorted list, and inserts it there. It repeats this process until no input elements remain.

• Insertion Sort algorithm sorts elements in descending order

• Insertion Sort algorithm randomly shuffles the input elements

• Insertion Sort algorithm only works on arrays with a single element

What is the best-case time complexity of Insertion Sort?

• O(log n)

• O(1)

• O(n)

• O(n^2)

How does the Selection Sort algorithm work?

• Selection Sort algorithm works by sorting the array in descending order.

• Selection Sort algorithm works by randomly shuffling the elements in the array.

• Selection Sort algorithm works by comparing adjacent elements and swapping them if they are in the wrong order.

• Selection Sort algorithm works by finding the minimum element from the unsorted part of the array and swapping it with the first unsorted element.

What is the worst-case time complexity of Selection Sort?

• O(nlogn)

• O(n)

• O(1)

• O(n^2)

Explain the Quick Sort algorithm.

• Quick Sort algorithm involves merging two sorted arrays together.

• Quick Sort algorithm involves selecting the smallest element as the pivot.

• Quick Sort algorithm involves sorting the array in reverse order.

• Quick Sort algorithm involves selecting a pivot element, partitioning the array around the pivot, and recursively sorting the sub-arrays.

What is the average-case time complexity of Quick Sort?

• O(n^2)

• O(n)

• O(log n)

• O(n log n)

What is the main difference between Quick Sort and Merge Sort?

• Quick Sort is in-place and has average time complexity of O(n log n), while Merge Sort is not in-place and has stable time complexity of O(n log n).

• Quick Sort is in-place and has worst-case time complexity of O(n^2), while Merge Sort is not in-place and has stable time complexity of O(n log n).

• Merge Sort is in-place and has average time complexity of O(n log n), while Quick Sort is not in-place and has stable time complexity of O(n log n).

• Quick Sort is not in-place and has average time complexity of O(n log n), while Merge Sort is in-place and has stable time complexity of O(n log n).

When is Quick Sort preferred over other sorting algorithms?

• When the input data is already sorted

• When the input data is large and needs to be sorted in-place without using extra space.

• When the input data is small and needs to be sorted using extra space

• When the input data is of mixed data types