Merge Sort

Computer ScienceOCRGCSEUnit: 3.1 Fundamentals of Algorithms
Free taster
5 of 6 sections open
The basics

Digital Dice

Digital Dice

Games, simulations, and security all need randomness. Rolling dice? Drawing lottery numbers? Shuffling cards? Generating passwords? All need random numbers. Computers use pseudo-random number generators - they're not truly random (they follow formulas) but are good enough for most uses. A seed value starts the sequence - same seed gives same "random" numbers!

Now try it yourself

Quiz · Question 1 of 16

Which design strategy does merge sort use?

Tap an answer to check it

Revise every Computer Science topic, free during alpha

Merge Sort is one of 60 topics on PrepWise — all aligned to your exam board.

Start revising free →