Skip to content

tslime/FundamentalAlgorithms

Repository files navigation

Fundamental Algorithms

This repository contains modular implementations of fundamental data structures and algorithms in C, C++, Java, and Python. Each implementation is language-specific, optimized for clarity and performance, and benchmark-ready. This project is part of my technical portfolio and is referenced in my CV.

Purpose

To demonstrate a solid understanding of core computer science algorithms, data structures, memory models, and algorithmic complexity — across compiled and interpreted languages — and to compare trade-offs between different programming paradigms.

Languages

  • C: Low-level implementation with manual memory management
  • C++: STL-based and manual implementations with OOP
  • Java: Class-based implementations for clarity and structure
  • Python: Clean syntax for fast prototyping and logic validation

Categories

Category Algorithms & Structures
Sorting Algorithms QuickSort, MergeSort, HeapSort, BubbleSort
Search Algorithms Binary Search, Linear Search
Graph Algorithms Dijkstra's Algorithm, DFS, BFS
Tree Structures Binary Search Tree (BST), AVL Tree (upcoming)
Hash Structures Hash Tables with open addressing (upcoming)
Linked Lists Singly/Doubly Linked Lists, Reverse Linked List
Stacks & Queues Array-based and linked implementations
Miscellaneous String reversal, recursive vs iterative comparisons

New structures and algorithms are added regularly.

Current Directory Structure

FundamentalAlgorithms/
├── BinarySearchTreeAlrogithm/         # Binary Search Tree
├── DijsktraAlgorithm/                 # Dijkstra’s Algorithm
├── HeapSortAlgorithm/                 # Heap Sort
├── ReverselinkedlistAlgorithms/       # Reverse Linked List
├── LICENSE
└── README.md

About

No description, website, or topics provided.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published