Present the algorithm of binary search. , Data Structure & Algorithms

Assignment Help:

Binary Search Algorithm is given as follows

1. if (low > high)

2. return (-1)

3. mid = (low +high)/2;

4. if ( X = = a [mid])

5. return (mid);

6. if ( X < a [mid])

7. search for X in a (low) to [mid -1];

8. else

9. search for X in a [mid + 1] to a [high];

Related Discussions:- Present the algorithm of binary search.

Binary search tree, write an algorithm to delete an element x from binary...

write an algorithm to delete an element x from binary search with time complex

Binry trees, Build a class ?Node?. It should have a ?value? that it stores ...

Build a class ?Node?. It should have a ?value? that it stores and also links to its parent and children (if they exist). Build getters and setters for it (e.g. parent node, child n

Explain multiplication method, Multiplication Method: The multiplication m...

Multiplication Method: The multiplication method operates in 2 steps. In the 1ststep the key value K is multiplied by a constant A in the range O

Sorting, how to do a merge sorting

how to do a merge sorting

Matrix stored in memory, Method to measure address of any element of a matr...

Method to measure address of any element of a matrix stored in memory. Let us consider 2 dimensional array a of size m*n further consider that the lower bound for the row index

State the term access restrictions - container, What is Access Restriction...

What is Access Restrictions Structured containers with access restrictions only allow clients to add, remove and examine elements at certain locations in their structure. For

Define the term array, Define the term array. An array is a way to refe...

Define the term array. An array is a way to reference a series of memory locations using the same name. Each memory location is represented by an array element. An array eleme

Quick sort, 24 56 47 35 10 90 82 31

24 56 47 35 10 90 82 31

Program, insertion and deletion in a tree

insertion and deletion in a tree

Singly linked list , The two pointers per number of a doubly linked list pr...

The two pointers per number of a doubly linked list prepare programming quite easy. Singly linked lists as like the lean sisters of doubly linked lists. We need SItem to consider t

Write Your Message!

Name

Email id

Message

Verfication Code

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

Submit Assignment

User Account

All Pages