Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.
Awesome Lists | Featured Topics | Projects
https://github.com/jeepway/data-structures-in-c

A collection of implementations of commonly used data structures in C.
https://github.com/jeepway/data-structures-in-c
algorithms c c-programming data-structures data-structures-in-c dsa makefile
Last synced: 1 day ago
JSON representation
A collection of implementations of commonly used data structures in C.
Host: GitHub
URL: https://github.com/jeepway/data-structures-in-c
Owner: JeepWay
License: mit
Created: 2024-11-24T15:06:18.000Z (3 months ago)
Default Branch: main
Last Pushed: 2025-01-03T10:02:02.000Z (about 1 month ago)
Last Synced: 2025-01-03T11:19:30.971Z (about 1 month ago)
Topics: algorithms, c, c-programming, data-structures, data-structures-in-c, dsa, makefile
Language: C
Homepage:
Size: 83 KB
Stars: 2
Watchers: 1
Forks: 0
Open Issues: 0
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project

README

        # Data Structures in C

![License](https://img.shields.io/github/license/JeepWay/data-structures-in-C)

![Language](https://img.shields.io/badge/Language-C-blue)

This repository contains implementations of various data structures in C, based on the concepts and examples presented in the book ["Fundamentals of Data Structures in C"](https://caucse.club/wp-content/uploads/2022/05/Fundamentals-of-Data-Structures-in-C-Ellis-Horowitz-Sartaj-Sahni-etc.-.pdf) by Ellis Horowitz, Sartaj Sahni, and Susan Anderson-Freed.

Each data structure is implemented in a separate directory, with a `main.c` file that demonstrates the usage of the data structure. For example, the stack of general data type using arrays is in the [`stack/general_stack`](https://github.com/JeepWay/data-structures-in-C/tree/main/stack/general_stack) directory, with the [`main.c`](https://github.com/JeepWay/data-structures-in-C/blob/main/stack/general_stack/main.c) file demonstrating the usage of the stack.

The [`Makefile`](https://github.com/JeepWay/data-structures-in-C/blob/main/Makefile) in the root directory can be used to compile and run the demo programs for each data structure according to the `TARGET` specified, you can find them in the [usage section](https://github.com/JeepWay/data-structures-in-C?tab=readme-ov-file#makefile-usage) below.

## Table of Contents

- **[Stacks](https://github.com/JeepWay/data-structures-in-C/tree/main/stack)**

  - Stack using Arrays (general) [📂](https://github.com/JeepWay/data-structures-in-C/tree/main/stack/general_stack)

  - Stack using Arrays (int) [📂](https://github.com/JeepWay/data-structures-in-C/tree/main/stack/int_stack)

- **[Queues](https://github.com/JeepWay/data-structures-in-C/tree/main/queue)**

  - Queue using Arrays with N-1 slots (general) [📂](https://github.com/JeepWay/data-structures-in-C/tree/main/queue/general_circular_array_n-1_slot_queue)

  - Queue using Arrays with N slots (int) [📂](https://github.com/JeepWay/data-structures-in-C/tree/main/queue/general_circular_array_n_slot_queue)

  - Circular Queue using Single Linked List [📂](https://github.com/JeepWay/data-structures-in-C/tree/main/queue/general_single_list_queue)

- **[Linked Lists](https://github.com/JeepWay/data-structures-in-C/tree/main/linked_list)**

  - Singly Linked List (grneral) [📂](https://github.com/JeepWay/data-structures-in-C/tree/main/linked_list/general_single_list)

  - Singly Linked List (int) [📂](https://github.com/JeepWay/data-structures-in-C/tree/main/linked_list/int_single_list)

  - Doubly Linked Lists (grneral) [📂](https://github.com/JeepWay/data-structures-in-C/tree/main/linked_list/general_double_list)

  - Doubly Linked Lists (int) [📂](https://github.com/JeepWay/data-structures-in-C/tree/main/linked_list/int_double_list)

- **[Trees](https://github.com/JeepWay/data-structures-in-C/tree/main/tree)**

  - Binary Trees [📂](https://github.com/JeepWay/data-structures-in-C/tree/main/tree/binary_tree)

  - Binary Search Trees [📂](https://github.com/JeepWay/data-structures-in-C/tree/main/tree/binary_search_tree)

- **[Sets](https://github.com/JeepWay/data-structures-in-C/tree/main/set)**

  - Disjoint Sets [📂](https://github.com/JeepWay/data-structures-in-C/tree/main/set/disjoint_set)

- **[Graphs](https://github.com/JeepWay/data-structures-in-C/tree/main/graph)**

  - BFS [📂](https://github.com/JeepWay/data-structures-in-C/tree/main/graph/bfs)

  - DFS [📂](https://github.com/JeepWay/data-structures-in-C/tree/main/graph/dfs)

  - Kruskal's Minimum Spanning Tree [📂](https://github.com/JeepWay/data-structures-in-C/tree/main/graph/Kruskal_mst)

- **[Hashing](https://github.com/JeepWay/data-structures-in-C/tree/main/hashing)**

  - Hash Table using Linked List [📂](https://github.com/JeepWay/data-structures-in-C/tree/main/hashing/hashtable_list)

  - Hash Table using Arrays [📂](https://github.com/JeepWay/data-structures-in-C/tree/main/hashing/hashtable_array)

- **[Heap Structures](https://github.com/JeepWay/data-structures-in-C/tree/main/heap)**

  - Min Heap (general) [📂](https://github.com/JeepWay/data-structures-in-C/tree/main/heap/general_min_heap)

  - Min Heap (int) [📂](https://github.com/JeepWay/data-structures-in-C/tree/main/heap/int_min_heap)

  - Max Heap (int) [📂](https://github.com/JeepWay/data-structures-in-C/tree/main/heap/int_max_heap)

  - Min-Max Heap (general) [📂](https://github.com/JeepWay/data-structures-in-C/tree/main/heap/general_min_max_heap)

  - Deap (general) [📂](https://github.com/JeepWay/data-structures-in-C/tree/main/heap/general_deap)

  - Min Leftist Tree (general) [📂](https://github.com/JeepWay/data-structures-in-C/tree/main/heap/general_min_leftist_tree)

  - Binoimial Heap [📂](https://github.com/JeepWay/data-structures-in-C/tree/main/heap/binomial_heap)

  - Fibonacci Heap [📂](https://github.com/JeepWay/data-structures-in-C/tree/main/heap/fibonacci_heap)

## Makefile Usage

### Stacks

* Stack of `general` data type [📃](https://github.com/JeepWay/data-structures-in-C/blob/main/stack/general_stack/main.c)

    ```bash

    make test TARGET=general_stack

    ```

* Stack of `integer` data type [📃](https://github.com/JeepWay/data-structures-in-C/blob/main/stack/int_stack/main.c)

    ```bash

    make test TARGET=int_stack

    ```

### Queues

* Queue of `general` data type using arrays with N-1 slots [📃](https://github.com/JeepWay/data-structures-in-C/blob/main/queue/general_circular_array_n-1_slot_queue/main.c)

    ```bash

    make test TARGET=general_circular_array_n-1_slot_queue

    ```

* Queue of `general` data type using arrays with N slots [📃](https://github.com/JeepWay/data-structures-in-C/blob/main/queue/general_circular_array_n_slot_queue/main.c)

    ```bash

    make test TARGET=general_circular_array_n_slot_queue

    ```

* Circular of `general` data type using single linked list [📃](https://github.com/JeepWay/data-structures-in-C/blob/main/queue/general_single_list_queue/main.c)

    ```bash

    make test TARGET=general_single_list_queue

    ```

### Linked Lists

* Singly linked list of `general` data type [📃](https://github.com/JeepWay/data-structures-in-C/tree/main/linked_list/general_single_list/main.c)

    ```bash

    make test TARGET=general_single_linked_list

    ```

* Singly linked list of `integer` data type [📃](https://github.com/JeepWay/data-structures-in-C/tree/main/linked_list/int_single_list/main.c)

    ```bash

    make test TARGET=int_single_linked_list

    ```

* Doubly linked list of `general` data type [📃](https://github.com/JeepWay/data-structures-in-C/blob/main/linked_list/general_double_list/main.c)

    ```bash

    make test TARGET=general_double_linked_list

    ```

* Doubly linked list of `integer` data type [📃](https://github.com/JeepWay/data-structures-in-C/blob/main/linked_list/int_double_list/main.c)

    ```bash

    make test TARGET=int_double_linked_list

    ```

### Trees

* Binary tree [📃](https://github.com/JeepWay/data-structures-in-C/tree/main/tree/binary_tree/main.c)

    ```bash

    make test TARGET=binary_tree

    ```

* Binary search tree [📃](https://github.com/JeepWay/data-structures-in-C/tree/main/tree/binary_search_tree/main.c)

    ```bash

    make test TARGET=binary_search_tree

    ```

### Sets

* Disjoint sets [📃](https://github.com/JeepWay/data-structures-in-C/blob/main/set/disjoint_set/main.c)

    ```bash

    make test TARGET=disjoint_set

    ```

### Graphs

* BFS [📃](https://github.com/JeepWay/data-structures-in-C/blob/main/graph/bfs/main.c)

    ```bash

    make test TARGET=graph_bfs

    ```

* DFS [📃](https://github.com/JeepWay/data-structures-in-C/blob/main/graph/dfs/main.c)

    ```bash

    make test TARGET=graph_dfs

    ```

* Kruskal's Minimum Spanning Tree [📃](https://github.com/JeepWay/data-structures-in-C/blob/main/graph/Kruskal_mst/main.c)

    ```bash

    make test TARGET=Kruskal_mst

    ```

### Hashing

* Hash table using linked list [📃](https://github.com/JeepWay/data-structures-in-C/tree/main/hashing/hashtable_list/main.c)

    ```bash

    make test TARGET=hashtable_list

    ```

* Hash table using arrays [📃](https://github.com/JeepWay/data-structures-in-C/tree/main/hashing/hashtable_array/main.c)

    ```bash

    make test TARGET=hashtable_array

    ```

  * If collision occurs during insertion, the key is inserted into the next available slot according to linear probing.

### Heap Structures

* Min heap of `general` data type [📃](https://github.com/JeepWay/data-structures-in-C/blob/main/heap/general_min_heap/main.c)

    ```bash

    make test TARGET=general_min_heap

    ```

* Min heap of `integer` data type [📃](https://github.com/JeepWay/data-structures-in-C/blob/main/heap/int_min_heap/main.c)

    ```bash

    make test TARGET=int_min_heap

    ```

* Max heap of `integer` data type [📃](https://github.com/JeepWay/data-structures-in-C/blob/main/heap/int_max_heap/main.c)

    ```bash

    make test TARGET=int_max_heap

    ```

* Min-max heap of `general` data type [📃](https://github.com/JeepWay/data-structures-in-C/blob/main/heap/general_min_max_heap/main.c)

    ```bash

    make test TARGET=general_min_max_heap

    ```

* Deap of `general` data type [📃](https://github.com/JeepWay/data-structures-in-C/blob/main/heap/general_deap/main.c)

    ```bash

    make test TARGET=general_deap

    ```

* Min leftist tree of `general` data type [📃](https://github.com/JeepWay/data-structures-in-C/blob/main/heap/general_min_leftist_tree/main.c)

    ```bash

    make test TARGET=general_min_leftist_tree

    ```

* Binomial heap [📃](https://github.com/JeepWay/data-structures-in-C/blob/main/heap/binomial_heap/main.c)

    ```bash

    make test TARGET=binomial_heap

    ```

* Fibonacci heap [📃](https://github.com/JeepWay/data-structures-in-C/blob/main/heap/fibonacci_heap/main.c)

    ```bash

    make test TARGET=fibonacci_heap

    ```

### Clean up object and executable files

```bash

make clean

```

## Acknowledgments

Inspired by and references from:

* [bartobri/data-structures-c](https://github.com/bartobri/data-structures-c)

* [AnishLohiya/DSA](https://github.com/AnishLohiya/DSA)