This project is made for the purpose of finding a local minimum of a matrix. It is based on a divide-and-conquer method so it can proccess data really fast. This code is probably optimized for practical usage. It is possible to use default, random or custom matrix.
Note: Names of folders and even code variables are mostly written in Bosnian.