SLR05 – Algorithms AQA A’Level SLR05 Graphs traversal algorithms AQA A’Level SLR05 Tree traversal algorithms AQA A’Level SLR05 Reverse Polish Notation – Part 1 AQA A’Level SLR05 Reverse Polish Notation – Part 2 AQA A’Level SLR05 Linear search AQA A’Level SLR05 Binary search AQA A’Level SLR05 Bubble sort AQA A’Level SLR05 Merge sort AQA A’Level SLR05 Dijkstra’s shortest path Also in this topic... SLR01 – Programming basics SLR02 – Programming next steps SLR04 – Data structures SLR07 – Regular & context free languages SLR09 – A model of computation SLR10 – Number systems and bases SLR12 – Coding text & graphics SLR13 – Coding sound & music SLR14 – Hardware & software SLR19 – Moral, social, legal, cultural issues SLR20 – Communication SLR22 – TCP IP & protocols SLR23 – Databases SLR25 – Functional programming paradigms SLR26 – Writing functional programs SLR27 – Aspects of software development
