{"id":18701389,"url":"https://github.com/gopalanand333/algorithms","last_synced_at":"2025-08-24T16:10:10.908Z","repository":{"id":132126985,"uuid":"186994812","full_name":"gopalanand333/algorithms","owner":"gopalanand333","description":"what are algorithms, datastructures and their basics","archived":false,"fork":false,"pushed_at":"2019-06-06T08:53:09.000Z","size":9,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-05-19T03:41:26.070Z","etag":null,"topics":["algorithms","datastructures","python","python3"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"bsd-2-clause","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/gopalanand333.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":"CONTRIBUTING.md","funding":null,"license":"LICENSE","code_of_conduct":"CODE_OF_CONDUCT.md","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":"2019-05-16T09:20:18.000Z","updated_at":"2020-09-30T04:04:37.000Z","dependencies_parsed_at":"2023-07-25T00:30:55.880Z","dependency_job_id":null,"html_url":"https://github.com/gopalanand333/algorithms","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/gopalanand333/algorithms","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gopalanand333%2Falgorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gopalanand333%2Falgorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gopalanand333%2Falgorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gopalanand333%2Falgorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/gopalanand333","download_url":"https://codeload.github.com/gopalanand333/algorithms/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gopalanand333%2Falgorithms/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":271900779,"owners_count":24841114,"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","status":"online","status_checked_at":"2025-08-24T02:00:11.135Z","response_time":111,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["algorithms","datastructures","python","python3"],"created_at":"2024-11-07T11:41:31.064Z","updated_at":"2025-08-24T16:10:10.865Z","avatar_url":"https://github.com/gopalanand333.png","language":"Python","readme":"# Algorithms\nAn algorithm is a step by step method of solving a problem. It is commonly used for data processing, calculation and other related computer and mathematical operations.\nAn algorithm is also used to manipulate data in various ways, such as inserting a new data item, searching for a particular item or sorting an item.\n\n## Algoritm Comlexity\n- Space complexity: How much memory does it require?\n- Time comlexity: How much time does it require to complete?\n### algoritm have a set of input and output values\n\n# Algorithm classification \n- Serial/Parallel\n- Exact/approximate \n- Deterministic/non-deterministic\n\n# Some common alogorithms\n- Search algorithms \n- Sorting algorithms\n- Computational algorithms\n- Collection algorithms\n\n### Example: greatest common denominator )GCD of two integers\neg: GCD of 20 and 8 is 8 and 1\n`\ndef gcd(a,b):\n    while (b !=0):\n        t = b\n        b = t % b\n    return a\nprint(gcd(10,20))\n`\n\n# Algorithm performance\n- Measure how an algorithm responds to dataset size\n# Big-O notation\n- Classifies performance as the input size grows\n- \"O\" indicates the order of operation: Time Scale to perform an operation\n-  Many algo have more than one big O values.\n## Common Big-O Terms\n- O(1) Constant Time (looking up single element in array)\n- O(log n) - Lograthmic (finding an item in a sorted array with binary search)\n- O(n)- Linear time (searching in an unsorted array)\n- O (n log n)- Log-linear (Complex sorting alogs like heap and merge sort)\n- o(n^2)- Quadratic (bubble sort, selection sort)\n\n\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgopalanand333%2Falgorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgopalanand333%2Falgorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgopalanand333%2Falgorithms/lists"}