Loading repository data…
milorads / repository
C# reference implementations of core CS fundamentals: 15 sorting algorithms, 8 searching algorithms, classic data structures (BST, AVL, Red-Black, Skip List, KD-Tree, Hash Tables), and all 23 Gang of Four design patterns — with unit tests.
A transparent discovery signal based on current public GitHub metadata.
This score does not audit code, security, maintainers, documentation quality, or suitability. Verify the repository and its current documentation before adoption.
A reference implementation of core computer science concepts in C# (.NET Framework). Covers sorting, searching, data structures, and all 23 Gang of Four design patterns — each implemented cleanly with working examples and unit tests.
| Algorithm | Complexity (avg) |
|---|---|
| Bubble Sort | O(n²) |
| Selection Sort | O(n²) |
| Insertion Sort | O(n²) |
| Shell Sort | O(n log²n) |
| Quick Sort | O(n log n) |
| Merge Sort | O(n log n) |
| Heap Sort | O(n log n) |
| Tim Sort | O(n log n) |
| Tree Sort | O(n log n) |
| Cube Sort | O(n log n) |
| Bucket Sort | O(n + k) |
| Counting Sort | O(n + k) |
| Radix Sort | O(nk) |
| Bogo Sort | O(∞) |
Linear Search, Binary Search, Jump Search, Exponential Search, Fibonacci Search, Interpolation Search, Depth-First Search, Breadth-First Search
| Structure | Notes |
|---|---|
| Binary Search Tree | Insert, Search, Delete |
| AVL Tree | Self-balancing BST |
| Red-Black Tree | Self-balancing BST |
| Splay Tree | Self-adjusting BST |
| KD-Tree | k-dimensional space partitioning, nearest neighbor |
| Skip List | Probabilistic, O(log n) average ops |
| Stack | Array-backed |
| Queue | Array-backed |
| Single Linked List | |
| Double Linked List |
Linear Probing, Open Addressing (Quadratic), Double Hashing, Separate Chaining, Cuckoo Hashing, Hopscotch Hashing, Robin Hood Hashing, Coalesced Hashing, Two-Choice Hashing, Dynamic Resizing
Selected from shared topics, language and repository description—not editorial ratings.
EduardoFProenca /
Complete collection of algorithms and data structures in C with 39+ Beecrowd solutions, 17 academic assignments, and reference implementations. All code fully commented in Portuguese for learning purposes.
46/100 healthBehavioral (11): Observer, Strategy, Command, Iterator, State, Template Method, Visitor, Chain of Responsibility, Interpreter, Mediator, Memento
Creational (5): Singleton (3 variants), Factory, Abstract Factory, Builder, Prototype
Structural (7): Decorator, Adapter, Bridge, Composite, Facade, Proxy, Flyweight
Topics/
├── Sorting/ # 15 sorting algorithms (ISort interface)
├── Searching/ # 8 searching algorithms
├── Data Structures/ # Trees, lists, hash tables, skip list, KD-tree
└── Design Patterns/ # Behavioral / Creational / Structural
Tests/ # NUnit unit tests
Helpers/ # Shared node types and utilities
cs-algorithms-and-patterns.sln in Visual StudioProgram.cs demonstrates all implemented algorithms in sequence