HomeworkLib
Question

Discrete Mathematics Trace the execution of the binary search algorithm given the following list of values:...

Discrete Mathematics

Trace the execution of the binary search algorithm given the following list of values: 3, 5, 6, 8, 9, 11, 14, 16 and the target value 5. Give the state of the list after each time it is divided (the start and end positions of the list). How many times does the while loop execute?

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1 
Searching for 5 in list [3, 5, 6, 8, 9, 11, 14, 16]
   start = 0, end = 7, mid = 3
   > Middle element in this list is 8
   > Compare Target (5) with middle element (8) of this list
   > Target value (5) is smaller than this middle element 8
   > so, we have to search in left part of the list([3, 5, 6])
Searching for 5 in list [3, 5, 6]
   start = 0, end = 2, mid = 1
   > Middle element in this list is 5
   > Compare Target (5) with middle element (5) of this list
   > They are the same. Target element (5) is found. so, binary search ends here.
It took a total of 2 comparisons using binary search
0 0
Add a comment
Know the answer?
Add Answer to:
Discrete Mathematics Trace the execution of the binary search algorithm given the following list of values:...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • Java The following questions ask about tracing a binary search. To trace the binary search, list...

    Java The following questions ask about tracing a binary search. To trace the binary search, list the value of first, last, and mid for each pass through the loop or method. Use one of these methods for your trace. public static int binarySearchIterative(int[] numbers, int target) { boolean found = false; int first = 0; int last = numbers.length - 1; while (first <= last && !found) { int mid = (first + last) / 2; if (numbers[mid] == target)...

  • Discrete Mathematics Unsorted and Sorted Lists For linear search there was no requirement for the list...

    Discrete Mathematics Unsorted and Sorted Lists For linear search there was no requirement for the list to be organized in any manner. The linear search works for lists that are "unsorted." But what if the values in the list are given in ascending order? This would be a sorted list. With a sorted list, is there a more efficient way to find the target? Unsorted Lists (4 pts) Assume there is a sorting algorithm with order of growth O(n), where...

  • Show the steps of the binary search algorithm (pseudocode is given below); low = index of...

    Show the steps of the binary search algorithm (pseudocode is given below); low = index of first item in list high = index of last item in list while low is less than or equal to high mid = index halfway between low and high if item is less than list[mid] high = mid - 1 else if item is greater than list[mid] low = mid + 1 else return mid end while return not found For each step of...

  • Searching/sorting tasks and efficiency analysis - Binary Search Search for the character S using the binary...

    Searching/sorting tasks and efficiency analysis - Binary Search Search for the character S using the binary search algorithm on the following array of characters: A E G K M O R S Z. For each iteration of binary search use a table similar to the table below to list: (a) the left index and (b) the right index of the array that denote the region of the array that is still being searched, (c) the middle point of the array,...

  • 14. (10 points) Using a binary search tree algorithm, draw and explain the tree that describes the following sentence. Discrete math is fun but sometimes hard. 14. (10 points) Using a binary...

    14. (10 points) Using a binary search tree algorithm, draw and explain the tree that describes the following sentence. Discrete math is fun but sometimes hard. 14. (10 points) Using a binary search tree algorithm, draw and explain the tree that describes the following sentence. Discrete math is fun but sometimes hard.

  • The binary search algorithm is used to search the following array for the value 59. In...

    The binary search algorithm is used to search the following array for the value 59. In the table below, list the values for the subscript variables low, high, and mid for each pass through the algorithm's while loop. (There may be fewer than five passes.) 10 19 24 37 42 48 52 59 65 78 Pass 1: low =  high =  mid = Pass 2: low =  high =  mid = Pass 3: low =  high =  mid = Pass 4: low =  high =  mid = Pass...

  • Discrete Mathematics 5. i) Describe an algorithm that, upon input of a number n given in...

    Discrete Mathematics 5. i) Describe an algorithm that, upon input of a number n given in base 10, outputs the digits of n in base 8, starting from the rightmost. Esrample: If you are given the number 156, the output will be 432, because (156) 10 = (234)s. ii) What will be the complexity of the algorithm? You may assume that performing the division algorithm upon two numbers to find the quotient and remainder is the basic operation. (As a...

  • 4. i) Give the difference between binary trees and Binary search trees. Insert the values 50,...

    4. i) Give the difference between binary trees and Binary search trees. Insert the values 50, 76, 21, 4, 32, 64, 15, 52, 14, 100, 2, 3, 70, 87, 80 in the BST [Show the steps]. Write the algorithm for all the 3 operations of BST ii) Insert the given items 16, 14, 10, 8, 7, 9, 3, 2, 4, l into the Min- Heap. [Show the steps]. Write the pseudocode for Insertion of items using the Min- Heap

  • Insert the following values in the given order into a Binary Search Tree and use the...

    Insert the following values in the given order into a Binary Search Tree and use the resulting BST in the next 5 questions. 15 8 3 6 23 9 11 10 20 13 5 9. What is the height of the resulting Binary Search Tree? 10. What is the depth of the node that stores the value 11? 11. Is there a path from the node storing the value 15 to the node storing the value 5? If so, show...

  • Use one of these methods for your trace. public static int binarySearchIterative(int[] numbers, int target) {...

    Use one of these methods for your trace. public static int binarySearchIterative(int[] numbers, int target) { boolean found = false; int first = 0; int last = numbers.length - 1; while (first <= last && !found) { int mid = (first + last) / 2; if (numbers[mid] == target) { targetLocation = mid; found = true; } else if (numbers[mid] < target) { first = mid + 1; } else { // numbers[mid] > target last = mid - 1;...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT