https://github.com/andreie91/fundamental-algorithms
This repository contains various fundamental algorithms implemented in C and C++, focusing on performance analysis.
https://github.com/andreie91/fundamental-algorithms
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
Last synced: 1 day ago
JSON representation
This repository contains various fundamental algorithms implemented in C and C++, focusing on performance analysis.
- Host: GitHub
- URL: https://github.com/andreie91/fundamental-algorithms
- Owner: AndreiE91
- Created: 2023-06-03T16:43:37.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2024-02-05T20:57:45.000Z (almost 2 years ago)
- Last Synced: 2025-03-03T18:44:33.640Z (9 months ago)
- 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
- Language: C++
- Homepage:
- Size: 1.06 MB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Fundamental Algorithms
This 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.
## Topics Covered
### Basic File I/O
Handles basic file input/output operations.
### Basic Sort Comparison
*Average Case of Basic Sort*
*Best Case of Basic Sort*
*Worst Case of Basic Sort*
Compares basic sorting algorithms.
### Breadth-First Search (BFS)
*Performance Analysis of BFS*
Implements the Breadth-First Search algorithm.
### Depth-First Search (DFS)
*Performance Analysis of DFS*
Implements the Depth-First Search algorithm.
### Fstream I/O
Demonstrates file input/output operations using `fstream`.
### Hash Tables
*Hash Tables in Action*
Implements hash tables for efficient data retrieval.
### Heaps and Heapsort
*Average Case of Heapsort*
*Best Case of Heapsort*
*Worst Case of Heapsort*
Implements heaps and the Heapsort algorithm.
### Kruskal's Minimum Spanning Tree (MST)
*Performance Report of Kruskal's MST*
Finds the Minimum Spanning Tree using Kruskal's algorithm.
### Merge k Sorted Lists
*Merging k Sorted Lists*
Merges k sorted lists efficiently.
### Merge Sort
Implements the Merge Sort algorithm.
### Merge Sort Test
Tests the Merge Sort implementation.
### Profiler Test
Tests the performance of various algorithms.
### Quicksort
*Average Case of Quicksort*
*Best Case of Quicksort*
*Worst Case of Quicksort*
Implements the Quicksort algorithm.
### Red-Black Trees
*Red-Black Trees*
Implements Red-Black Trees for balanced binary search trees.
### Tetris
*Console Tetris Game*
A Tetris game implementation.
### Tree Data Structures
*Various Tree Data Structures*
Implements various tree data structures.
### Tree Traversals and Hybrid Quick Sort
*Threshold Report for Hybrid Quick Sort*
Performs tree traversals and implements a hybrid Quick Sort algorithm.