Here you will find a bunch of essential Algorithms that you must understand for your exams.
Each document highlights the basic theory aspect of each algorithm, an example of the code used within Python, the different variants of the algorithm and downloadable python/text files to see the code in action.
Note: You do not need to write in purely pseudocode in your exam. It is perfectly appropriate to answer questions using the program language you have learnt. I will be demonstrating the following algorithms in Python.
The Entire Collection:
The most helpful source code for all Sorting Algorithms in python:
The All In One Word Document:
Version One: Need to know Algorithms
All Algorithms/Data Structures & Other Programming Constructs:
Pretty much everything for Unit 2.3
- Big-O Notation (GCSE/A-Level)
- Linear Search: (GCSE / A-Level)
- Binary Search: (GCSE / A-Level)
- Bubble Sort: (GCSE / A-Level)
- Insertion Sort: (GCSE / A-Level)
- Merge Sort: (GCSE / A-Level)
- Quick Sort: (A-Level)
- The Array (GCSE / A-Level)
- The Stack (A-Level)
- The Queue (A-Level)
- Linked Lists: (A-Level)
- Trees (A-Level)
- Dijkstra’s Shortest Path: (A-Level)
- A * Algorithm: (A-Level) – Obsolete due to reduced content due to COVID (2021)
Basic Tkinter:
Basic Tkinter in simple english to help newbies get started:
These two pages should help you understand the minimum knowledge needed for Tkinter. With this, you can build any basic GUI.
- Tkinter Basics #1 (Intro, Labels, Placements)
- Tkinter Basics #2 (Buttons & Entry Boxes)
