Algorithmic Problem in Java

A simple code repository dealing with some basic and intersting problems of CS;

Contains the below problems

1. Basic Recursion problems. like Binary Search, Euclidean Algo, Tower of Hanoi, Adding numbers, Factoiral, House Building etc
2. Search Aglo. like Linear Search, ..
3. Selection Alog. like Quick search, Online Search
4. BackTarcking adventure like NQueen;s Problem, Hamiltonain Cycle/Path Problem, Color Problem, Knight's problem, solving a maze, and Your Favorite Sudoku 5.Dynamic Programming like, Fibonacci problem, Knapsack problem, Rod Cutting problem, Subset sum probelm
5. The Bin Packing problem
6. Divide and COnquer methods like merge sort, Closest pair of points and many more

Installation

OS X & Linux:

git clone https://github.com/qalmaqihir/AlgorithmicProblemsInJava.git

Usage example

First search about each problem, read its interesting history and application. Then go for it to solve by yourself, use pseudo codes. Finally compare it with my solutions...

For more about any problem, please refer to the Wiki.

Development setup

Release History

Each commit has its own history...

Meta

Your Name – @YourTwitter – [email protected]

Distributed under the XYZ license. See LICENSE for more information.

https://github.com/yourname/github-link

Contributing

1. Fork it (https://github.com/qalmaqihir/AlgorithmicProblemsInJava/fork)
2. Create your feature branch (git checkout -b feature/fooBar)
3. Commit your changes (git commit -am 'Add some fooBar')
4. Push to the branch (git push origin feature/fooBar)
5. Create a new Pull Request