Algorithm, Finite sequence of unambiguous steps used to solve a problem, Pseudocode, Language-independent structured notation used to describe an algorithm, Flowchart, Diagram representing an algorithm using standard symbols connected by flow lines, Dry Run, Manually executing an algorithm using test data to determine its behaviour, Trace Table, Table recording values of variables as an algorithm is executed, Correctness, Whether an algorithm produces the required result for valid inputs, Efficiency, Amount of resources such as processing time or memory required by an algorithm, Linear Search, Search algorithm that checks items sequentially until the target is found or all items have been checked, Binary Search, Search algorithm that repeatedly halves an ordered search area by comparing the target with the middle item, Bubble Sort, Sorting algorithm that repeatedly compares adjacent items and swaps them when they are in the wrong order, Insertion Sort, Sorting algorithm that builds an ordered section by inserting each new item into its correct position, Merge Sort, Divide-and-conquer algorithm that repeatedly splits a list into smaller sub-lists and merges adjacent sub-lists back into order, Quick Sort, Divide-and-conquer algorithm that partitions items around a pivot and recursively processes the resulting partitions, Pivot, Item selected during quick sort around which the remaining values are partitioned, In-place Sort, Sorting algorithm that rearranges items mainly within the original data structure rather than requiring another full copy

A Level: Algorithms + Searching and Sorting - Mr Gopal

by
Print
Embed

Leaderboard

Visual style

Options

AI Enhanced: This activity contains content generated by AI. Learn more.

Switch template

Continue editing: ?