From 6e2ae0de7a8eac99a8d86c04109fb9186211fd66 Mon Sep 17 00:00:00 2001 From: TobiDueces <44579378+TobiDueces@users.noreply.github.com> Date: Mon, 29 Oct 2018 22:11:46 +0530 Subject: [PATCH 1/2] Add Jump Search image --- README.md | 3 +++ 1 file changed, 3 insertions(+) diff --git a/README.md b/README.md index b96ef8655f9f..e543c05cb7b3 100644 --- a/README.md +++ b/README.md @@ -177,6 +177,7 @@ In interpolation-sequential search, interpolation is used to find an item near t ###### Source: [Wikipedia](https://en.wikipedia.org/wiki/Interpolation_search) ## Jump Search +![alt text][JumpSearch-image] In computer science, a jump search or block search refers to a search algorithm for ordered lists. It works by first checking all items Lkm, where {\displaystyle k\in \mathbb {N} } k\in \mathbb {N} and m is the block size, until an item is found that is larger than the search key. To find the exact position of the search key in the list a linear search is performed on the sublist L[(k-1)m, km]. The optimal value of m is √n, where n is the length of the list L. Because both steps of the algorithm look at, at most, √n items the algorithm runs in O(√n) time. This is better than a linear search, but worse than a binary search. The advantage over the latter is that a jump search only needs to jump backwards once, while a binary can jump backwards up to log n times. This can be important if a jumping backwards takes significantly more time than jumping forward. @@ -294,3 +295,5 @@ where {\displaystyle \oplus } \oplus denotes the exclusive disjunction (XOR) op [ROT13-image]: https://upload.wikimedia.org/wikipedia/commons/3/33/ROT13_table_with_example.svg [QuickSelect-image]: https://upload.wikimedia.org/wikipedia/commons/0/04/Selecting_quickselect_frames.gif + +[JumpSearch-image]: https://i1.wp.com/theoryofprogramming.com/wp-content/uploads/2016/11/jump-search-1.jpg From 297e41e58836e531d68f0eb94a436cadaf4c1dcd Mon Sep 17 00:00:00 2001 From: TobiDueces <44579378+TobiDueces@users.noreply.github.com> Date: Mon, 29 Oct 2018 22:21:04 +0530 Subject: [PATCH 2/2] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index e543c05cb7b3..25fd6395f738 100644 --- a/README.md +++ b/README.md @@ -296,4 +296,4 @@ where {\displaystyle \oplus } \oplus denotes the exclusive disjunction (XOR) op [QuickSelect-image]: https://upload.wikimedia.org/wikipedia/commons/0/04/Selecting_quickselect_frames.gif -[JumpSearch-image]: https://i1.wp.com/theoryofprogramming.com/wp-content/uploads/2016/11/jump-search-1.jpg +[JumpSearch-image]: https://i1.wp.com/theoryofprogramming.com/wp-content/uploads/2016/11/jump-search-1.jpg "Jump Search"