2.

Introduction To Searching and Sorting Algorithm

Searching and sorting are fundamental algorithmic techniques used across

various industries to optimize performance and improve efficiency. Moreover, they
are also fundamental operations in computer science and are essential in handling
and organizing data efficiently.

2.1 Searching Algorithm

Searching algorithms are used to find a specific element in a collection of
data. They play a crucial role in computer science and data structures. There are
two main types:
 Linear Search
 Binary Search

2.1.1 Linear Search

Linear Search is a sequential searching algorithm that checks each element
in a list one by one until the desired element is found or the list ends. It is the
simplest searching technique and works on both sorted and unsorted data. These
are some key characteristics of linear search:
 Unsorted Data: Can be used on any list, sorted or unsorted.
 Simple Implementation: Easy to code and understand.
 Inefficient for Large Data: Takes O(n) time complexity, making it slow
for large datasets.

2.1.2 Real-World Applications of Linear Search Algorithm

Linear search is widely used is various real-life scenarios where data is not
sorted or when simplicity is preferred over efficiency. Here are some practical
applications:

1
1. Finding a Contact in a Phonebook
If phone numbers are stored in an unsorted contact list, the phone system
checks each entry one by one to find the desired contact.

2. Searching for a Product in a Supermarket

When looking for an item on a randomly arranged shelf, you scan each
product one by one until you find the desired one.

3. Checking Attendance in a Classroom

A teacher takes attendance by scanning a list of student names manually,
checking each one in order.

4. Looking for a File on a Computer

If files are stored without sorting, a system might use a linear search to find
a specific file by checking each file name sequentially.

5. Finding a Specific Word in a Document

A text editor or word processor may use linear search for a word without
indexing or optimization.

6. Debugging in Programming
When searching for a bug or error in a small piece of code, a developer
manually checks each line in a sequential manner.

7. Searching for a Key in an Unordered List

If you drop a set of keys in a box with other objects, you manually check
each object one by one until you find the keys.

2
8. Checking for Duplicates in a Small Datasets
In small data collections, checking for duplicate values can be done using
linear search before inserting a new value.

9. Searching for an Employee in a Small Organization

In small companies where employee records are not stored in sorted order, a
linear search is used to find employee details.

10. Finding a Book in an Unorganized Library

If books are placed randomly on shelves, you search for a book by looking at
each one sequentially.

2.1.3 Binary Search

Binary Search is an efficient searching algorithm that finds a target element
in a sorted list by repeatedly dividing the search range in half. Instead of checking
each element one by one (like linear search), binary search eliminates half of the
elements in each step, making it much faster. These are some key characteristics of
binary search:
 Requires a Sorted List: Works only on ordered data.
 Divides Search Space: Reduces the problem size by half in each step.
 Efficient for Large Data: Has a time complexity of O(log n), making it
much faster than linear search for large datasets.

2.1.4 Real-World Applications of Binary Search Algorithm

Binary search is used in various real-world scenarios where data is sorted
and fast searching is required. Here are some key applications:

3
1. Searching in a Phonebook or Contact List
When contacts are sorted alphabetically, binary search helps find a name
quickly instead of checking each contact one by one.

2. Dictionary Word Lookup

In digital and printed dictionaries, words are arranged alphabetically. Binary
Search efficiently finds a word by narrowing down the search range.

3. Searching in Large Databases

Large databases store sorted records (e.g., employee IDs, customer details).
Binary search helps retrieve data quickly.

4. Finding Elements in Sorted Arrays or Lists

In programming, binary search is used to find elements in sorted arrays, lists,
or collections efficiently.

5. Searching for a Target Value in Financial Data

Stock market applications use binary search to quickly find stock prices,
historical records, or transactions from a sorted list of timestamps.

6. Debugging in Programming (Binary Search in Errors)

Programmers use binary search debugging to find the point where a bug
appears by checking the middle of a code segment first.

7. Finding a Specific Page in a Book

If you know a book is organized by topics or page numbers, you can find a
specific page by flipping to the middle first (like a manual binary search).

4
8. Searching for a Product in an Online Store
E-commerce platforms use binary search to find products in sorted lists of
prices, ratings, or categories to improve search speed.

9. Medical Data Analysis (Searching Patient Records)

Hospitals store patient data in sorted order (e.g., by name, ID, or admission
date). Binary search helps quickly locate a patient’s records.

10. Networking Routing Algorithms

Internet routers use binary search in IP lookup tables to efficiently
determines the best path for data transmission.

2.1.5 Comparison of Linear Search and Binary Search

5
 Binary Search is generally better for large datasets because it is much faster.
However, if the data is unsorted and cannot be easily sorted, Linear Search is the
only option.

2.2 Sorting Algorithm

Sorting algorithms are used to arrange elements in a specific order
(ascending or descending). They can be categorized into different types based on
their efficiency and approach:
 Bubble sort
 Selection sort
 Insertion sort
 Binary Insertion sort
 Shaker sort
 Merge sort
 Quick sort

2.2.1 Bubble Sort

Bubble sort is a simple sorting algorithm that repeatedly steps through the
list, compares adjacent elements, and swaps them if they are in the wrong order.
This process continues until the list is sorted. The algorithm gets its name because
smaller elements “bubble” to the top while larger elements sink to the bottom.

Algorithm Steps:
1. Starting at the beginning of the list.
2. Compare the first two elements; if the first is greater than the second, swap
them.
3. Move to the next pair of elements and repeat step 2.
4. Continue this process for the entire list.
5. Repeat the entire process for n-1 passes until no swaps are needed.

6
Example of Bubble sort (Sorting [ 5, 3, 8, 4, 6])
1. First Pass: [3, 5, 4, 6, 8]
2. Second Pass: [3, 4, 5, 6, 8] (Sorted)

Fig 2.1 First Pass of the Example of Bubble Sort

2.2.2 Real-World Applications of Bubble Sort

Bubble Sort, despite being simple and inefficient for large datasets, has some
real-world applications due to its straightforward implementation and behavior.
However, it is generally used in scenarios where performance is not a major

7
concern, or for educational purposes to demonstrate sorting concepts. Here are a
few potential real-world applications:
1. Teaching and Learning Algorithms
Educational Tool: Bubble Sort is often used in computer science and
algorithm courses to introduce sorting algorithms. Its simplicity helps students
understand basic sorting concepts, such as comparisons, swaps, and iteration.

2. Small Datasets
Small Data Collections: For small data sets, the overhead of more complex
algorithms (like Merge or Quick Sort) may not be necessary, and Bubble Sort can
perform adequately. For instance, sorting a few items in a small database or an
array might use Bubble Sort due to its simplicity.

3. Nearly Sorted Data

Almost Sorted Data: If a list is nearly sorted or only requires a few swaps,
Bubble Sort can perform efficiently in terms of operations (best case time
complexity if O(n)).

4. Real-time Systems
Low-memory or Embedded Systems: In environments where memory is limited
and the data size is small, Bubble Sort can be considered because it doesn’t require
additional memory (space complexity is O (1)). Its simplicity means less resource
overhead in certain applications.

5. Stability Requirements
Stable Sorting: Bubble Sort is a stable sorting algorithm, meaning that it
preserves the relative order of elements with equal values. This property can be
useful in scenarios where secondary attributes need to remain unchanged).

8
6. Legacy Systems
Older Software Systems: In legacy systems or applications where the dataset
size has remained small or unchanging, developers may have used Bubble Sort
because it was easy to implement when resources and performance weren’t as big
of concerns.

7. Optimizations in Specific Use Cases

Optimized Variants: Although Bubble Sort is inefficient in general,
with minor optimizations like checking if a pass completes without swaps
(indicating the list is sorted), it can be used in scenarios where the dataset is small
or mostly sorted.

In general, while there are more efficient algorithms for large datasets,
Bubble Sort still has niche applications in smaller, more controlled environments
or educational contexts.

2.2.3 Limitations of Bubble Sort

 O(n2) Time Complexity: Slow for large datasets.

 Inefficient for Large Data: Becomes impractical as dataset size increases.

 Unnecessary Comparisons: Continues even after the list is sorted.

 Poor Performance in Worst Case: Especially with reverse-sorted lists.

 Not Suitable for Large-Scale Applications: Better algorithms exist.

9
2.3 Reasons of Using Searching and Sorting Algorithm

Searching and sorting algorithms are fundamental to computer science

because they help manage and process large amounts of data efficiently. These
algorithms are essential in real-world applications for the following reasons:

1. Efficient Data Retrieval

In a world where we handle massive datasets (big data, cloud storage,
databases), searching algorithms allow quick access to information.
Example: Google Search uses inverted indexing and binary search to deliver
search results in milliseconds.

2. Faster Decision-Making
Sorting helps organize data, making it easier to analyze and process.
Example: In financial markets, sorting algorithms are used to arrange stock prices
for quick trading decisions.

3. Optimized Performance in Applications

Without proper sorting or searching, operations can be slow and inefficient,
especially as data grows.
Example: In e-commerce platforms like Amazon, sorting products by price or
popularity allows users to find what they need quickly.

4. Reducing Computational Complexity

10
 A bad algorithm can take minutes or even hours to process data, while an
optimized one can do it in seconds.
Example: Instead of scanning an entire database (O(n) linear search), binary
search (O(log n)) reduces the number of comparisons drastically.

5. Practical Applications in AI and Robotics

Robots and self-driving cars use pathfinding algorithms (which involve
sorting and searching) to navigate in real-time.
Example: Dijkstra’s Algorithm (O(V²) or O(E log V)) is used in GPS and
autonomous vehicle navigation.

6. Better User Experience in Software & Web Applications

Sorting algorithms help rank content, improving user interaction.
Example: Social media platforms use sorting algorithms to prioritize posts based
on engagement.

7. Enhancing Security & Cryptography

Searching algorithms are used in authentication systems to verify user
credentials quickly.
Example: Hashing (O(1) complexity) allows passwords to be securely stored and
retrieved without searching through a long list of users.

Searching and sorting algorithms make systems faster, more efficient, and
scalable. They are used in search engines, e-commerce, cybersecurity, AI, finance
and more. Choosing the right algorithm can mean the difference between a slow,
inefficient system and a high-performance application.

11
12