Linear Search Algorithm

Introduction Generations of Computers Classification of Computers Basic Anatomy of a Computer System Memory Management Computer Software Operating System

Algorithm Flowcharts

Programming Language Generations of Programming Languages Introduction to C Structure of C Programming Language Integrated Development Environment First C program, Hello World Executing a C Program Constants in C Variables in C C Storage Classes and Storage Class Specifiers

Introduction Arithmetic operators Relational Operators Logical Operators Assignment Operator Increment and Decrement Operators Conditional Operators Bitwise Operators Precedence and Associativity

Control Instructions in C if Statement in C if-else Statement Nested if-else statement else if ladder Switch Statements in C

Loops Introduction for Loop while loop in C do-while Loop break and continue statements

Array in C One Dimensional array Two Dimensional Array Multidimensional Arrays

Modular Programming Functions

Searching Techniques Linear Search Algorithm Binary-Search-Algorithm

Sorting Introduction Bubble Sort

What is Strings Standard Library String Functions

Structure Introduction Defining a Structure Declaration of Structure Example of Structure Union Introduction Defining a Union Accessing Union Members

Pointers in C Accessing the Address of a variable Pointer Operations

Dynamic Memory Allocation

The linear search algorithm is also known as the sequential search algorithm. It is the most basic search algorithm. We just traverse the list in linear search and match each element of the list with the item whose position has to be discovered. If a match is found, the algorithm delivers the item's location; otherwise, NULL is returned.

It is widely used to search an element from the unordered list, i.e., the list in which items are not sorted.

Working of Linear Search

Algorithm of Linear search

Linear Search ( Array A, Value x)

Step 1: Set i to 1
Step 2: if i > n then go to step 7
Step 3: if A[i] = x then go to step 6
Step 4: Set i to i + 1
Step 5: Go to Step 2
Step 6: Print Element x Found at index i and go to step 8
Step 7: Print element not found
Step 8: Exit

Fundamentals of the Computer System

Introduction to Algorithm

Programming Basics

Operators in C

Conditional Branching

Iteration and Loops

Array in C

Functions in C

Searching Algorithms

Sorting Algorithms

Strings

Structures and Union

Pointers in C

File Handling in C

Advanced

Linear Search Algorithm

Working of Linear Search

Algorithm of Linear search