{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":602466418,"defaultBranch":"master","name":"alx-low_level_programming","ownerLogin":"lawalTheWest","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2023-02-16T09:16:24.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/45957199?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1678137297.9352572","currentOid":""},"activityList":{"items":[{"before":"5aaefef702f26bf3f66c03606db39a3fbce22889","after":"2b6788ebf26d1345f42ddf28b69210a65d61ef2e","ref":"refs/heads/master","pushedAt":"2024-04-13T16:54:45.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":"added the description for the function","shortMessageHtmlLink":"added the description for the function"}},{"before":"537995be76ee763a81b91738928c7a6a061fc6ca","after":"5aaefef702f26bf3f66c03606db39a3fbce22889","ref":"refs/heads/master","pushedAt":"2024-04-13T16:53:53.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":"updated the documentation for the search algorithm","shortMessageHtmlLink":"updated the documentation for the search algorithm"}},{"before":"d06be0a07b4e0202d13f4edafeaddc3c3782417c","after":"537995be76ee763a81b91738928c7a6a061fc6ca","ref":"refs/heads/master","pushedAt":"2024-04-11T21:26:17.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":" the time complexity (average case) of a jump search in a skip list of size n, with an express lane using step = sqrt(n)","shortMessageHtmlLink":" the time complexity (average case) of a jump search in a skip list o…"}},{"before":"60c4cc960af573e1dfcab00f1674e00fe355dd67","after":"d06be0a07b4e0202d13f4edafeaddc3c3782417c","ref":"refs/heads/master","pushedAt":"2024-04-11T21:24:02.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":"the time complexity (average case) of a jump search in a singly linked list of size n, using step = sqrt(n)","shortMessageHtmlLink":"the time complexity (average case) of a jump search in a singly linke…"}},{"before":"34e39776f251f462e34df4bb7981ff56043bc2e1","after":"60c4cc960af573e1dfcab00f1674e00fe355dd67","ref":"refs/heads/master","pushedAt":"2024-04-11T21:22:12.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":"the time complexity (average case) of a jump search in an array of size n, using step = sqrt(n)","shortMessageHtmlLink":"the time complexity (average case) of a jump search in an array of si…"}},{"before":"d6368ece9e30f8cfe63e03081d00421354d0e23f","after":"34e39776f251f462e34df4bb7981ff56043bc2e1","ref":"refs/heads/master","pushedAt":"2024-04-11T21:19:45.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":" the space complexity of this function / algorithm?","shortMessageHtmlLink":" the space complexity of this function / algorithm?"}},{"before":"468b09961faef92a109af0f68d94c03a3de9fd84","after":"d6368ece9e30f8cfe63e03081d00421354d0e23f","ref":"refs/heads/master","pushedAt":"2024-04-11T21:18:27.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":" the space complexity (worst case) of a binary search in an array of size n","shortMessageHtmlLink":" the space complexity (worst case) of a binary search in an array of …"}},{"before":"e18c334778bac9da01f8f4c458776b0adee5cf5e","after":"468b09961faef92a109af0f68d94c03a3de9fd84","ref":"refs/heads/master","pushedAt":"2024-04-11T21:15:36.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":" the time complexity (worst case) of a binary search in an array of size n","shortMessageHtmlLink":" the time complexity (worst case) of a binary search in an array of s…"}},{"before":"10082423f9bc6b1f9f2e0be1e7118eec52f1fe8a","after":"e18c334778bac9da01f8f4c458776b0adee5cf5e","ref":"refs/heads/master","pushedAt":"2024-04-11T20:00:14.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":"the space complexity (worst case) of an iterative linear search algorithm in an array of size n","shortMessageHtmlLink":"the space complexity (worst case) of an iterative linear search algor…"}},{"before":"7f605b2f59a35149e2cc13bb3d5e978b61c2c986","after":"10082423f9bc6b1f9f2e0be1e7118eec52f1fe8a","ref":"refs/heads/master","pushedAt":"2024-04-11T19:54:19.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":"fixed white trailing space to match the betty coding style","shortMessageHtmlLink":"fixed white trailing space to match the betty coding style"}},{"before":"74cf31ec69b78f73703a55994ab7a55a71f7f10a","after":"7f605b2f59a35149e2cc13bb3d5e978b61c2c986","ref":"refs/heads/master","pushedAt":"2024-04-11T18:31:47.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":"the time complexity (worst case) of a linear search in an array of size n","shortMessageHtmlLink":"the time complexity (worst case) of a linear search in an array of si…"}},{"before":"e8a00d178d39fb83b498450f663e1239071e4a14","after":"74cf31ec69b78f73703a55994ab7a55a71f7f10a","ref":"refs/heads/master","pushedAt":"2024-04-11T17:28:04.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":" a function that searches for a value in a sorted array of integers using the Binary search algorithm","shortMessageHtmlLink":" a function that searches for a value in a sorted array of integers u…"}},{"before":"78d5e9fec9a7dad955f54d3f65b782afb8776778","after":"e8a00d178d39fb83b498450f663e1239071e4a14","ref":"refs/heads/master","pushedAt":"2024-04-11T16:55:34.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":"linear search","shortMessageHtmlLink":"linear search"}},{"before":"fbee6f0ae5f2c9aa08bef5dfc2ad143ad33b2e62","after":"78d5e9fec9a7dad955f54d3f65b782afb8776778","ref":"refs/heads/master","pushedAt":"2024-04-11T12:32:11.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":"Merge branch 'master' of github.com:lawalTheWest/alx-low_level_programming","shortMessageHtmlLink":"Merge branch 'master' of github.com:lawalTheWest/alx-low_level_progra…"}},{"before":"7bcc7ed48a9f4c89c230f08add1f0601264c372e","after":"fbee6f0ae5f2c9aa08bef5dfc2ad143ad33b2e62","ref":"refs/heads/master","pushedAt":"2024-02-26T14:38:29.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":"test file","shortMessageHtmlLink":"test file"}},{"before":"4aa47c375bec1cb11aa71c13c1bb4a0a5d6ac162","after":"7bcc7ed48a9f4c89c230f08add1f0601264c372e","ref":"refs/heads/master","pushedAt":"2024-02-25T12:12:57.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":"cleaning and updating repository","shortMessageHtmlLink":"cleaning and updating repository"}},{"before":"4c53d8d87f4dd43babe89430c9d51382e8d747fb","after":"4aa47c375bec1cb11aa71c13c1bb4a0a5d6ac162","ref":"refs/heads/master","pushedAt":"2024-02-08T01:00:07.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":"a header file to add the prototype for  a function that searches for a value in a sorted array of integers using the Jump search algorithm","shortMessageHtmlLink":"a header file to add the prototype for a function that searches for a…"}},{"before":"cfdb808a1d4868b1b3fa70522c860a84a3bda99f","after":"4c53d8d87f4dd43babe89430c9d51382e8d747fb","ref":"refs/heads/master","pushedAt":"2024-02-08T00:59:23.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":" a function that searches for a value in a sorted array of integers using the Jump search algorithm","shortMessageHtmlLink":" a function that searches for a value in a sorted array of integers u…"}},{"before":"aad5f3e97b3288679a7ab707c7d091692cbfb924","after":"cfdb808a1d4868b1b3fa70522c860a84a3bda99f","ref":"refs/heads/master","pushedAt":"2024-02-08T00:58:55.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":"test file for  a function that searches for a value in a sorted array of integers using the Jump search algorithm","shortMessageHtmlLink":"test file for a function that searches for a value in a sorted array …"}},{"before":"546a07480bb9032ce6611a9da7a25ec50142746f","after":"aad5f3e97b3288679a7ab707c7d091692cbfb924","ref":"refs/heads/master","pushedAt":"2024-02-08T00:29:53.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":"the time complexity (average case) of a jump search in a skip list of size n, with an express lane using step = sqrt(n)","shortMessageHtmlLink":"the time complexity (average case) of a jump search in a skip list of…"}},{"before":"e33dea23f74c8ea879f56897b97eac7effdd1e4d","after":"546a07480bb9032ce6611a9da7a25ec50142746f","ref":"refs/heads/master","pushedAt":"2024-02-08T00:28:12.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":"the time complexity (average case) of a jump search in a singly linked list of size n, using step = sqrt(n)","shortMessageHtmlLink":"the time complexity (average case) of a jump search in a singly linke…"}},{"before":"9a59e98b6880f8510654f8e7e892de077f9b7c4a","after":"e33dea23f74c8ea879f56897b97eac7effdd1e4d","ref":"refs/heads/master","pushedAt":"2024-02-08T00:26:13.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":" the time complexity (average case) of a jump search in an array of size n, using step = sqrt(n)","shortMessageHtmlLink":" the time complexity (average case) of a jump search in an array of s…"}},{"before":"434c0127d1993f04f4f9b809812109e9eadea6f4","after":"9a59e98b6880f8510654f8e7e892de077f9b7c4a","ref":"refs/heads/master","pushedAt":"2024-02-08T00:12:18.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":"the space complexity of this function / algorithm","shortMessageHtmlLink":"the space complexity of this function / algorithm"}},{"before":"ca164577bd33e9576ab46456ac568308372e6fe6","after":"434c0127d1993f04f4f9b809812109e9eadea6f4","ref":"refs/heads/master","pushedAt":"2024-02-08T00:10:48.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":"the space complexity (worst case) of a binary search in an array of size n","shortMessageHtmlLink":"the space complexity (worst case) of a binary search in an array of s…"}},{"before":"5b6ee23c6cce01a6191a8d51037f15acc5983189","after":"ca164577bd33e9576ab46456ac568308372e6fe6","ref":"refs/heads/master","pushedAt":"2024-02-08T00:09:16.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":" the time complexity (worst case) of a binary search in an array of size n","shortMessageHtmlLink":" the time complexity (worst case) of a binary search in an array of s…"}},{"before":"50a565833f799ceb7cce3320deb4cde7809387df","after":"5b6ee23c6cce01a6191a8d51037f15acc5983189","ref":"refs/heads/master","pushedAt":"2024-02-08T00:07:51.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":"the space complexity (worst case) of an iterative linear search algorithm in an array of size n","shortMessageHtmlLink":"the space complexity (worst case) of an iterative linear search algor…"}},{"before":"4ab38a9237616be4a61d3e80b6dacd75a4722906","after":"50a565833f799ceb7cce3320deb4cde7809387df","ref":"refs/heads/master","pushedAt":"2024-02-08T00:06:06.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":" the time complexity (worst case) of a linear search in an array of size n","shortMessageHtmlLink":" the time complexity (worst case) of a linear search in an array of s…"}},{"before":"ff1e4d925f438d976e26b07050eb07da8c5e03c1","after":"4ab38a9237616be4a61d3e80b6dacd75a4722906","ref":"refs/heads/master","pushedAt":"2024-02-08T00:03:54.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":"a function that searches for a value in a sorted array of integers using the Binary search algorithm","shortMessageHtmlLink":"a function that searches for a value in a sorted array of integers us…"}},{"before":"24a1d8f540e88d4fbe4629eaf66a098bef3cf7f1","after":"ff1e4d925f438d976e26b07050eb07da8c5e03c1","ref":"refs/heads/master","pushedAt":"2024-02-08T00:00:19.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":"the header file to include the prototype for a function that searches for a value in a sorted array of integers using the Binary search algorithm","shortMessageHtmlLink":"the header file to include the prototype for a function that searches…"}},{"before":"49f8385f487802f2c3150b98142806fba280b7d6","after":"24a1d8f540e88d4fbe4629eaf66a098bef3cf7f1","ref":"refs/heads/master","pushedAt":"2024-02-07T23:58:48.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"lawalTheWest","name":"Lawal Tajudeen O. (The West)","path":"/lawalTheWest","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/45957199?s=80&v=4"},"commit":{"message":"the test file for a function that searches for a value in a sorted array of integers using the Binary search algorithm","shortMessageHtmlLink":"the test file for a function that searches for a value in a sorted ar…"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEL93ZDAA","startCursor":null,"endCursor":null}},"title":"Activity · lawalTheWest/alx-low_level_programming"}