CS201: Linear Search | Saylor Academy

Home Specialization Programs Help

Linear search is the most basic of search methods. Watch these videos to see how this simple search method works and how it is programmed in C/C++. You may wish to view the original link to find other useful material.

Video 1: Linear Search
Video 2: Linear Search

Source: Patrick Schmid and Doug Lloyd, Harvard University, http://cs50.wiki/Linear+search
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0 License.

Last modified: Thursday, 21 November 2024, 3:42 PM

Course Introduction

Course Syllabus

Course Terms of Use

Unit 1: Abstract Data Types and Arrays in C++

1.1: Abstract Data Types

Data Abstraction

Sort Template with Callback

Abstract Data Types

Abstract Data Types in C++

Standard Template Library

1.2: Contiguous Implementation

Arrays

1.3: Non-Contiguous Implementation

Memory Allocation in C++

1.4: Introduction to Memory Pointers

Pointers in C++

1.5: Linked Lists

Singly and Doubly-Linked Lists

Examples of Linked Lists

Linked List Programming Exercises

1.6: Arrays

Arrays in C

Additional Features of Arrays

Representations of Arrays

Array Programming Exercises

Unit 1 Assessment

Unit 1 Assessment

Unit 2: Introduction to Stacks and Queues

2.1: Introduction to Lists

Lists

2.2: Implementing Lists with Arrays

Array-Based Lists

2.3: Overview of Stacks and Queues

Stacks and Queues

2.3.1: Introduction to Stacks

Stacks

More on Stacks

Data Structures of Stacks

The Stack Data Structure

2.3.2: Introduction to Queues

Queues

More on Queues

Data Structures of Queues

Unit 2 Assessment

Unit 2 Assessment

Unit 3: Pointers and References in C++

3.1: Review of C-Native Variables

C Data Types

Words in Computer Architecture

3.2: Review of Pointers

Backtracking Pseudocode

3.3: Pointing to Memory

Pointers

3.4: Pointers for Scalars, Vectors, and Functions

Everything You Need to Know about Pointers in C

3.5: Pointers for Arrays

Memory Allocation

3.6: Pointer Arithmetic

C Syntax – Pointers

3.7: Working with Pointers

Pointers

Unit 3 Assessment

Unit 3 Assessment

Unit 4: Dynamic Memory Allocation

4.1: C++ Memory Allocation

Memory Management

Dynamic Memory

4.2: C Memory Allocation

C Data Structures

C Pointers and Dynamic Memory Allocation

4.3: Memory Fragmentation

Stacks and Heaps

Allocations and Deallocations

4.4: C/C++ Based on "Unsafe" Types

Unsafe Languages

Unit 4 Assessment

Unit 4 Assessment

Unit 5: Linked Stacks, Queues, and Lists

5.1: Linked Lists

Linked Lists