UNIT 4-SORTING IN PYTHON Quiz

What is the Bubble sort algorithm?

• Bubble sort is a method for organizing bubbles in a bubble bath.

• Bubble sort is a type of soap used for washing dishes.

• Bubble sort is a popular dance move at parties.

• Bubble sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.

How does the Bubble sort algorithm work?

• Bubble sort randomly shuffles the elements in the list.

• Bubble sort compares every element with the first element and swaps them if they are in the wrong order.

• Bubble sort only compares elements at even indices and swaps them if they are in the wrong order.

• Bubble sort compares adjacent elements and swaps them if they are in the wrong order.

Explain the Selection sort algorithm.

• Selection sort is a type of data structure

• Selection sort algorithm is not efficient and should not be used

• Selection sort is a simple sorting algorithm that works by repeatedly finding the minimum element from the unsorted part of the array and putting it at the beginning.

• Selection sort works by sorting the array in descending order

What is the main idea behind the Selection sort algorithm?

• To repeatedly select the largest element from the unsorted part and move it to the end of the sorted part

• To randomly shuffle the input list

• To divide the input list into two parts: the sorted part and the unsorted part, and then repeatedly select the smallest element from the unsorted part and move it to the end of the sorted part.

• To sort the input list in descending order

What is the time complexity of the Selection sort algorithm?

• O(n)

• O(n!)

• O(log n)

• O(n^2)

Describe the Insertion sort algorithm.

• Insertion sort is the most efficient sorting algorithm for large lists.

• Insertion sort is not a sorting algorithm.

• Insertion sort is a complex sorting algorithm that builds the final sorted array all at once.

• Insertion sort is a simple sorting algorithm that builds the final sorted array one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.

How does the Insertion sort algorithm work?

• It removes the smallest element from the list

• It randomly shuffles the list

• It iterates through the list and moves each element to its correct position.

• It compares each element with the middle element

Explain the Merge sort algorithm.

• Merge sort is a random sorting algorithm

• Merge sort only works on arrays with even number of elements

• Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts each half, and then merges the sorted halves to produce a single sorted array.

• Merge sort does not divide the input array into two halves

Explain the Heap sort algorithm.

• Heap sort is a random sorting algorithm

• Heap sort only works on arrays with even number of elements

• Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure.

• Heap sort does not use any data structure for sorting

What is the main idea behind the Shell sort algorithm?

• To repeatedly select the largest element from the unsorted part and move it to the end of the sorted part

• To randomly shuffle the input list

• To divide the input list into smaller sublists and then sort each sublist using insertion sort.

• To sort the input list in descending order