Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/hutusi/rethink-c

A reuseable codebase for C Programming Language.
https://github.com/hutusi/rethink-c

algorithm algorithms c data-structures

Last synced: about 1 month ago
JSON representation

A reuseable codebase for C Programming Language.

Awesome Lists containing this project

README 

        
# RETHINK C



[![Build Status](https://travis-ci.org/hutusi/rethink-c.svg?branch=master)](https://travis-ci.org/hutusi/rethink-c)



Relearn and rethink C Programming Language, including some of data structures and algorithms.



The code is licensed under the MIT license, copyright by [hutusi.com](http://hutusi.com/).



Some of the code inspired (copied) by Simon Howard's [c-algorithms](https://github.com/fragglet/c-algorithms), like ArrayList, etc. This project also reused his alloc-testing framework for memory testing.



RETHINK-C aims to build a reuseable codebase for C Programming Language. 



## How to build & test



### Requirements:



* Editor/IDE: VS Code is recommended.

* GCC on Mac, Linux or Windows. (Recommend msys2 + MingW on Windows.)

* CMake. 

* Clang-Format.



### build & test:



* build 



```

cd build

cmake ..

make

```



* test:



```

make test

```



## Goals / Achievements



### Basic Data Structures



- [x] ArrayList, Stack [arraylist.h](src/arraylist.h) [arraylist.c](src/arraylist.c)

- [x] LinkedList [list.h](src/list.h) [list.c](src/list.c)

- [x] Queue [queue.h](src/queue.h) [queue.c](src/queue.c)

- [x] BitMap [bitmap.h](src/bitmap.h) [bitmap.c](src/bitmap.c)

- [x] Muti-dimensional Matrix [matrix.h](src/matrix.h) [matrix.c](src/matrix.c)

- [x] Hash Table [hash_table.h](src/hash_table.h) [hash_table.c](src/hash_table.c) [hash.h](src/hash.h) [hash.c](src/hash.c)



### Trees

- [x] Binary Search Tree [bstree.h](src/bstree.h) [bstree.c](src/bstree.c)

- [x] AVL Tree [avltree.h](src/avltree.h) [avltree.c](src/avltree.c)

- [x] Red Black Tree [rbtree.h](src/rbtree.h) [rbtree.c](src/rbtree.c)

- [x] Binary Heap [heap.h](src/heap.h) [heap.c](src/heap.c)

- [ ] Fibonacci Heap, Binomial Heap

- [x] Skip List [skip_list.h](src/skip_list.h) [skip_list.c](src/skip_list.c)

- [ ] B+ Tree



### Graphs

- [x] Adjacency Matrix [graph.h](src/graph.h) [graph.c](src/graph.c)

- [x] Adjacency List [sparse_graph.h](src/sparse_graph.h) [sparse_graph.c](src/sparse_graph.c)

- [ ] Union-Find

- [x] BFS & DFS [graph.h##bfs(), ##dfs()](src/graph.h)

- [x] Topological sorting (Kahn) [sparse_graph_topo_sort()](src/sparse_graph.h)

- [ ] Floyd

- [x] Dijkstra [dijkstra.h](src/dijkstra.h) [dijkstra.c](src/dijkstra.c)

- [ ] Minimum spanning trees: Prim, Kruskal

- [ ] A-star



### String & Text

- [x] Text (similar to string in C++). [text.h](src/text.h) [text.c](src/text.c)

- [x] BigNum integer [bignum.h](src/bignum.h) [bignum.c](src/bignum.c)

- [ ] BigNum decimal 

- [x] KMP (Knuth-Morris-Pratt) algorithm [kmp.h](src/kmp.h) [kmp.c](src/kmp.c)

- [x] BM (Boyer-Moore) algorithm [bm.h](src/bm.h) [bm.c](src/bm.c)

- [x] Sunday algorithm [sunday.h](src/sunday.h) [sunday.c](src/sunday.c)

- [x] Trie Tree [trie.h](src/trie.h) [trie.c](src/trie.c)

- [x] Aho–Corasick algorithm [ac.h](src/ac.h) [ac.c](src/ac.c)

- [ ] DAT (Double-Array Trie)

- [x] Huffman coding [huffman.h](src/huffman.h) [huffman.c](src/huffman.c)



### Sorting

- [x] Quick Sort [arraylist.c##arraylist_sort()](src/arraylist.c)

- [x] Merge Sort [list.c##list_sort()](src/list.c)

- [x] Heap Sort [heap.h](src/heap.h) [heap.c](src/heap.c)



### Math

- [ ] Matrix multiplication

- [x] Eratosthenes sieve (prime numbers) [prime.h](src/prime.h) [prime.c](src/prime.c)



### Distance Measures

- [x] Euclidean distance [distance.h##euclidiean_distance()](src/distance.h)

- [ ] Manhattan distance 

- [ ] Hamming distance



### MISC

- [ ] Bloom filter