Algorithms and Data Structures

Algorithm

A set of instructions that defines a process or a computational task.

Flowchart

A visual representation of an algorithm using standardized symbols to illustrate the sequence of steps and decision points.

Data Structures

Methods of organizing and storing data for efficient usage and manipulation.

Stack

A data structure that follows the Last In, First Out (LIFO) philosophy. Elements can only be added at the end of the list and cannot be accessed unless popped

Null

A special value in computer code representing zero, nothing, or the end of a sequence.

Linked List

A sequential data storage structure where each element is linked to the next. Elements can be inserted at any point and this structure is unbounded in size, allowing dynamic memory allocation.

Array

A common data structure where elements are stored in sequential order with specific indices. They are typically bounded and require more size, however they do offer random access to elements and thus the most functionality.

Unicode

An international encoding standard used for representing numbers, letters, and symbols.

Searching and Sorting

Tasks in computing that involve finding specific data or organizing it in a specific order.

Linear Search

A simple search algorithm that checks each element in order until the target is found. This can be very inefficient for large datasets.

Jump Search

A search algorithm that calculates a jump size based on the square root of the dataset size. Once in range of the target element, a linear search is performed.

Binary Search

A search algorithm that repeatedly divides the dataset in half, narrowing down the search space until the target is found

Bubble Sort

A sorting algorithm where adjacent elements are compared and swapped if in the wrong order. This process is repeated until the entire list is sorted.

Binary Insertion Sort

A sorting algorithm that uses binary search to efficiently find the position of an element in the sorted part of the list and insert it.

Quicksort

An algorithm that uses the divide-and-conquer approach. It selects a pivot, divides the dataset into two parts (those smaller and those larger than the pivot), and recursively sorts each part. Regarded as one of the most efficient sorting algorithms

Exhaustive Search

A search method that examines the entire dataset for a solution.

Crucial aspects of algorithm design.

Correctness, Termination, and Complexity

Efficient search algorithms depend on factors like _______

data set size and order

Linear Search

______ works on both sorted and unsorted data, while others may require pre-sorting