Скачать или смотреть Searching In C++

C++ PROGRAMMING LECTURE N0-21


Searching In C++
What is searching in C++?
Searching is the process of finding a given value position in a list of values. It decides whether a search key is present in the data or not. It is the algorithmic process of finding a particular item in a collection of items. It can be done on internal data structure or on external data structure.



Why is searching needed?
We often need to find one particular item of data amongst many hundreds, thousands, millions or more. ... In a large set of data, it will take a long time to do this. Instead, a searching algorithm can be used to help find the item of data you are looking for.


1) Sequential searching (Linear searching)
Sequential searching is nothing but searching an element in linear way. This can be in array or linked list. Its start the search from beginning and scan the elements one by one until the end of array or linked list. If search is successful then it will return the location of element, otherwise it will return the failure notification.


Algorithm

Step 1- INDEX=0
Step 2- Scan each element of array one by one.
Step 3- a) If match occurs then return the index value,
b) Otherwise INDEX=INDEX+1
Step 4- Repeat the same process until unique value comes in scanning.
Step 5- Return the failure notification.


Q-No-1- WAP To Enter number and strore an Array Linear search in C++.


2. Binary Search

The condition of binary search is that all the data should be in sorted array. We compare the element with middle element of the array. If it is less than the middle element then we search it in the left portion of the array and if it is greater than the middle element then we search it in the left portion of the array and if it is greater than the middle element then search will be in the right portion of the array. Now we will take that portion only for search and compare with middle element of that portion. This process will be in iteration until we find the element or middle element has no left or right portion to search.

Ex- arr [0] [1] [2] [3][4] [5] [6][7] [8] [9]
10 18 19 2025 30 4957 64 72

Suppose the element we are searching is 49.

Q-No-1- WAP To enter number and store and Array and search Binary search.


Please subscribe my channel for getting video related to information technology.
https://www.youtube.com/channel/UCbSg...
Follow on Facebook:   / kiet-patna-1.  .


Follow on Instagram:  / nasim.raja.10  

Download KIET PATNA App.
Patna's Top IT training Institute!!
https://play.google.com/store/apps/de...

   / @kietpatna3180  

#COMPUTEREDUCATION


#KIETPATNA #COMPUTERINSTITUTE #PATNA