$Hello friend!
In this repo I gonna share all my excercises on Data Structures and their Algorithms.
The idea behind this daily exercises are simple to develop my analytical skills on Data Structure, learn how to use them efficiently and of course to become a better developer.
I'm using C for the exercises, because C is awesome and it's the best way to really learn and understand the implementation of Data Structures and their Algorithms.
How to use:
- 'git clone' or download the repo.
- Compile the c files with 'gcc'.
- Test cases are inside the main, you can comment them out in order to test the function.
- Display Linked List
- Count and return the sum of the linked list
- Max number of a linked list
- Search a node in a linked list
- Insert a node in a linked list
- Insert a node in a sorted linked list
- Delete a node in a linked list
- Check if linked list is sorted
- Remove duplicates in a linked list
- Reverse a linked list
- Append a linked list
- Merge linked lists
- Display circular linked list
- Insert a node in a circular linked list
- Delete node in a curcular linked list
- Display double linked list
- Insert node in a double linked list
- Delete node in a double linked list
- Reverse double linked list
- Tree recursion
- Indirect recursion
- Nested recursion
- Factorial, Exponentiation and Sum of natural number functions solved recursive
- Taylor series
- Fibonacci series
- Probability function nCr
- Tower of Hanoi solved with recursion
- Insert and append element to array
- Delete an element in a array