Algorithms and data structures are fundamental to efficient code and good software design. Creating and designing excellent algorithms is required for being an exemplary programmer. This repository's goal is to demonstrate how to correctly implement common data structures and algorithms in the simplest and most elegant ways. it includes algorithms, Fundamental data structures and abstract data types (ADTs).
some sources came from different resources like Algorithms, 4th Edition book by Robert Sedgewick and Kevin Wayne
Basic programming model: A library of static methods is a set of static methods that are defined in a Java class. Of critical importance in this model is that libraries of static methods enable modular programming where we build libraries of static methods (modules) and a static method in one library can call static methods defined in other libraries.
This repository provides algorithm implementations in Java.
This repository is contribution friendly. If you'd like to add or improve an algorithm or data structure, your contribution is welcome.
To compile and run any of the algorithms here, you need at least JDK version 8. Gradle can make things more convenient for you, but it is not required.
This project supports the Gradle Wrapper. The Gradle wrapper automatically downloads Gradle at the first time it runs
This repository is released under the MIT license. In short, this means you are free to use this software in any personal, open-source or commercial projects. Attribution is optional but appreciated.