Understanding Sorting Algorithms

What is the primary purpose of sorting algorithms?

• To increase the size of data sets.

• To arrange data in a specific order.

• To encrypt sensitive information.

• To delete unnecessary data.

Name two in-place sorting algorithms.

• Quick Sort, Bubble Sort

• Heap Sort

• Selection Sort

• Merge Sort

What is the main characteristic of not in-place sorting algorithms?

• They do not require any memory for sorting.

• They use extra memory for sorting.

• They sort data in a single pass.

• They only work with numeric data.

Which sorting algorithm is known for its divide-and-conquer approach?

• Merge Sort

• Bubble Sort

• Insertion Sort

• Selection Sort

In which order are elements arranged in increasing order?

• Elements are arranged in random order without any specific sequence.

• Elements are arranged from the smallest to the largest value.

• Elements are arranged from the largest to the smallest value.

• Elements are arranged based on their color rather than value.

What does a comparison operator do in sorting?

• A comparison operator only works with numbers.

• A comparison operator groups elements without ordering.

• A comparison operator sorts elements randomly.

• A comparison operator determines the order of elements by comparing their values.

Which sorting technique repeatedly swaps adjacent elements?

• Merge Sort

• Insertion Sort

• Selection Sort

• Bubble Sort

What is the time complexity of the best case for bubble sort?

• O(log n)

• O(n)

• O(1)

• O(n^2)

How does selection sort determine the next element to place in order?

• Selection sort uses a binary search to find the next element to place in order.

• Selection sort places elements in order by sorting the entire array at once.

• Selection sort determines the next element to place in order by finding the minimum element from the unsorted portion of the array.

• Selection sort randomly selects elements from the array to place in order.

What is the difference between non-increasing and decreasing order?

• Decreasing order allows equal values; non-increasing order does not.

• Non-increasing order requires strictly larger values; decreasing order allows equal values.

• Non-increasing order is the same as decreasing order.

• Non-increasing order allows equal values; decreasing order does not.