Chapter 6, Problem 6.3.1E

Program Plan Intro

Parallelism:

The state of being parallel and having correspondence among them is referred as parallelism. Two or more tasks can be performed simultaneously, without affecting the performance of the either one.

Given Information:

It is given that for a binary search algorithm which is a divide and conquer algorithm searches for a value of “x” in an sorted N-element array “A” and returns the index of matched entry.

Given code statement:

//Binary Search algorithm

//Array and number is passed as parameter

BinarySearch(A[0..N-1], X) {

//low is assigned as "0"

low = 0

//high is assigned as last number-1

high = N - 1

while (low <= high) {

//find middle number

mid = (low + high) / 2

/* check is mid is greater than "x" */

if (A[mid] > X)

/* assign high left to mid */

high = mid - 1

elseif (A[mid] < X)

/*assign low right to the mid */

low = mid + 1

else

// found

return mid

}

//not found

return -1

}