The Student Room Group

Ocr alevel spec comp sci

does anyone know if u have to know how to do psuedocode for the insertion, merge & quick sort algorithm from scratch or is it just knowing the theory
Pretty sure the only algorithms you dont need to know any psuedocode for are Dijkstra's and A*. Everything else yes, just check the spec
Original post by BigJ123
Pretty sure the only algorithms you dont need to know any psuedocode for are Dijkstra's and A*. Everything else yes, just check the spec


ah ok ty for the reply
i checked the spec but i don’t see where it specifies what we need to know pseudocode for
(edited 1 year ago)
Original post by hihihihihuhh
ah ok ty for the reply
i checked the spec but i don’t see where it specifies what we need to know pseudocode for


Go and watch Craig n Dave’s videos on them, he specified exactly what you need to know about the algorithm the videos on it.

Quick Reply