Consider the following code fragment: static int f(int[ ] arr, int x ) { int start = 0; int end - arr.length -13; int mid; while(start x) { end - mid-1; } else { return mid; } } return -1; } Give the...

$Consider the following code fragment: static int f(int[ ] arr, int x ) { int start = 0; int end - arr.length -13; int mid; while(start <= end) { mid = start + ((end - start)/2); if(arr[ mid ] < x) { start mid+1; } else if(arr[ mid ] > x) { end - mid-1; } else { return mid; } } return -1; } Give the worst case big-O cost where the length of the array is N. O O(N^2) O (1) O 0(2^N) O O(logN) O(N) $

Extracted text: Consider the following code fragment: static int f(int[ ] arr, int x ) { int start = 0; int end - arr.length -13; int mid; while(start <= end)="" {="" mid="start" +="" ((end="" -="" start)/2);="" if(arr[="" mid="" ]="">< x)="" {="" start="" mid+1;="" }="" else="" if(arr[="" mid="" ]=""> x) { end - mid-1; } else { return mid; } } return -1; } Give the worst case big-O cost where the length of the array is N. O O(N^2) O (1) O 0(2^N) O O(logN) O(N)

Jun 10, 2022

SOLUTION.PDF

Consider the following code fragment: static int f(int[ ] arr, int x ) { int start = 0; int end - arr.length -13; int mid; while(start x) { end - mid-1; } else { return mid; } } return -1; } Give the...

Get Answer To This Question

Related Questions & Answers

Submit New Assignment