{"id":20258875,"url":"https://github.com/andreie91/fundamental-algorithms","last_synced_at":"2026-06-05T08:31:57.424Z","repository":{"id":177727200,"uuid":"649061208","full_name":"AndreiE91/Fundamental-Algorithms","owner":"AndreiE91","description":"This repository contains various fundamental algorithms implemented in C and C++, focusing on performance analysis.","archived":false,"fork":false,"pushed_at":"2024-02-05T20:57:45.000Z","size":1116,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-12-01T07:00:21.845Z","etag":null,"topics":["algorithms-and-data-structures","breadth-first-search","depth-first-search","graph-algorithms","hashtables","heaps","heapsort","hybrid-quicksort","mergeklists","mergesort","profiler","quicksort","redblack-tree","sorting-algorithms","tetris"],"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/AndreiE91.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":"2023-06-03T16:43:37.000Z","updated_at":"2024-12-24T18:52:46.000Z","dependencies_parsed_at":null,"dependency_job_id":"52b6cffb-5b78-4e1d-aa01-c4857d35cb35","html_url":"https://github.com/AndreiE91/Fundamental-Algorithms","commit_stats":null,"previous_names":["andreie91/fa_labs","andreie91/fundamental-algorithms"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/AndreiE91/Fundamental-Algorithms","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AndreiE91%2FFundamental-Algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AndreiE91%2FFundamental-Algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AndreiE91%2FFundamental-Algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AndreiE91%2FFundamental-Algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/AndreiE91","download_url":"https://codeload.github.com/AndreiE91/Fundamental-Algorithms/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AndreiE91%2FFundamental-Algorithms/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33937661,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-05T02:00:06.157Z","response_time":120,"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-and-data-structures","breadth-first-search","depth-first-search","graph-algorithms","hashtables","heaps","heapsort","hybrid-quicksort","mergeklists","mergesort","profiler","quicksort","redblack-tree","sorting-algorithms","tetris"],"created_at":"2024-11-14T11:12:05.631Z","updated_at":"2026-06-05T08:31:57.393Z","avatar_url":"https://github.com/AndreiE91.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Fundamental Algorithms\n\nThis repository contains various fundamental algorithms implemented in C and C++, focusing on performance analysis. Each algorithm is accompanied by a brief description and example usage.\n\n## Topics Covered\n\n### Basic File I/O\n\nHandles basic file input/output operations.\n\n### Basic Sort Comparison\n\n![Basic Sort Average](images/BasicSort_Average.jpg)\n*Average Case of Basic Sort*\n\n![Basic Sort Best](images/BasicSort_Best.jpg)\n*Best Case of Basic Sort*\n\n![Basic Sort Worst](images/BasicSort_Worst.jpg)\n*Worst Case of Basic Sort*\n\nCompares basic sorting algorithms.\n\n### Breadth-First Search (BFS)\n\n![BFS Performance](images/BFS_Performance.jpg)\n*Performance Analysis of BFS*\n\nImplements the Breadth-First Search algorithm.\n\n### Depth-First Search (DFS)\n\n![DFS Performance](images/DFS_Performance.jpg)\n*Performance Analysis of DFS*\n\nImplements the Depth-First Search algorithm.\n\n### Fstream I/O\n\nDemonstrates file input/output operations using `fstream`.\n\n### Hash Tables\n\n![Hash Tables](images/Hashtables.jpg)\n*Hash Tables in Action*\n\nImplements hash tables for efficient data retrieval.\n\n### Heaps and Heapsort\n\n![Heapsort Average](images/Heapsort_Average.jpg)\n*Average Case of Heapsort*\n\n![Heapsort Best](images/Heapsort_Best.jpg)\n*Best Case of Heapsort*\n\n![Heapsort Worst](images/Heapsort_Worst.jpg)\n*Worst Case of Heapsort*\n\nImplements heaps and the Heapsort algorithm.\n\n### Kruskal's Minimum Spanning Tree (MST)\n\n![Kruskal's MST Performance](images/KruskalMST_PerformanceReport.jpg)\n*Performance Report of Kruskal's MST*\n\nFinds the Minimum Spanning Tree using Kruskal's algorithm.\n\n### Merge k Sorted Lists\n\n![Merge k Lists](images/MergeKLists.jpg)\n*Merging k Sorted Lists*\n\nMerges k sorted lists efficiently.\n\n### Merge Sort\n\nImplements the Merge Sort algorithm.\n\n### Merge Sort Test\n\nTests the Merge Sort implementation.\n\n### Profiler Test\n\nTests the performance of various algorithms.\n\n### Quicksort\n\n![Quicksort Average](images/QuickSort_Average.jpg)\n*Average Case of Quicksort*\n\n![Quicksort Best](images/QuickSort_Best.jpg)\n*Best Case of Quicksort*\n\n![Quicksort Worst](images/QuickSort_Worst.jpg)\n*Worst Case of Quicksort*\n\nImplements the Quicksort algorithm.\n\n### Red-Black Trees\n\n![Red-Black Trees](images/RedBlackTree.jpg)\n*Red-Black Trees*\n\nImplements Red-Black Trees for balanced binary search trees.\n\n### Tetris\n\n![Console Tetris](images/ConsoleTetris.jpg)\n*Console Tetris Game*\n\nA Tetris game implementation.\n\n### Tree Data Structures\n\n![Tree Data Structures](images/Tree_DataStructures.jpg)\n*Various Tree Data Structures*\n\nImplements various tree data structures.\n\n### Tree Traversals and Hybrid Quick Sort\n\n![Hybrid Quick Sort Threshold Report](images/HybridQuickSort_ThresholdReport.jpg)\n*Threshold Report for Hybrid Quick Sort*\n\nPerforms tree traversals and implements a hybrid Quick Sort algorithm.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fandreie91%2Ffundamental-algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fandreie91%2Ffundamental-algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fandreie91%2Ffundamental-algorithms/lists"}