{"id":24771161,"url":"https://github.com/hillaryjude/learn-python-from-scratch-part-5-searching-sorting","last_synced_at":"2025-03-23T20:27:06.101Z","repository":{"id":270542254,"uuid":"910703125","full_name":"hillaryjude/Learn-python-from-scratch-Part-5-Searching-sorting","owner":"hillaryjude","description":"Python code on Searching and sorting for beginners and intermediate learners. Feel free to explore other resources too.","archived":false,"fork":false,"pushed_at":"2025-01-01T06:13:00.000Z","size":319,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-29T03:58:11.644Z","etag":null,"topics":["binary-search","bubble-sort","insertion-sort","linear-search","merge-sort","recursive-search","selection-sort"],"latest_commit_sha":null,"homepage":"","language":"Jupyter Notebook","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/hillaryjude.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2025-01-01T06:00:54.000Z","updated_at":"2025-01-03T10:03:26.000Z","dependencies_parsed_at":"2025-01-01T07:27:08.341Z","dependency_job_id":null,"html_url":"https://github.com/hillaryjude/Learn-python-from-scratch-Part-5-Searching-sorting","commit_stats":null,"previous_names":["hillaryjude/learn-python-from-scratch-searching-sorting","hillaryjude/learn-python-from-scratch-part-5-searching-sorting"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hillaryjude%2FLearn-python-from-scratch-Part-5-Searching-sorting","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hillaryjude%2FLearn-python-from-scratch-Part-5-Searching-sorting/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hillaryjude%2FLearn-python-from-scratch-Part-5-Searching-sorting/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hillaryjude%2FLearn-python-from-scratch-Part-5-Searching-sorting/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/hillaryjude","download_url":"https://codeload.github.com/hillaryjude/Learn-python-from-scratch-Part-5-Searching-sorting/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245164063,"owners_count":20571050,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["binary-search","bubble-sort","insertion-sort","linear-search","merge-sort","recursive-search","selection-sort"],"created_at":"2025-01-29T03:58:44.109Z","updated_at":"2025-03-23T20:27:06.051Z","avatar_url":"https://github.com/hillaryjude.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Searching Algorithms\n\n## Table of Contents\n1. [Linear Search](#linear-search): A simple search algorithm that checks every element in a list until the desired element is found or the list ends.\n2. [Binary Search](#binary-search): A more efficient search algorithm that works on sorted lists by repeatedly dividing the search interval in half.\n3. [Recursive Binary Search](#recursive-binary-search): A variant of binary search that uses recursion to divide the search interval.\n4. [Square Root of a Number](#square-root-of-a-number): This algorithm calculates the square root of a number using a method such as the Newton-Raphson method.\n\n# Sorting Algorithms\n\nThis repository contains implementations of various sorting algorithms.\n\n## Table of Contents\n\n- [Insertion Sort](#insertion-sort)\n- [Bubble Sort](#bubble-sort)\n  - [Optimized Bubble Sort](#optimized-bubble-sort)\n- [Selection Sort](#selection-sort)\n- [Merge Sort](#merge-sort)\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhillaryjude%2Flearn-python-from-scratch-part-5-searching-sorting","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhillaryjude%2Flearn-python-from-scratch-part-5-searching-sorting","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhillaryjude%2Flearn-python-from-scratch-part-5-searching-sorting/lists"}