{"id":20753569,"url":"https://github.com/ali-elshorpagi/algorithms","last_synced_at":"2025-09-27T21:32:10.106Z","repository":{"id":221086831,"uuid":"544420136","full_name":"Ali-Elshorpagi/algorithms","owner":"Ali-Elshorpagi","description":"Algorithms implemented in C++","archived":false,"fork":false,"pushed_at":"2024-02-06T02:54:27.000Z","size":1144,"stargazers_count":7,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-11-17T09:13:59.543Z","etag":null,"topics":["algorithms","backtracking-algorithm","bfs-algorithm","binary-search","competitive-programming","cpp","dfs-algorithm","dijkstra-algorithm","divide-and-conquer","dynamic-programming","floyd-warshall-algorithm","graph","graph-representation","kruskal-algorithm","prim-algorithm","problem-solving","recursion","shortest-path-algorithm","sorting-algorithms","topological-sort"],"latest_commit_sha":null,"homepage":"","language":"C++","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/Ali-Elshorpagi.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}},"created_at":"2022-10-02T12:38:51.000Z","updated_at":"2024-07-14T11:44:19.000Z","dependencies_parsed_at":"2024-02-06T05:20:48.918Z","dependency_job_id":"04676d85-910f-426b-b272-93acbafa187f","html_url":"https://github.com/Ali-Elshorpagi/algorithms","commit_stats":null,"previous_names":["ali-elshorpagi/algorithms"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ali-Elshorpagi%2Falgorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ali-Elshorpagi%2Falgorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ali-Elshorpagi%2Falgorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ali-Elshorpagi%2Falgorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Ali-Elshorpagi","download_url":"https://codeload.github.com/Ali-Elshorpagi/algorithms/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":234460595,"owners_count":18836842,"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","backtracking-algorithm","bfs-algorithm","binary-search","competitive-programming","cpp","dfs-algorithm","dijkstra-algorithm","divide-and-conquer","dynamic-programming","floyd-warshall-algorithm","graph","graph-representation","kruskal-algorithm","prim-algorithm","problem-solving","recursion","shortest-path-algorithm","sorting-algorithms","topological-sort"],"created_at":"2024-11-17T09:14:11.729Z","updated_at":"2025-09-27T21:32:04.804Z","avatar_url":"https://github.com/Ali-Elshorpagi.png","language":"C++","readme":"# Algorithms in C++\n\n* You can also see :\n   - [Math Algorithms](https://github.com/Ali-Elshorpagi/math_algorithms)\n   - [Data Structures](https://github.com/Ali-Elshorpagi/Data_Structures)\n\n\u003e **[Recursive Functions](https://github.com/Ali-Elshorpagi/algorithms/tree/main/recursive_functions)**\n   - [All Fibonacci Methods](https://github.com/Ali-Elshorpagi/algorithms/blob/main/recursive_functions/fibonacci.cpp) \n   - Some small problems to practice on recursion\n\n\u003e **[Sorting Algorithms](https://github.com/Ali-Elshorpagi/algorithms/tree/main/sorting_algorithms)**\n   - Bubble Sort ( Iterative / Recursive )\n   - Bucket Sort\n   - Count Sort\n   - Heap Sort\n   - Insertion Sort ( Iterative / Recursive )\n   - Quick Sort (Random Optimization)\n   - Merge Sort\n   - Radix Sort\n   - Selection Sort ( Iterative / Recursive )\n   \n\u003e **[Binary Search](https://github.com/Ali-Elshorpagi/algorithms/tree/main/binary_search)**\n   - Iterative / Recursive\n   - Integer Numbers\n   - Real Numbers\n\n\u003e **[Graph Representation](https://github.com/Ali-Elshorpagi/algorithms/tree/main/graph_representation)**\n   - Edge List\n   - Adjacency Hashset\n   - Adjacency Matrix With Multiple Edges\n\n\u003e **[Depth First Search (DFS)](https://github.com/Ali-Elshorpagi/algorithms/tree/main/DFS)**\n   - DFS Concept\n   - DFS on Matrix\n   - Reductions on Graphs\n   - Detect Cycles in Directed Graph\n\n\u003e **[Breadth First Search (BFS)](https://github.com/Ali-Elshorpagi/algorithms/tree/main/BFS)**\n   - BFS Concept\n   - BFS on Matrix\n   - Detect Cycles in Undirected Graph\n   - Operation-Based Problems\n   - Multi-Source BFS (1 - M BFS)\n   - State Graph Problems\n\n\u003e **[Topological Ordering](https://github.com/Ali-Elshorpagi/algorithms/tree/main/topological_ordering)**\n   - By Kahn's Algorithm\n   - By DFS Algorithm \n\n\u003e **[Dynamic Programming (DP)](https://github.com/Ali-Elshorpagi/algorithms/tree/main/DP)**\n   - Pick or Leave Pattern\n   - Enumerate Choices\n   - Range Patterns\n   - DP Counting\n   - DP On Grid\n   - DP Build Output\n   \u003c!-- - DP Tabulation --\u003e\n\n\u003e **[Backtracking](https://github.com/Ali-Elshorpagi/algorithms/tree/main/backtracking)**\n   - Update And Undo\n\n\u003e **[Divde and Conquer](https://github.com/Ali-Elshorpagi/algorithms/tree/main/divide_and_conquer)**\n   - Merge Sort\n   - Quick Sort\n\u003cbr\u003e\n\n\u003e **[Shortest Path Algorithms](https://github.com/Ali-Elshorpagi/algorithms/tree/main/shortest_path)**\n   - Floyd Warshall\n   - Bellman Ford\n   - Dijkstra\n\n\u003cbr\u003e\n\n\u003e **[Minimum Spanning Tree (MST)](https://github.com/Ali-Elshorpagi/algorithms/tree/main/MST)**\n   - MST Prim\n   - MST Kruskal\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fali-elshorpagi%2Falgorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fali-elshorpagi%2Falgorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fali-elshorpagi%2Falgorithms/lists"}