You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Jump search is an efficient algorithm designed for searching an element in a sorted array. It works by dividing the array into blocks of a fixed size (jump size), and then checks the elements in increments (or "jumps") of that size. Once it finds a block that contains the target, it performs a linear search within that block.
The text was updated successfully, but these errors were encountered:
Hi @FerdausPolok,
I came upon this Repo as part of my course work to get involved with Open Source and Hacktoberfest, first of all thankyou for hosting this repo for the fest. An update for my issue i have a send a PR, please let me know any other changes are required or not i am happy to help and i have some ideas that we can use in this repo in the future.
Thanks again !
Great. I would also request you to add a description into the PR and assign me there as a reviewer once you're done. Thanks @ajogseneca for your contribution. 🚀
Jump Search
Jump search is an efficient algorithm designed for searching an element in a sorted array. It works by dividing the array into blocks of a fixed size (jump size), and then checks the elements in increments (or "jumps") of that size. Once it finds a block that contains the target, it performs a linear search within that block.
The text was updated successfully, but these errors were encountered: