Compare and contrast the merge sort and bubble sort algorithms. Include at least two advantages and disadvantages for each algorithm.
Compare and Contrast the Merge Sort and Bubble Sort Algorithms. (6 marks) Read More »
Describe how the merge sort algorithm sorts an array of integers.
How the Merge Sort Algorithm Sorts Integers. (6 marks) Read More »
Explain how the bubble sort algorithm works using an array of integers as an example.
How the Bubble Sort Algorithm Works. (6 marks) Read More »
Explain how the linear search algorithm works.
How the Linear Search Algorithm Works. (2 marks) Read More »
Explain how the binary search algorithm works on a sorted list.
How the Binary Search Algorithm Works. (3 marks) Read More »
Compare and contrast linear and binary search algorithms.
Compare and Contrast Linear and Binary Search Algorithms. (6 marks) Read More »
What does the term ‘time complexity’ tell you about an algorithm and why is it important to know the time complexity when comparing two algorithms?
Time Complexity Basics (2 marks) Read More »
If you have a large database and need to find records quickly, would you choose a linear search or a hashed search method? Explain your answer.
Efficient Search in a Database (3 marks) Read More »
A developer used two different sorting algorithms to arrange a list of numbers in ascending order. Algorithm A is a selection sort (time complexity of O(n^2)), and Algorithm B is a quicksort (time complexity of O(n log n)). Which algorithm is likely to be more time-efficient for sorting large datasets and why?
Algorithm Efficiency Analysis (2 mark) Read More »
Explain why an iterative algorithm might be more time-efficient than a recursive algorithm for calculating numbers in a sequence.
Algorithm Efficiency Understanding (2 marks) Read More »
