Velikost videa: 1280 X 720853 X 480640 X 360
Zobrazit ovladače přehrávání
Automatické přehrávání
Přehrát
Thx a lot for this awesome video! I love Geeks for Geeks videos and love the website! Another good job! Another good video!
What is low and high here??Is that the index or array element??
Why linear serach is so complicated why not just: private static int ceilOfArr(int[] givenArr, int x) { for (int i = 0; i < givenArr.length; i++) { if (givenArr[i] >= x) return givenArr[i]; } return -1; }?
time complexity
This is not the simplest implementation.
then whats the simplest implementation??
Thx a lot for this awesome video! I love Geeks for Geeks videos and love the website! Another good job! Another good video!
What is low and high here??
Is that the index or array element??
Why linear serach is so complicated why not just:
private static int ceilOfArr(int[] givenArr, int x) {
for (int i = 0; i < givenArr.length; i++) {
if (givenArr[i] >= x)
return givenArr[i];
}
return -1;
}
?
time complexity
This is not the simplest implementation.
then whats the simplest implementation??