Sorting Algorithms Quiz

Describe the closest thing to the selection sort algorithm?

• To reverse the elements of an array

• To find the maximum element in an array

• To sort an array in descending order

• To divide the list into sorted and unsorted portions

In selection sort, what happens after each pass if the algorithm aims to sort the elements in descending order?

• The unsorted portion increases.

• The array is completely sorted.

• The smallest element is placed at the beginning.

• The largest element is placed at the beginning.

What is the main characteristic of bubble sort?

• It uses a divide and conquer approach

• It repeatedly compares and swaps adjacent elements

• It minimizes the number of comparisons

• It sorts the array in a single pass

Which sorting algorithm minimizes the number of swaps?

• Merge Sort

• Insertion Sort

• Selection Sort

• Bubble Sort

What does the inner loop of the selection sort algorithm do?

void selectionSort(int arr[], int n) {

    int i, j, minIndex, temp;

    for (i = 0; i < n - 1; i++) {

        minIndex = i;

        for (j = i + 1; j < n; j++) {

            if (arr[j] < arr[minIndex]) {

                minIndex = j;

            }

        }

        if (minIndex != i) {

            temp = arr[i];

            arr[i] = arr[minIndex];

            arr[minIndex] = temp;

        }

        // Display the array after each iteration . Not necessary.

        printf("After iteration %d: ", i + 1);

        for (int k = 0; k < n; k++) {

            printf("%d ", arr[k]);

        }

        printf("\n");

    }

}

• Counts the number of elements

• Sorts the entire array

• Finds the minimum element in unsorted portion

• Finds the maximum element

Assuming n is the number of elements in an array to be sorted, how many passes does bubble sort make at most on the array?

• n

• n - 1

• n + 1

• 2n

What is the main advantage of bubble sort?

• It sorts in place

• It requires less memory

• It is easy to understand

• It is the fastest sorting algorithm

What is the output of the selection sort after the first iteration(pass) on the array [64, 25, 12, 22, 11]?

• 12, 22, 25, 64, 11

• 11, 22, 12, 25, 64

• 11, 25, 12, 22, 64

• 12, 25, 64, 22, 11

What is the primary operation performed by bubble sort?

• Finding the median

• Counting the number of elements

• Dividing the array into halves

• Swapping adjacent elements

In the context of sorting algorithms, what does 'bubbling' refer to?

• Moving the smallest element to the top

• Moving the largest unsorted element to its correct position

• Reversing the order of elements

• Counting the number of swaps