Sorting Algorithms Quiz

What is the primary function of sorting algorithms?

• To arrange data in a random order

• To delete duplicate data from a list

• To sort data in particular ways, such as from highest to lowest

• To merge different sets of data into one

How does the Bubble Sort algorithm work according to the document?

• It merges two sorted lists into one

• It divides the list into smaller parts and sorts them individually

• It repeatedly steps through a list of data, comparing each pair of data and swaps them if their order is wrong

• It sorts the data by selecting the smallest element from an unsorted list and adding it to the beginning of the list

What is the principle that the Merge Sort algorithm is based on?

• First Come First Serve

• Divide and Conquer

• Bubble Up

• Quick Sort

Which sorting algorithm is described as easier to code compared with other sorting algorithms?

• Merge Sort Algorithm

• Quick Sort Algorithm

• Insertion Sort Algorithm

• Bubble Sort Algorithm

What is a disadvantage of using the Bubble Sort Algorithm for sorting data?

• Requires more memory to work

• Harder to code compared with other sorting algorithms

• Not very efficient when sorting larger sets of data

• Uses the principle of 'Divide and Conquer'

What is a disadvantage of the Merge Sort Algorithm compared to other sorting algorithms?

• Easier to code

• Can be faster than a Bubble Sort if the dataset is small

• Harder to code

• Doesn't require much memory to work

What does the Merge Sort Algorithm require more of compared to the Bubble Sort Algorithm?

• Time to sort small datasets

• Memory to store multiple lists of data

• Effort to understand the algorithm

• Data to be sorted

What is the first step in performing a merge sort on a dataset?

• Comparing each element with the pivot

• Dividing the dataset into two halves

• Sorting the dataset using a single loop

• Swapping adjacent elements if they are in the wrong order

When using a merge sort, what is the dataset [9,8,7,6,5,4,3,2] initially divided into?

• [9,8,7,6] and [5,4,3,2]

• [9,8] and [7,6,5,4,3,2]

• [9] and [8,7,6,5,4,3,2]

• [9,8,7] and [6,5,4,3,2]

After the initial division in a merge sort, what is the next step for the dataset [9,8,7,6,5,4,3,2]?

• Merge the two halves into a sorted array

• Continue dividing each half until single elements remain

• Compare and swap elements within each half

• Arrange the elements in ascending order within each half