Implement Binary Search algorithm to search for a number 70 in the following sorted array of 10 integer numbers. Calculate the total no of mid operations, if statement and else ifcomparison operations and the number of times the loop will execute.
| 5 | 10 | 25 | 30 | 37 | 46 | 55 | 60 | 65 | 70 |
Write a program to traverse a graph using DFS. Apply this algorithm to the following graph and write the sequence of vertices to be travelled. Also calculate the number of times the for loop and if condition will execute in this example.
Sure, I'll provide you with both the Binary Search algorithm implementation for the given sorted array and a DFS traversal of the provided graph.
Binary Search Algorithm:
```python
def binary_search(arr, target):
low, high = 0, len(arr) - 1
mid_operations = 0
if_operations = 0
else_if_operations = 0
while low <= high:
mid = (low + high) // 2
mid_operations += 1
___ _____ ____ __________ __________ __________ ______ __________ __________ ______ ____.
___ ______ ______ ____ __________ ___.
___ ______ __________ ___ _____ ____ _____ __________.
________ ______ ________ ____ __________.
___ _________ __________ ________ ______ __________ __________ ________ ____ ___ ________ _____.
__________ ____ ____ ______ _________ _____ ______.
___ ______ ___ _______ __________ ____ ________ ____.
_________ ___ _____ ______ _____ ______ __________ ________ ____ _____ _________ ____.
______ ____ _________ ___ _______ _____ ________ ______ _________ ______.
_________ ______ _______ ______ _____ _________ ______ _________ ____ ________ ______ _______.
______ __________ __________ ___ ______ ________ ______ __________ ___ ___ ____.
____ ________ _______ ________ __________ _________ __________ ______ __________.
____ _______ _____ __________ ______.
______ _____ ___ _______ _______ ____.
_________ _____ _______ ___ ____ ___ _____ ____ ______ ____ _____.
__________ ____ _________ _______ __________ _______ ____ __________ ______.
__________ _____ ____ _____ ___ ____ __________ ________.
_____ _______ ___ _________ ______ ________ __________ _______.
_______ ____ _________ ______ ___ ____ _______.
__________ ________ _______ ______ ___.
________ ______ ________ ______ ____ _________ ______ __________.
__________ ______ _______ _______ _____ ____ _________.
___ _____ ___ ____ ______ ______ ______ ____ __________ ________ _______ _________.
_________ _________ _______ ________ ___ _________ ________ ______ _______ _________.
__________ _____ ______ __________ __________ _______.
_________ ________ _______ ___ ________ _______ ____.
__________ ____ _________ ____ _____ _________ _________ ___ _______ ___ ____ _________.
____ ______ ___ _____ ___ _____ _________ __________ ______ ___ _________ _____.
_________ _____ __________.
Get Full Answer on WhatsApp
Implement Prim’s algorithm to find a minimum cost spanning tree of the following graph and print the result . Represent the graph through adjacency matrix,
Implement Horner’ rule for evaluating the following polynomial expression at x =5. Calculate the total number of times additions and multiplication operations will ocuur in this example
p(x) = 3
Implement Binary Search algorithm to search for a number 70 in the following sorted array of 10 integer numbers. Calculate the total no of mid operations, if statement and else ifcomparison operations and the number of times the loop will execute.
| 5 | 10 | 25 | 30 | 37 | 46 | 55 | 60 | 65 | 70 |
Write a program to find the maximum of the following list of integer numbers: 15, 20, 5, 4, 3, 17, 35.
Calculate
(i) the number of times the loop will execute and (ii) the number of times the if statement will run in this s example.
Write a program to count the number of times an integer number 12 has occurred in the following array of 10 integer numbers. 15, 20, 35, 12, 11, 8 ,12, 7, 12, 16
Calculate the number of times (i) loop statement and (ii) increment operations will execute in this example.
Write and test a program to sort the following array of 10 integer numbers using Selection Sort . Calculate the numbers of times the outer loop, inner loop, if statement and and swap operation will execute in this example. Show all the intermediate steps.
| 15 | 45 | 60 | 25 | 35 | 8 | 40 | 5 | 10 | 27 |