Algorithms And Flow Charts

A clear, step-by-step set of instructions used to solve a problem or complete a task.

A visual representation of an algorithm using standard symbols to show the flow of control and logic.

• Terminator (Oval): Start/End • Process (Rectangle): Task or instruction • Decision (Diamond): Yes/No or True/False question • Input/Output (Parallelogram): Data going in or out • Arrow: Direction of flow

A way of describing an algorithm using structured but plain English, resembling code but not specific to a language.

To plan programs clearly, understand logic, and communicate algorithms before actual coding.

An algorithm that checks each item in a list one at a time until it finds the target or reaches the end of the list.

An efficient algorithm that repeatedly divides a sorted list in half to find a target item.

Faster for large, sorted lists — reduces the number of checks needed.

The list must be sorted in order.

An algorithm that arranges data into a specific order (e.g., ascending or descending).

A sorting algorithm that repeatedly steps through a list, compares adjacent items, and swaps them if needed until the list is sorted.

• Advantages: Simple to understand and implement • Disadvantages: Very inefficient for large lists

A sorting algorithm that divides the list into smaller parts, sorts them, and then merges them back together in order.

• Bubble sort: Slower, simpler • Merge sort: Faster and more efficient for large data sets, but uses more memory due to recursion and merging steps

By simulating it step by step, keeping track of variable values to understand what it does or find errors.

Removing unnecessary details to focus on the main idea or logic of the problem.