 |
CS201 GDB NO. 1 FALL 2022 |
KINDLY, DON’T COPY PASTE
CS201 GDB NO. 1 FALL 2022 || 100% RIGHT SOLUTION || INTRODUCTION TO PROGRAMMING || BY VuTech
Visit Website For More Solutions
www.vutechofficial.blogspot.com
SEND WHATSAPP OR E-MAIL FOR ANY QUERY
0325-6644800
kamranhameedvu@gmail.com
CS201
GDB NO. 1
INTRODUCTION TO PROGRAMMING
FALL 2022
LAST DATE:
22-12-2022
SOLUTION:
Linear Search:
Linear search is an algorithm to find an element in a
list by sequentially checking the elements of the list until finding the
matching element.
Binary Search:
Binary search is an algorithm that finds the position
of a target value within a sorted array. Thus, this is the main difference
between linear search and binary search.
In this case, I
will use Binary searching algorithm. Binary search is a very
efficient and fast algorithm to find an element inside a sorted list of
elements, this algorithm works based on the principle of divide and conquer.
The first step for a binary search algorithm to work is to have the list of
elements sorted.
Binary search is faster than linear search except for
small arrays. However, the array must be sorted first to be able to apply
binary search. There are specialized data structures designed for fast
searching, such as hash tables, that can be searched more efficiently than
binary search.
The binary search algorithm works on the principle of
divide and conquer and it is considered the best searching algorithm because
it's faster to run.
Although linear and binary searching produces the same
overall results, linear search is best used when the data is not in order, or
for smaller lists. However, when the list is much longer and the data is in
order, it is far more efficient to calculate the indexes needed to perform a
binary search.
KINDLY, DON’T COPY PASTE
SUBSCRIBE, SHARE, LIKE AND COMMENTS FOR MORE UPDATES
SEND WHATSAPP OR E-MAIL FOR ANY QUERY
0325-6644800
kamranhameedvu@gmail.com