{"id":22412473,"url":"https://github.com/tusharpamnani/dsa","last_synced_at":"2025-03-27T03:22:22.189Z","repository":{"id":209840934,"uuid":"725076071","full_name":"tusharpamnani/DSA","owner":"tusharpamnani","description":"A comprehensive resource for learning DSA. Originally crafted for personal revision, it has evolved into an open library for enthusiasts, students, and developers alike.","archived":false,"fork":false,"pushed_at":"2023-12-13T13:02:48.000Z","size":68,"stargazers_count":2,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-01T08:46:25.241Z","etag":null,"topics":["algorithms","data-structures"],"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/tusharpamnani.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}},"created_at":"2023-11-29T11:43:51.000Z","updated_at":"2024-11-06T09:49:39.000Z","dependencies_parsed_at":"2023-12-11T16:49:39.577Z","dependency_job_id":null,"html_url":"https://github.com/tusharpamnani/DSA","commit_stats":null,"previous_names":["tusharpamnani/dsa"],"tags_count":1,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tusharpamnani%2FDSA","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tusharpamnani%2FDSA/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tusharpamnani%2FDSA/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tusharpamnani%2FDSA/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/tusharpamnani","download_url":"https://codeload.github.com/tusharpamnani/DSA/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245773658,"owners_count":20669827,"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":["algorithms","data-structures"],"created_at":"2024-12-05T14:08:59.793Z","updated_at":"2025-03-27T03:22:22.162Z","avatar_url":"https://github.com/tusharpamnani.png","language":"C++","readme":"# Data Structures and Algorithms Repository\n\nWelcome to the Data Structures and Algorithms repository! This repository contains C/C++ implementations of fundamental data structures and algorithms, designed to help you learn and understand core concepts in computer science.\n\n## Table of Contents\n\n- [Graphs](#graphs)\n- [Linked Lists](#linked-lists)\n- [Sorting Algorithms](#sorting-algorithms)\n- [Searching Algorithms](#searching-algorithms)\n- [Stack](#stack)\n- [Queue](#queue)\n\n## Graphs\n\nThe `graphs` directory includes C/C++ implementations of essential graph algorithms and representations. Graphs are versatile data structures used to model relationships between entities.\n\n### Features\n\n1. **Depth-First Search (DFS):** Traverse through the graph using DFS. ([Code in C++](./Graphs/DFS.cpp)) ([Code in C](./Graphs/DFS.c))\n2. **Breadth-First Search (BFS):** Explore the graph in breadth-first order. ([Code in C++](./Graphs/BFS.cpp)) ([Code in C](./Graphs/BFS.c))\n3. **Dijkstra's Shortest Path:** Find the shortest path in a weighted graph. ([Code in C++](./Graphs/DijkstrasAlgorithm.cpp)) ([Code in C](./Graphs/DijkstrasAlgorithm.c))\n4. **Prim's Minimum Spanning Tree:** Construct the minimum spanning tree using Prim's algorithm. ([Code in C++](./Graphs/PrimsAlgorithm.cpp)) ([Code in C](./Graphs/Prim.c))\n5. **Kruskal's Minimum Spanning Tree:** Build the minimum spanning tree using Kruskal's algorithm. ([Code in C++](./Graphs/KruskalsAlgorithm.cpp)) ([Code in C](./Graphs/Kruskal.c))\n\n## Linked Lists\n\nThe `linked_lists` directory contains C/C++ implementations of various linked list types, offering insights into their structure and operations.\n\n### Features\n\n1. **Singly Linked List:** Basic singly linked list operations. ([Code in C](./Linked-Llists/SinglyLinkedList.c))\n2. **Doubly Linked List:** Operations on doubly linked lists, including forward and backward traversal. ([Code in C](./Linked%20Lists/DoublyLinkedLists.c))\n3. **Circular Linked List:** Circular representation and operations on linked lists. ([Code in C](./Linked_-Lists/CircularLinkedList.c))\n\n## Sorting Algorithms\n\nThe `sorting_algorithms` directory presents C/C++ implementations of well-known sorting algorithms.\n\n### Sorting Algorithms Implemented\n\n1. **Quick Sort:** Efficient in-place sorting. ([Code in C++](./Sorting/2.QuickSort.cpp))\n2. **Merge Sort:** Divide-and-conquer approach for stable sorting. ([Code in C++](./Sorting/1.MergeSort.cpp))\n3. **Heap Sort:** Efficient comparison-based sorting. ([Code](./sorting_algorithms/HeapSort.cpp))\n4. **Insertion Sort:** Simple sorting algorithm with linear time for small data sets. ([Code](./sorting_algorithms/InsertionSort.cpp))\n5. **Counting Sort:** Non-comparative sorting for integers. ([Code](./sorting_algorithms/CountingSort.cpp))\n6. **Shell Sort:** Variance of insertion sort with better performance. ([Code](./sorting_algorithms/ShellSort.cpp))\n\n## Searching Algorithms\n\nThe `searching_algorithms` directory showcases C/C++ implementations of common searching algorithms.\n\n### Searching Algorithms Implemented\n\n1. **Binary Search:** Efficient search in sorted arrays. ([Code in C++](./Searching/1.BinarySearch.cpp))\n2. **Linear Search:** Basic linear search algorithm. ([Code](./Searching/LinearSearch.cpp))\n\n## Stack\n\nThe `stack` directory provides C++ implementations of the stack data structure.\n\n### Features\n\n1. **Push and Pop operations:** Fundamental stack operations. ([Code](./stack/Stack.cpp))\n2. **Stack Implementation using Arrays:** Basic array-based stack. ([Code](./stack/ArrayStack.cpp))\n3. **Stack Implementation using Linked List:** Stack implemented using a linked list. ([Code](./stack/LinkedListStack.cpp))\n\n## Queue\n\nThe `queue` directory contains C++ implementations of the queue data structure, including different variations.\n\n### Features\n\n1. **Enqueue and Dequeue operations:** Basic queue operations. ([Code](./queue/Queue.cpp))\n2. **Queue Implementation using Arrays:** Simple array-based queue. ([Code](./queue/ArrayQueue.cpp))\n3. **Queue Implementation using Linked List:** Queue implemented using a linked list. ([Code](./queue/LinkedListQueue.cpp))\n4. **Circular Queue:** Queue with a circular structure. ([Code](./queue/CircularQueue.cpp))\n5. **Double Ended Queue (Deque):** Queue that allows insertion and deletion at both ends. ([Code](./queue/Deque.cpp))\n6. **Priority Queue:** Queue with elements assigned priority levels. ([Code](./queue/PriorityQueue.cpp))\n\n## Contribution\n\nContributions are welcome! If you have suggestions, improvements, or additional implementations, feel free to open an issue or submit a pull request.\n\nHappy Coding!\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftusharpamnani%2Fdsa","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftusharpamnani%2Fdsa","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftusharpamnani%2Fdsa/lists"}