Explore

GCSEAQA
Computer Science
Start learning
Browse allCurriculum Modules
What an Algorithm Is (Step-by-Step Instructions) Algorithm vs Program (Same Idea, Different Thing) Decomposition: Breaking a Problem into Sub-Problems Abstraction: Removing Unnecessary Detail A Systematic Approach to Solving Problems Writing Algorithms in Pseudocode Representing Algorithms with Flowcharts Representing Algorithms with Program Code Inputs, Processes and Outputs in an Algorithm Spotting Inputs, Processes and Outputs in Given Pseudocode Tracing an Algorithm with a Trace Table Determining What a Simple Algorithm Does (Purpose) Why Different Algorithms Can Solve the Same Problem Comparing Algorithms by Time Efficiency (Faster vs Slower) Linear Search: How It Works (Mechanics) Linear Search: Tracing Step-by-Step Binary Search: Why the Data Must Be Sorted Binary Search: How It Works (Mechanics) Binary Search: Tracing Step-by-Step Linear vs Binary Search: Advantages and Disadvantages Merge Sort: Splitting a List into Halves Merge Sort: Merging Two Sorted Lists Merge Sort: Tracing a Full Example Bubble Sort: Swapping Adjacent Items Bubble Sort: Passes, Comparisons and Swaps Bubble Sort: Tracing a Full Example Merge Sort vs Bubble Sort: Advantages and Disadvantages
