Jump Search | Jump search algorithm | Explained with example | Code explanation

Jump Search explained with example and code explanation. Try the code yourself from git.

Thanks for watching! Hope you learnt something new :-)

[Pixelofficialmohit]

What if we apply the binary search in that part of array instead of linear search, i guess it will be more efficient then ..pls reply

[SNK_Tech]

Good Explanation and your voice makes anybody to listen your videos..sweet voice

[sharanxxxx]

// I stumbled upon a fantastic YouTube video that provided an exceptional explanation of the concept. It clarified the intricacies of the topic with such clarity and depth, making it incredibly easy to grasp. Watching it was an enlightening experience, and I'm grateful for the effort put into creating such valuable educational content.

New crush updated!

[priyanshukushwah-lj]

thanks for sharing easy explaination of jump search

[pandesalkape]

Thanks. ur vid had clearer explanations than my prof. it had bugs but i fixed it

[riyabhandari]

Very Nice video, the way you explain it calmly makes me understand the working easily 💯💯

[turinumugishasouvenir]

I absolutely liked everything about this video! Thanks for the efforts

[MukeshYadav-]

great content @code wagon
feedback: show confidence, improve voice quality, get aware more about the system frankly

[Mastermindshares]

your videos are awesome keep on doing it.

[chakshudeepmeharwal]

Something, i was looking for❤️❤️❤️
Lots of love 💗

[ashajoshi]

Code will produse wrong output if key index is same as "end" value

[swacharahman]

Hello, it's a good explanation. but code is not working;

public class jump_search {
public static void main(String[] args) {
int[] arr = {3, 11, 23, 34, 48, 51, 72, 86, 92};
int length = arr.length;
int key = 86;
System.out.println(jumpSearch(arr, length, key));
}

public static int jumpSearch(int[] arr, int length, int key) {
int start = 0;
int end = (int) Math.sqrt(length);
while (arr[end] < key && start < length) {
start = end;
end = end + (int) Math.sqrt(length);

if (end > length - 1) {
end = length;
}
}
for (int i = start; i < end; i++) {
if (arr[i] == key) {
return i;
}
}
return -1;
}
}