You need to do a "binary search" to determine the maximum effective value of n for each algorithm. You need to use the IF function. The assignment needs to be in C++. Hope this helps.

bool isUniqueLoop(const vector& arr, int start, int end) {

if (start >= end) return true;

for (int i = start; i < end; i++)

} for (int j = i+1; j <= end; j++)

if (arr[i] == arr[j]) return false;

return true;

}

2.

bool isUniqueSort(const vector& arr, int start, int end) {

if (start >= end) return true;

vector buf(arr); // duplicate copy of arr

sort(buf.begin()+start, buf.begin()+end); // sort the subarray

for (int i = start; i < end; i++) // check for duplicates

if (buf[i] == buf[i+1]) return false;

return true;

}