1. Paul Barbu - Gheorghe
  2. algorithms

Source

algorithms /

Filename Size Date modified Message
12 B
added backtracking
979 B
added the zones in an array, divide-et-impera, goldbach, dinamic programming, binary search, LCD and LCM
892 B
added the zones in an array, divide-et-impera, goldbach, dinamic programming, binary search, LCD and LCM
880 B
added the zones in an array, divide-et-impera, goldbach, dinamic programming, binary search, LCD and LCM
17 B
added binary tree and binary search tree algorithms
29 B
added binary tree and binary search tree algorithms
820 B
added backtracking
876 B
added the zones in an array, divide-et-impera, goldbach, dinamic programming, binary search, LCD and LCM
1016 B
added the zones in an array, divide-et-impera, goldbach, dinamic programming, binary search, LCD and LCM
1.1 KB
added graph algorithms
2.1 KB
added binary trees
30 B
added binary trees
463 B
added the zones in an array, divide-et-impera, goldbach, dinamic programming, binary search, LCD and LCM
1.4 KB
added binary tree and binary search tree algorithms
963 B
added binary tree and binary search tree algorithms
445 B
added the zones in an array, divide-et-impera, goldbach, dinamic programming, binary search, LCD and LCM
892 B
added the zones in an array, divide-et-impera, goldbach, dinamic programming, binary search, LCD and LCM
420 B
added the zones in an array, divide-et-impera, goldbach, dinamic programming, binary search, LCD and LCM
1.2 KB
added graph algorithms
0 B
dummy file
895 B
added the zones in an array, divide-et-impera, goldbach, dinamic programming, binary search, LCD and LCM
1.9 KB
added the zones in an array, divide-et-impera, goldbach, dinamic programming, binary search, LCD and LCM
372 B
added the zones in an array, divide-et-impera, goldbach, dinamic programming, binary search, LCD and LCM
1.9 KB
added graph algorithms
800 B
the knight problem using plain bt
1.0 KB
added graph algorithms
12 B
added the levenshtein distance algorithm
1.2 KB
added graph algorithms
530 B
added the zones in an array, divide-et-impera, goldbach, dinamic programming, binary search, LCD and LCM
1.2 KB
added the levenshtein distance algorithm
736 B
added the zones in an array, divide-et-impera, goldbach, dinamic programming, binary search, LCD and LCM
1.3 KB
added the zones in an array, divide-et-impera, goldbach, dinamic programming, binary search, LCD and LCM
834 B
added the zones in an array, divide-et-impera, goldbach, dinamic programming, binary search, LCD and LCM
833 B
added quick and merge sort
889 B
added the zones in an array, divide-et-impera, goldbach, dinamic programming, binary search, LCD and LCM
669 B
added quick and merge sort
1.5 KB
added graph algorithms
851 B
added the zones in an array, divide-et-impera, goldbach, dinamic programming, binary search, LCD and LCM
460 B
fixed memory leak in sieve_of_eratosthenes.c
888 B
added the zones in an array, divide-et-impera, goldbach, dinamic programming, binary search, LCD and LCM
1.1 KB
added the zones in an array, divide-et-impera, goldbach, dinamic programming, binary search, LCD and LCM

Algorithms

A list of algorithms and their implementation written in various programming languages

Disclaimer

These implementations of various algorithms are just proof of concepts, maybe they are not functional without a proper input. The code may not respect some standards and many of the variables are named in romanian.

License

This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with this program. If not, see http://www.gnu.org/licenses/.