Loading…
GCSE Computer Science · key term
Combining two sorted lists into one sorted list by repeatedly selecting the next value in the required order.
Used by AQA
Paper 1
Revise: Merge SortMerge sort uses a divide-and-conquer strategy. It breaks a list into smaller sublists until each contains just one value, then combines them into increasingly larger sorted lists. A one-value list is already sorted: there is nothing within it that could be in the wrong order.
Show the intermediate sublists when tracing merge sort, not just the final sorted list.
During a merge, compare the first unused value in each sorted sublist. Advance only in the sublist whose value you have taken.
Create a free account to keep every note you open and track your progress.
