Answer:
The answer is option A.
Explanation:
Negative numbers can be found by binary search, this makes option B incorrect.
Unsorted and randomized lists are also not things that support a binary search, options C and D are incorrect.
Binary search uses a technique where the middle element of the list is located and used to determine whether the search should be done within the lower indexed part of the list or the higher. So for a list to be binary search-able, it should be sorted and not randomized.
The answer is A.
I hope this helps.
Microsoft Excel is a spreadsheet program included in the Microsoft Office suite of applications. ... Spreadsheets present tables of values arranged in rows and columns that can be manipulated mathematically using both basic and complex arithmetic operations and functions.
.
Answer:
Assumption: Only 1 job can be taken at a time
This becomes a weighted job scheduling problem.
Suppose there are n jobs
Sort the jobs according to fj(finish time)
Define an array named arr to store max profit till that job
arr[0] = v1(value of 1st job)
For i>0. arr[i] = maximum of arr[i-1] (profit till the previous job) or wi(weight of ith job) + profit till the previous non-conflicting job
Final ans = arr[n-1]
The previous non-conflicting job here means the last job with end timeless than equal to the current job.
To find the previous non-conflicting job if we traverse the array linearly Complexity(search = O(n)) = O(n.n) = O(n^2)
else if we use a binary search to find the job Complexity((search = O(Logn)) = O(n.Log(n))
Commands are organized into tabs on the A. Ribbon
