Title: Binary search exercise solution could be further optimized · Issue #13 · codebasics/data-structures-algorithms-python · GitHub
Open Graph Title: Binary search exercise solution could be further optimized · Issue #13 · codebasics/data-structures-algorithms-python
X Title: Binary search exercise solution could be further optimized · Issue #13 · codebasics/data-structures-algorithms-python
Description: Instead of linearly searching for all the occurrences we could do that faster by searching them all in a binary way. Here: while i >=0: if numbers[i] == number_to_find: indices.append(i) else: break i = i - 1 And here: while i Open Graph Description: Instead of linearly searching for all the occurrences we could do that faster by searching them all in a binary way. Here: while i >=0: if numbers[i] == number_to_find: indices.append(i) else: brea...
X Description: Instead of linearly searching for all the occurrences we could do that faster by searching them all in a binary way. Here: while i >=0: if numbers[i] == number_to_find: indices.append(i) else: b...
Opengraph URL: https://github.com/codebasics/data-structures-algorithms-python/issues/13
X: @github
Domain: github.com
Links:
Viewport: width=device-width
Hey, it has json ld scripts:
{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"Binary search exercise solution could be further optimized","articleBody":"Instead of linearly searching for all the occurrences we could do that faster by searching them all in a binary way.\r\n\r\nHere:\r\n\r\n```\r\nwhile i >=0:\r\n if numbers[i] == number_to_find:\r\n indices.append(i)\r\n else:\r\n break\r\n i = i - 1\r\n```\r\n\r\nAnd here:\r\n\r\n```\r\nwhile i\u003clen(numbers):\r\n if numbers[i] == number_to_find:\r\n indices.append(i)\r\n else:\r\n break\r\n i = i + 1\r\n```\r\n\r\nI would be happy to make a pull request 😄 \r\n\r\nPS: Your tutorial playlist on DSA is amazing!","author":{"url":"https://github.com/Kimonili","@type":"Person","name":"Kimonili"},"datePublished":"2021-01-15T13:25:35Z","url":"https://github.com/codebasics/data-structures-algorithms-python/issues/13"}
react-profiling 0 react-import-map react,react-dom,react-dom/client,react-dom/profiling,react-is,react/compiler-runtime,react/jsx-dev-runtime,react/jsx-runtime,scheduler@b8488ee2c322 route-pattern /_view_fragments/issues/show/:user_id/:repository/:id/issue_layout(.:format) route-controller voltron_issues_fragments route-action issue_layout fetch-nonce v2:5ddf18d8-f25c-3463-e3fc-6f2b26b5c413 current-catalog-service-hash 81bb79d38c15960b92d99bca9288a9108c7a47b18f2423d0f6438c5b7bcd2114 request-id B478:8AE25:1162874:170FA4B:6B01E677 html-safe-nonce 4c1f3fcc9d871069e065edcb7c67a66a962c35a04b831d1a9d0a7d30545b396a visitor-payload eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJCNDc4OjhBRTI1OjExNjI4NzQ6MTcwRkE0Qjo2QjAxRTY3NyIsInZpc2l0b3JfaWQiOiI1ODY2MTk5NTk0NjIyMzc5NjM5IiwicmVnaW9uX2VkZ2UiOiJpYWQiLCJyZWdpb25fcmVuZGVyIjoiaWFkIn0= visitor-hmac d717d824c10e8f07b200d0ed92719ef130ff982cce410d327e07a4380c3ca7f0 hovercard-subject-tag issue:786894174 github-keyboard-shortcuts repository,issues,copilot google-site-verification Apib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I octolytics-url https://collector.github.com/github/collect analytics-location / fb:app_id 1401488693436528 apple-itunes-app app-id=1477376905, app-argument=https://github.com/_view_fragments/issues/show/codebasics/data-structures-algorithms-python/13/issue_layout twitter:image https://opengraph.githubassets.com/4a9877d74c1c9cc66db84c0fd2af818e80c90cfe2f097fce1207da346d1d65bf/codebasics/data-structures-algorithms-python/issues/13 twitter:card summary_large_image og:image https://opengraph.githubassets.com/4a9877d74c1c9cc66db84c0fd2af818e80c90cfe2f097fce1207da346d1d65bf/codebasics/data-structures-algorithms-python/issues/13 og:image:alt Instead of linearly searching for all the occurrences we could do that faster by searching them all in a binary way. Here: while i >=0: if numbers[i] == number_to_find: indices.append(i) else: brea... og:image:width 1200 og:image:height 600 og:site_name GitHub og:type object og:author:username Kimonili hostname github.com expected-hostname github.com None cc5dfdd32f62ebd3223cab3af3aa2b268d3605218237326a48a99d1efd89495c turbo-cache-control no-preview go-import github.com/codebasics/data-structures-algorithms-python git https://github.com/codebasics/data-structures-algorithms-python.git octolytics-dimension-user_id 16063416 octolytics-dimension-user_login codebasics octolytics-dimension-repository_id 299539326 octolytics-dimension-repository_nwo codebasics/data-structures-algorithms-python octolytics-dimension-repository_public true octolytics-dimension-repository_is_fork false octolytics-dimension-repository_network_root_id 299539326 octolytics-dimension-repository_network_root_nwo codebasics/data-structures-algorithms-python turbo-body-classes logged-out env-production page-responsive disable-turbo false browser-stats-url https://api.github.com/_private/browser/stats browser-errors-url https://api.github.com/_private/browser/errors release 8c77c9e8439031ad54c75a250694842892f693e1 ui-target full theme-color #1e2327 color-scheme light dark react-app-name issues
URLs of crawlers that visited me.