Font size
WorksheetsSorting Techniques Quiz
Total questions: 16
Worksheet time: 13mins
Compares pairs of items and swaps them if they are in the wrong order. Each pair in the list is checked.
Bubble Sort
Insertion Sort
Takes each item in turn and puts it in the right place using the first item in the list as a starting point.
Selection Sort
Merge Sort
Insertion Sort
Bubble Sort
Which type of sort algorithm is this?
(a)
An algorithm is...
A set of steps to follow in order
When you search data for a specific entity
When you sort data into the correct order
Both A and C
True or False:
A bubble sort goes through each pair in a list and swaps them if not in order.
(a)
A bubble sort goes through each pair in a list and swaps them if not in order.
To show we can do it
So it looks nice
It is easier to make sense of
Which algorithm would work best to sort data as it arrives, one piece at a time, perhaps from a network?
(a)
If you’re quite done with more complex sorting algorithms and want to move on to something simpler: (a) is the way to go.
Best Time Complexity of Insertion Sort
(a)
In every run, compare it with the predecessor. If the current element is not in the correct location, keep shifting the predecessor subarray till the correct index for the element is found.
Merge Sort
Insertion Sort
Bubble Sort
Selection Sort
What is the most flexible sorting algorithm in java?
Merge Sort
Selection Sort
Insertion Sort
Bubble Sort
How many parts does the algorithm of merge sort have?
(a)
It is one of the most important sorting methods in java that one need to learn to get into sorting
(a)
What are the 2 methods of Heap Order?
Max Heap and Min Heap
Binary Heap and Order Heap
Mass Heap and Main Heap
The simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order.
(a)
Explain the importance of Sorting in Data Structure.
(Only use one sentence to answer.)
(a)
