{"id":21900946,"url":"https://github.com/utsavpatel562/dsa","last_synced_at":"2025-10-09T10:32:11.560Z","repository":{"id":233587235,"uuid":"775189495","full_name":"utsavpatel562/DSA","owner":"utsavpatel562","description":"Data structure \u0026 Algorithm ","archived":false,"fork":false,"pushed_at":"2024-12-06T01:15:01.000Z","size":40,"stargazers_count":6,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-12-06T02:22:40.855Z","etag":null,"topics":["bubble-sort","doubly-linked-list","dsa-algorithm","insertion-sort","linked-list","merge-sort","radix-sort","stack-queue","tree"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/utsavpatel562.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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-20T23:24:42.000Z","updated_at":"2024-12-06T01:15:04.000Z","dependencies_parsed_at":"2024-11-28T15:11:50.594Z","dependency_job_id":"a1bc1056-cc7d-475e-a32c-3b196589cc9a","html_url":"https://github.com/utsavpatel562/DSA","commit_stats":null,"previous_names":["utsavpatel562/dsa"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/utsavpatel562%2FDSA","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/utsavpatel562%2FDSA/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/utsavpatel562%2FDSA/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/utsavpatel562%2FDSA/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/utsavpatel562","download_url":"https://codeload.github.com/utsavpatel562/DSA/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":235813531,"owners_count":19048987,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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":["bubble-sort","doubly-linked-list","dsa-algorithm","insertion-sort","linked-list","merge-sort","radix-sort","stack-queue","tree"],"created_at":"2024-11-28T15:11:39.988Z","updated_at":"2025-10-09T10:32:11.245Z","avatar_url":"https://github.com/utsavpatel562.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Data Structure and Algorithm\n\nThis repository contains implementations of various data structures and algorithms in the C programming language. These implementations serve as educational resources and examples for understanding fundamental concepts in computer science.\n\n## Data Structures\n\n### Linked List\n\nThe linked list is a linear data structure where elements are stored in a sequence and each element points to the next one. It includes:\n\n- **Singly Linked List**: Each node contains data and a pointer to the next node.\n- **Doubly Linked List**: Each node contains data, a pointer to the next node, and a pointer to the previous node.\n- **Circular Linked List**: The last node points to the first node, forming a circle.\n\n### Queue\n\nA queue is a linear data structure that follows the FIFO (First In, First Out) principle. It includes:\n\n- **Circular Queue**: A fixed-size queue where the last element is connected to the first element, forming a circle.\n\n## Sorting Algorithms\n\n### Insertion Sort\n\nInsertion sort is a simple sorting algorithm that builds the final sorted array one item at a time. It takes an element from the array and inserts it into the correct position in the sorted part of the array.\n\n### Bubble Sort\n\nBubble sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order.\n\n### Selection Sort\n\nSelection sort is a simple sorting algorithm that repeatedly selects the minimum element from the unsorted part of the array and puts it at the beginning.\n\n### Merge Sort\n\nMerge sort is a divide and conquer algorithm that divides the array into two halves, sorts them separately, and then merges the sorted halves.\n\n### Radix Sort\n\nRadix sort is a non-comparative sorting algorithm that sorts numbers by processing individual digits.\n\n## Usage\n\nEach data structure or algorithm implementation is contained in its own C file. To use a particular implementation:\n\n1. Clone the repository: `git clone https://github.com/your-username/Data-Structure-and-Algorithm.git`\n2. Navigate to the directory of the implementation you're interested in.\n3. Compile the C file using a C compiler like GCC: `gcc filename.c -o filename`.\n4. Run the executable file: `./filename`.\n\n## Contributing\n\nContributions are welcome! If you would like to contribute, please follow these steps:\n\n1. Fork the repository.\n2. Create a new branch: `git checkout -b feature/my-feature`.\n3. Make your changes and commit them: `git commit -m 'Add some feature'`.\n4. Push to the branch: `git push origin feature/my-feature`.\n5. Submit a pull request.\n\n## License\n\nThis project is licensed under the MIT License - see the [LICENSE](LICENSE) file for details.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Futsavpatel562%2Fdsa","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Futsavpatel562%2Fdsa","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Futsavpatel562%2Fdsa/lists"}