{"id":20909635,"url":"https://github.com/gzixnine/data_structure_c","last_synced_at":"2026-02-06T15:08:03.610Z","repository":{"id":229097914,"uuid":"775761061","full_name":"GziXnine/Data_Structure_C","owner":"GziXnine","description":"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.","archived":false,"fork":false,"pushed_at":"2024-06-05T00:52:46.000Z","size":60073,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-02T04:23:56.680Z","etag":null,"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"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"other","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/GziXnine.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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,"publiccode":null,"codemeta":null}},"created_at":"2024-03-22T01:47:41.000Z","updated_at":"2024-06-05T00:52:49.000Z","dependencies_parsed_at":"2024-03-22T02:46:35.507Z","dependency_job_id":"e76fc798-f5b5-4519-956b-99ad566141b3","html_url":"https://github.com/GziXnine/Data_Structure_C","commit_stats":null,"previous_names":["allamf5j/data_structure_c","gzixnine/data_structure_c"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/GziXnine/Data_Structure_C","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GziXnine%2FData_Structure_C","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GziXnine%2FData_Structure_C/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GziXnine%2FData_Structure_C/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GziXnine%2FData_Structure_C/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/GziXnine","download_url":"https://codeload.github.com/GziXnine/Data_Structure_C/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GziXnine%2FData_Structure_C/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29165903,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-06T14:37:12.680Z","status":"ssl_error","status_checked_at":"2026-02-06T14:36:22.973Z","response_time":59,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["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"],"created_at":"2024-11-18T14:12:10.388Z","updated_at":"2026-02-06T15:08:03.587Z","avatar_url":"https://github.com/GziXnine.png","language":"C","readme":"# Data Structures and Algorithms\n\nWelcome 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.\n\n![Data Structures and Algorithms](https://github.com/AllamF5J/Data_Structure_C/blob/main/Chess.jpg)\n\n  \u003cp align=\"center\"\u003e\n    \u003cimg src=\"https://img.shields.io/badge/Completion-83%25-blue\" alt=\"Completion\"\u003e\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\n    \u003cimg src=\"https://visitor-badge.laobi.icu/badge?page_id=AllamF5J/Data_Structure_C\" alt=\"Visitors\"/\u003e\n  \u003c/p\u003e\n\n# Data Structures and Algorithms\n\n## Data Structures\n\n| **Category** | **Data Structure** | **Link** |\n|--------------|--------------------|----------|\n| Arrays       | Dynamic 1D Array (Vector)    | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Array/Dynamic%201D_Array%20(vector)) |\n|              | Jagged Array                 | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Array/Jagged%20Array) |\n| Graph        | Adjacency Matrix             | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Graph/Adjacency%20Matrix) |\n|              | Undirected Graph             | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Graph/Undirected%20Graph) |\n| Hash Table   | Direct Addressing Table      |          |\n|              | Open Addressing              | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Hash%20Table/Open%20Addressing) |\n| Heap         | Binary Heap                  |          |\n|              | Max Heap                     |          |\n|              | Min Heap                     |          |\n|              | Binomial Heap                |          |\n| Linked List  | Array Based Linked List      | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Linked%20List/Array%20Based%20Linked%20List) |\n|              | Circular Linked List         | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Linked%20List/Circular%20Linked%20List) |\n|              | Doubly Linked List           | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Linked%20List/Doubly%20Linked%20List) |\n|              | Singly Linked List           | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Linked%20List/Singly%20Linked%20List) |\n|              | Sorted Linked List           | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Linked%20List/Sorted%20Linked%20List) |\n| Map          | Hash Map                     |          |\n|              | Linked Hash Map              |          |\n| Matrix       | Dynamic 2D Array             | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Matrix) |\n| Queue        | Array Based Queue            | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Queue/Array-based%20Queue) |\n|              | Circular Queues              | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Queue/Circular%20Queue) |\n|              | Linked List Based Queue      | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Queue/Linked%20List%20Based%20Queue) |\n|              | Two Stacks Based Queue       | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Queue/Two%20Stacks%20Based%20Queue) |\n| Set          | Hash Set                     |          |\n|              | Array Based Set              | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Set/Array%20Based%20Set) |\n|              | Sorted Array Set             |          |\n|              | Linked List Set              | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Set/Linked%20List%20Based%20Set) |\n|              | Tree Set                     |          |\n| Stack        | Array Based Stack            | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Stack/Array%20Based%20Stack) |\n|              | Dynamic Stack                | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Stack/Dynamic%20Stack) |\n|              | Linked List-based Stack      | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Stack/Linked%20List%20Based%20Stack) |\n| Tree         | Binary Search Tree           | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Tree/Binary%20Search%20Tree) |\n|              | Binary Tree                  | [Link](https://github.com/AllamF5J/Data_Structure_C/tree/main/Tree/Binary%20Tree) |\n\n## Algorithms\n\n| **Category** | **Algorithm** | **Link** |\n|--------------|---------------|----------|\n| **Search Algorithms** | | |\n| Binary Search | Exponential Search | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Searching%20Algorithm/Binary%20search/ExponentialSearch.c) |\n|              | Interpolation Search | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Searching%20Algorithm/Binary%20search/InterpolationSearch.c) |\n|              | Lower Bound Search   | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Searching%20Algorithm/Binary%20search/LowerBoundSearch.c) |\n|              | Upper Bound Search   | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Searching%20Algorithm/Binary%20search/UpperBoundSearch.c) |\n|              | Recursive Search     | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Searching%20Algorithm/Binary%20search/RecursiveSearch.c) |\n|              | Rotated Search       | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Searching%20Algorithm/Binary%20search/RotatedSearch.c) |\n|              | Traditional Search   | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Searching%20Algorithm/Binary%20search/TraditionalSearch.c) |\n| Graph Search | Breadth-First Search |          |\n|              | Depth-First Search   |          |\n| Linear Search| Basic Linear Search  | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Searching%20Algorithm/Linear%20search/BasicLinearSearch.c) |\n|              | Optimized Search     | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Searching%20Algorithm/Linear%20search/OptimiziedSearch.c) |\n|              | Recursive Search     | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Searching%20Algorithm/Linear%20search/RecursiveSearch.c) |\n|              | Sequential Search    | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Searching%20Algorithm/Linear%20search/SequentialSearch.c) |\n| **Sorting Algorithms** | | |\n|              | Bubble Sort          | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Sorting%20Algorithm/BubbleSort.c) |\n|              | Count Sort           | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Sorting%20Algorithm/CountSort.c) |\n|              | Heap Sort            | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Sorting%20Algorithm/HeapSort.c) |\n|              | Insertion Sort       | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Sorting%20Algorithm/InsertionSort.c) |\n|              | Merge Sort           | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Sorting%20Algorithm/MergeSort.c) |\n|              | Quick Sort           | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Sorting%20Algorithm/QuickSort.c) |\n|              | Radix Sort           | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Sorting%20Algorithm/RadixSort.c) |\n|              | Selection Sort       | [Link](https://github.com/AllamF5J/Data_Structure_C/blob/main/Sorting%20Algorithm/SelectionSort.c) |\n\n\n## Getting Started\nEach data structure and algorithm has its own folder with implementation details and example code. Feel free to explore and use them in your projects.\nI want to clarify that I haven't finished updating all the items in the repository yet, and I will upload them soon, God willing.\n\n## Contribution\nContributions are welcome! If you have suggestions, improvements, or new algorithms to add, please open an issue or submit a pull request.\n\n## Contact\nYou can reach me via [Gmail](mailto:lamahmd122@gmail.com) or on [Telegram](http://t.me/GziXnine).\n\n\n## License\nThis project is licensed under the [MIT License](LICENSE).\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgzixnine%2Fdata_structure_c","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgzixnine%2Fdata_structure_c","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgzixnine%2Fdata_structure_c/lists"}