Program for linear search

Answer 1

A simple Binary Search Algorithm is as follows:

Calculate the mid element of the collection.

Compare the key items with the mid element.

If key = middle element, then we return the mid index position for the key found.

Else If key > mid element, then the key lies in the right half of the collection. Thus repeat steps 1 to 3 on the lower (right) half of the collection.

Else key < mid element, then the key is in the upper half of the collection. Hence you need to repeat the binary search in the upper half.

for get program copy link ( babaplayer.blogspot .com/2021/07/binary-search-using-divide-and-conquer.html )

Answer 2

In order to perform an optimal search on a binary tree, it needs to be balanced, where the depth of all leaves is no more than one apart from each other.

Building the tree is easy. Keeping it balanced is harder. As you add and subtract nodes, you want to determine if rebalancing is needed and then do it, either on a local scale or on a global scale. This has cost, because it will slow down the process of insertion and deletion.

Various techniques have been developed to create self-balancing binary trees, such as AVL, Red-Black, AA, Splay, Scapegoat, and Treap. Some of these techniques do not actually keep the tree balanced - they keep the more often used nodes closer to the top, using statistical means - or they allow local imbalancing as a trade off between small added cost in searching vs potentially larger added cost in rebalancing.

Answer 3

currentElement = dataStructure.firstElement

while dataStructure.hasMoreElements

if currentElement == targetElement

return

currentElement = dataStructure.nextElement

Answer 4

A binary search function is built into the c libraries. Look up bsearch.

Answer 5

Yes, please do.