Loading…
GCSE Computer Science · key term
A smaller list formed from part of a larger list.
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.
Keep the original order of the values during splitting: sorting happens when the sublists are merged.
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.
