ขนาดวิดีโอ: 1280 X 720853 X 480640 X 360
แสดงแผงควบคุมโปรแกรมเล่น
เล่นอัตโนมัติ
เล่นใหม่
Bro nice presentation but we need English version also it will reach more students thanks in advance sir
python, javascript languages companies coding interviewsil allowed ano?
Nammalippo usern value enter cheyan paranjal return middle+1 alle kodkendad.Usern array position ariyende avasshyamilallo?Oru doubt(Binary searchl)
Adutha series etha python ano flutter ano
24:40 middle 6.5alle🙄
starting variable 6 aan
sambam ashaanod shishyanmaar chodhyam chodikumbo ariyathathath kondaano complex topicil nikhil sir missing ?? 😅
were is nikill sir? too missing nikill sir
he will come to wind up Data Structure Challenge
Jump Search public static int jumpSearch(int[] array, int target) { int pointer = 0; int distance = (int) (Math.sqrt(array.length)) - 1; for (pointer = 0; pointer target) { break; } } int checker = pointer - distance; while (checker != pointer) { if (array[checker] == target) { return checker; } checker++; } return -1; }
Django tutorial eppo start cheyyum??
we can start it ASAP
Master project 2.0?
yeah! we can conduct Master Project 2.0
Hi
helloo
bug bounty
Nikhil sir evd poii....
korch rest edtha, he’ll be back soon
@@BrototypeMalayalam nikhil sir explanation super aanu...point point aai parayum...i mean pettanu ethoralkkum mnzil aakum...
@@BrototypeMalayalam koracho ?? 🙄
Bro nice presentation but we need English version also it will reach more students thanks in advance sir
python, javascript languages companies coding interviewsil allowed ano?
Nammalippo usern value enter cheyan paranjal return middle+1 alle kodkendad.
Usern array position ariyende avasshyamilallo?
Oru doubt
(Binary searchl)
Adutha series etha python ano flutter ano
24:40 middle 6.5alle🙄
starting variable 6 aan
sambam ashaanod shishyanmaar chodhyam chodikumbo ariyathathath kondaano complex topicil nikhil sir missing ?? 😅
were is nikill sir?
too missing nikill sir
he will come to wind up Data Structure Challenge
Jump Search
public static int jumpSearch(int[] array, int target) {
int pointer = 0;
int distance = (int) (Math.sqrt(array.length)) - 1;
for (pointer = 0; pointer target) {
break;
}
}
int checker = pointer - distance;
while (checker != pointer) {
if (array[checker] == target) {
return checker;
}
checker++;
}
return -1;
}
Django tutorial eppo start cheyyum??
we can start it ASAP
Master project 2.0?
yeah! we can conduct Master Project 2.0
Hi
helloo
bug bounty
Nikhil sir evd poii....
korch rest edtha, he’ll be back soon
@@BrototypeMalayalam nikhil sir explanation super aanu...point point aai parayum...i mean pettanu ethoralkkum mnzil aakum...
@@BrototypeMalayalam koracho ?? 🙄