Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/gzixnine/data_structure_c
This section of the repository serves as a comprehensive exploration of a wide range of data structures and algorithms. From the foundational arrays to the complexities of graphs and trees, with a commitment to clarity, depth, and practicality, this repository is designed to be your go-to resource for mastering data structures and algorithms.
https://github.com/gzixnine/data_structure_c
array breadth-first-search bubble-sort count-sort data-structures graph hashtable heap heap-sort insertion-sort linked-list map merge-sort queue quick-sort radix-sort selection-sort set stack tree
Last synced: about 1 month ago
JSON representation
This section of the repository serves as a comprehensive exploration of a wide range of data structures and algorithms. From the foundational arrays to the complexities of graphs and trees, with a commitment to clarity, depth, and practicality, this repository is designed to be your go-to resource for mastering data structures and algorithms.
- Host: GitHub
- URL: https://github.com/gzixnine/data_structure_c
- Owner: GziXnine
- License: other
- Created: 2024-03-22T01:47:41.000Z (9 months ago)
- Default Branch: main
- Last Pushed: 2024-06-05T00:52:46.000Z (7 months ago)
- Last Synced: 2024-08-29T23:34:19.669Z (4 months ago)
- Topics: array, breadth-first-search, bubble-sort, count-sort, data-structures, graph, hashtable, heap, heap-sort, insertion-sort, linked-list, map, merge-sort, queue, quick-sort, radix-sort, selection-sort, set, stack, tree
- Language: C
- Homepage:
- Size: 57.3 MB
- Stars: 2
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Data Structures and Algorithms
Welcome to the Data Structures and Algorithms repository! This repository serves as a comprehensive guide to various data structures and algorithms commonly used in computer science and programming.
![Data Structures and Algorithms](https://github.com/AllamF5J/Data_Structure_C/blob/main/Chess.jpg)
# Data Structures and Algorithms
## Data Structures
| **Category** | **Data Structure** | **Link** |
|--------------|--------------------|----------|
| Arrays | Dynamic 1D Array (Vector) | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Array/Dynamic%201D_Array%20(vector)) |
| | Jagged Array | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Array/Jagged%20Array) |
| Graph | Adjacency Matrix | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Graph/Adjacency%20Matrix) |
| | Undirected Graph | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Graph/Undirected%20Graph) |
| Hash Table | Direct Addressing Table | |
| | Open Addressing | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Hash%20Table/Open%20Addressing) |
| Heap | Binary Heap | |
| | Max Heap | |
| | Min Heap | |
| | Binomial Heap | |
| Linked List | Array Based Linked List | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Linked%20List/Array%20Based%20Linked%20List) |
| | Circular Linked List | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Linked%20List/Circular%20Linked%20List) |
| | Doubly Linked List | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Linked%20List/Doubly%20Linked%20List) |
| | Singly Linked List | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Linked%20List/Singly%20Linked%20List) |
| | Sorted Linked List | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Linked%20List/Sorted%20Linked%20List) |
| Map | Hash Map | |
| | Linked Hash Map | |
| Matrix | Dynamic 2D Array | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Matrix) |
| Queue | Array Based Queue | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Queue/Array-based%20Queue) |
| | Circular Queues | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Queue/Circular%20Queue) |
| | Linked List Based Queue | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Queue/Linked%20List%20Based%20Queue) |
| | Two Stacks Based Queue | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Queue/Two%20Stacks%20Based%20Queue) |
| Set | Hash Set | |
| | Array Based Set | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Set/Array%20Based%20Set) |
| | Sorted Array Set | |
| | Linked List Set | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Set/Linked%20List%20Based%20Set) |
| | Tree Set | |
| Stack | Array Based Stack | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Stack/Array%20Based%20Stack) |
| | Dynamic Stack | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Stack/Dynamic%20Stack) |
| | Linked List-based Stack | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Stack/Linked%20List%20Based%20Stack) |
| Tree | Binary Search Tree | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Tree/Binary%20Search%20Tree) |
| | Binary Tree | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Tree/Binary%20Tree) |## Algorithms
| **Category** | **Algorithm** | **Link** |
|--------------|---------------|----------|
| **Search Algorithms** | | |
| Binary Search | Exponential Search | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Searching%20Algorithm/Binary%20search/ExponentialSearch.c) |
| | Interpolation Search | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Searching%20Algorithm/Binary%20search/InterpolationSearch.c) |
| | Lower Bound Search | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Searching%20Algorithm/Binary%20search/LowerBoundSearch.c) |
| | Upper Bound Search | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Searching%20Algorithm/Binary%20search/UpperBoundSearch.c) |
| | Recursive Search | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Searching%20Algorithm/Binary%20search/RecursiveSearch.c) |
| | Rotated Search | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Searching%20Algorithm/Binary%20search/RotatedSearch.c) |
| | Traditional Search | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Searching%20Algorithm/Binary%20search/TraditionalSearch.c) |
| Graph Search | Breadth-First Search | |
| | Depth-First Search | |
| Linear Search| Basic Linear Search | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Searching%20Algorithm/Linear%20search/BasicLinearSearch.c) |
| | Optimized Search | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Searching%20Algorithm/Linear%20search/OptimiziedSearch.c) |
| | Recursive Search | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Searching%20Algorithm/Linear%20search/RecursiveSearch.c) |
| | Sequential Search | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Searching%20Algorithm/Linear%20search/SequentialSearch.c) |
| **Sorting Algorithms** | | |
| | Bubble Sort | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Sorting%20Algorithm/BubbleSort.c) |
| | Count Sort | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Sorting%20Algorithm/CountSort.c) |
| | Heap Sort | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Sorting%20Algorithm/HeapSort.c) |
| | Insertion Sort | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Sorting%20Algorithm/InsertionSort.c) |
| | Merge Sort | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Sorting%20Algorithm/MergeSort.c) |
| | Quick Sort | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Sorting%20Algorithm/QuickSort.c) |
| | Radix Sort | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Sorting%20Algorithm/RadixSort.c) |
| | Selection Sort | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Sorting%20Algorithm/SelectionSort.c) |## Getting Started
Each data structure and algorithm has its own folder with implementation details and example code. Feel free to explore and use them in your projects.
I want to clarify that I haven't finished updating all the items in the repository yet, and I will upload them soon, God willing.## Contribution
Contributions are welcome! If you have suggestions, improvements, or new algorithms to add, please open an issue or submit a pull request.## Contact
You can reach me via [Gmail](mailto:[email protected]) or on [Telegram](http://t.me/GziXnine).## License
This project is licensed under the [MIT License](LICENSE).