Description
⮚ Language: C Programming
1. Recursive and iterative solution of:
a. Binary Search
2. Given an array of integers numbers sorted in non-decreasing order, find the starting and ending position of a given target value.
If target is not found in the array, return [-1, -1].
You must write an algorithm with O (log n) runtime complexity. (Format to submit the assignment)
Name:
Registration:
C Program Code:
Reviews
There are no reviews yet.