Chapter 8 CMSC

Search Algorithms

Tools used to locate specific elements within an array.

Linear Search

A search method that checks each element sequentially.

Binary Search

A search method that divides the dataset to find elements efficiently.

Sorting Algorithms

Methods used to arrange data in a specific order.

Bubble Sort

A simple sorting algorithm that repeatedly steps through the list.

Quick Sort

A fast sorting algorithm using divide-and-conquer strategy.

Vectors

Dynamic arrays in C++ that can grow and shrink as needed.

Data Structures

Organized formats to store and manage data efficiently.

Program Design

The process of planning and creating a program's structure.

Problem Solving

The process of finding solutions to complex issues.

Dataset

A collection of data organized for analysis.

Efficiency

The ability to accomplish a task with minimal resources.

Memory

The storage space required for data processing.

Data Manipulation

The process of adjusting data to achieve a desired outcome.

Analytical Thinking

The ability to systematically solve problems using logic.

Sequential Search

Another term for linear search examining each element in order.

Selection Sort

A sorting algorithm that divides the input list into two parts: a sorted sublist and an unsorted sublist and repeatedly selects the smallest element from the unsorted sublist.

Pass

A single complete iteration through the array by a sorting algorithm.

Vectors

Dynamic arrays in C++ that can grow and shrink in size.