Basic Explanation of Insertion Sort. (3 marks)
Describe the Insertion Sort process using a simple array of integers [8, 3, 5, 4] as an example. Explain how elements are sorted step-by-step.
Basic Explanation of Insertion Sort. (3 marks) Read More »
2.1.3 Searching and Sorting Algorithms
Process of the Merge Sort Algorithm. (3 marks)
Explain how the Merge Sort algorithm sorts a dataset.
Process of the Merge Sort Algorithm. (3 marks) Read More »
Describe the process of the Bubble Sort. (2 marks)
Describe the process of the Bubble Sort algorithm when applied to a set of numbers.
Describe the process of the Bubble Sort. (2 marks) Read More »
Applying a Binary Search Algorithm. (3 marks)
A list of student names sorted alphabetically: Alice, Bob, Charlie, David, Emma. Write the steps you would take to find the name “Emma” using a binary search.
Applying a Binary Search Algorithm. (3 marks) Read More »
Identify the Search Algorithm (2 marks)
Review the pseudocode below and explain the type of search algorithm used: for i = 0 to (list.length) – 1 if list[i] == target then print(“Found at position”, i) break endif next i print(“Not found”)
Identify the Search Algorithm (2 marks) Read More »
Pre-requisite for Performing a Binary Search. (1 mark)
Explain one pre-requisite for performing a binary search on a dataset.
Pre-requisite for Performing a Binary Search. (1 mark) Read More »
Arabic
Chinese (Simplified)
Dutch
English
French
German
Italian
Portuguese
Russian
Spanish
Ukrainian
Welsh