{"id":15937295,"url":"https://github.com/andersy005/algorithms","last_synced_at":"2025-09-13T00:32:38.926Z","repository":{"id":96024152,"uuid":"71739801","full_name":"andersy005/algorithms","owner":"andersy005","description":"Data Structures and Algorithms implementations","archived":false,"fork":false,"pushed_at":"2020-03-20T06:26:42.000Z","size":1,"stargazers_count":4,"open_issues_count":0,"forks_count":1,"subscribers_count":4,"default_branch":"master","last_synced_at":"2024-12-30T13:36:48.402Z","etag":null,"topics":["algorithms","data-structures","python"],"latest_commit_sha":null,"homepage":"","language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/andersy005.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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":"2016-10-24T01:02:57.000Z","updated_at":"2020-03-20T06:26:44.000Z","dependencies_parsed_at":"2023-04-08T19:47:05.891Z","dependency_job_id":null,"html_url":"https://github.com/andersy005/algorithms","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/andersy005%2Falgorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/andersy005%2Falgorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/andersy005%2Falgorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/andersy005%2Falgorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/andersy005","download_url":"https://codeload.github.com/andersy005/algorithms/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":232802575,"owners_count":18578685,"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":["algorithms","data-structures","python"],"created_at":"2024-10-07T05:02:08.089Z","updated_at":"2025-01-07T00:16:36.780Z","avatar_url":"https://github.com/andersy005.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# Algorithms\n\nData Structure and Algorithms implementations in Python\n\n**Note**\nThis repository is meant to be used as a reference to learn data structures and algorithms in Python programming language.\n\n**Documentation**\nTODO\n\n## Data structure\n\n## TO DO\n\n- Sorting Algorithms\n  _ [Bubble Sort](https://en.wikipedia.org/wiki/Bubble_sort)\n  _ [Selection Sort](https://en.wikipedia.org/wiki/Selection_sort)\n  _ [Insertion Sort](https://en.wikipedia.org/wiki/Insertion_sort)\n  _ [Merge Sort](https://en.wikipedia.org/wiki/Merge_sort)\n  _ [Quick Sort](https://en.wikipedia.org/wiki/Quicksort)\n  _ [Quick Select](https://en.wikipedia.org/wiki/Quickselect)\n  _ [Shell Sort](https://en.wikipedia.org/wiki/Shellsort)\n  _ [Heap Sort](https://en.wikipedia.org/wiki/Heapsort)\n- [Stack (Array Implementation)](\u003chttps://en.wikipedia.org/wiki/Stack_(abstract_data_type)\u003e)\n  _ Infix to Postfix\n  _ Infix to Prefix \\* Infix Evaluation\n- [Queue (Array Implementation)](\u003chttps://en.wikipedia.org/wiki/Queue_(abstract_data_type)\u003e)\n- LinkedList\n  _ [Singly Linked List](https://en.wikipedia.org/wiki/Linked_list)\n  _ [Doubly Linked List](https://en.wikipedia.org/wiki/Doubly_linked_list)\n- [Shuffle (Using Fisher-Yates (Knuth) shuffling algorithm)](https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle)\n- [Binary Search Tree](https://en.wikipedia.org/wiki/Binary_search_tree)\n- [Binary Heap](https://en.wikipedia.org/wiki/Binary_heap)\n  - Min Heap\n  - Max Heap\n- [Red Black Tree](https://en.wikipedia.org/wiki/Red%E2%80%93black_tree)\n- Search\n\n  - [Binary Search](https://en.wikipedia.org/wiki/Binary_search_algorithm)\n\n- Vertical Order Traversal of Tree\n- Order Statistics of Tree\n- Red Black Tree Deletion\n- B-Tree\n- Deque using circular array\n- Tree Varient\n- Graph Varient\n- [cocktail sort](https://en.wikipedia.org/wiki/Cocktail_shaker_sort)\n- [gnome sort](https://en.wikipedia.org/wiki/Gnome_sort)\n- [comb sort](https://en.wikipedia.org/wiki/Comb_sort)\n- [odd-even sort](https://en.wikipedia.org/wiki/Odd%E2%80%93even_sort)\n- [counting sort](https://en.wikipedia.org/wiki/Counting_sort)\n\n## Contribution\n\nFeel Free to contribute!\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fandersy005%2Falgorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fandersy005%2Falgorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fandersy005%2Falgorithms/lists"}