{"id":20502080,"url":"https://github.com/josegpt/fundamentals","last_synced_at":"2025-06-29T21:06:30.032Z","repository":{"id":54506468,"uuid":"251305678","full_name":"josegpt/fundamentals","owner":"josegpt","description":"Fundamental Data Structures and Algorithms.","archived":false,"fork":false,"pushed_at":"2021-02-15T02:15:23.000Z","size":249,"stargazers_count":0,"open_issues_count":22,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-05T19:59:30.652Z","etag":null,"topics":["algorithms","c","data-structures","dynamic-programming","makefile","sort","trees"],"latest_commit_sha":null,"homepage":"","language":"C","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/josegpt.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}},"created_at":"2020-03-30T13:00:12.000Z","updated_at":"2024-03-31T16:25:37.000Z","dependencies_parsed_at":"2022-08-13T18:10:14.445Z","dependency_job_id":null,"html_url":"https://github.com/josegpt/fundamentals","commit_stats":null,"previous_names":["josegpt/fundamentals"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/josegpt/fundamentals","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/josegpt%2Ffundamentals","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/josegpt%2Ffundamentals/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/josegpt%2Ffundamentals/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/josegpt%2Ffundamentals/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/josegpt","download_url":"https://codeload.github.com/josegpt/fundamentals/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/josegpt%2Ffundamentals/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":262667302,"owners_count":23345532,"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","c","data-structures","dynamic-programming","makefile","sort","trees"],"created_at":"2024-11-15T19:19:35.973Z","updated_at":"2025-06-29T21:06:29.807Z","avatar_url":"https://github.com/josegpt.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Data Structures and Algorithms\n\nThese are the Fundamental Data Structures and Algorithms for a Software Engineer.\n\n![cs meme](assets/meme.png)\n\n# Implementations\n\n## Sorting\n\n- [x] [Bubble Sort **O(n^2)**](lib/sorting/bubble_sort.c)\n- [x] [Selection Sort **O(n^2)**](lib/sorting/selection_sort.c)\n- [x] [Insertion Sort **O(n^2)**](lib/sorting/insertion_sort.c)\n- [ ] Quick Sort **O(nlogn)**\n- [ ] Merge Sort **O(nlogn)**\n- [x] [Heap Sort **O(nlogn)**](lib/heaps/max_heap.c)\n- [ ] Counting Sort **O(n + k)** _where k is a finite number_\n- [ ] Radix Sort **O(n \\* d)** _where d is the number of digits in the maximum number_\n- [ ] Bucket Sort **O(n)**\n\n## Data Structures\n\n- [x] [Stack](lib/stack/stack.c)\n- [x] [Queue](lib/queue/queue.c)\n- [x] [Priority Queue](lib/pqueue/pqueue.c)\n\n## Trees\n\n- [ ] AVL Trees\n- [x] [Trie](lib/trie/trie.c)\n- [ ] Binary Search Trees\n\n## Graphs\n\n- [ ] Breadth-First Search\n- [ ] Depth-First Search\n- [ ] Topological Sort\n- [ ] mDFS\n- [ ] Kahn's Algorithm\n- [ ] Recurisve Backtracking\n\n## Greedy Algorithms\n\n- [ ] Making Change\n- [ ] Minimum Spanning Trees\n- [ ] Prim's Algorithm\n- [ ] Kruskal's Algorithm\n- [ ] Huffman Coding\n- [ ] Dijkstra's\n- [ ] A\\*\n\n## Dynamic Programming\n\n- [ ] Fibonacci\n- [ ] Making Change\n- [ ] Knapsack\n\n# License\n\n[MIT](LICENSE)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjosegpt%2Ffundamentals","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjosegpt%2Ffundamentals","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjosegpt%2Ffundamentals/lists"}