|
|
|
|
This argorithm collection contains algorithms from various areas.
The algorithms in this collection are released under the GPL and LGPL.
- Sorting
- Bubble sort
- Selection sort
- Shaker sort
- Insertion sort
- Merge sort
- Merge sort with additional storage
- Heap sort
- Shell sort
- Quicksort
- Searching
- Recursive binary search in an array
- Iterative binary search in an array
- Linear search in an array
- Find the minimum element in an array
- Find the maximum element in an array
- Date & Time
- Determine if a given year is a leap year
- Compute the weekday
- Compute the day of year
- Compute the week number of a year
- Compute the year of the ISO 8601 week date
- Compute the week of the ISO 8601 week date
- Calculate the number of days in a month
- Convert a time into a julian day number
- Convert a julian day number into a time
- Compute the easter date for a given year
- String
- Replace tabs with the corresponding number of spaces
- Replace leading spaces with the corresponding number of tabs
- Encode a string using base64
- Compress a string using the Lempel Ziv Welch (LZW) compression
- Uncompress a Lempel Ziv Welch (LZW) compressed string
- Compress a string using the run length encoding of bzip2
- Decompress a string using the run length encoding of bzip2
- Compress a string using the run length encoding of PackBits
- Decompress a string using the run length encoding of PackBits
- Burrows-Wheeler transform (basic concept)
- Inverse Burrows-Wheeler transform (basic concept)
- Convert a character string to morse code
- Wildcard match used in command shells
- Mathematics
- Determine wether a given integer number is prime
- Function to calculate the prime factors of a number
- Verify if a given Mersenne number is prime
- Determine the greatest common divisor of two positive integer numbers
- Determine the least common multiple of two positive integer numbers
- Compute PI with 1000 decimal digits using John Machin's formula
- Compute PI with 1000 decimal digits using the Bailey/Borwein/Plouffe formula
- Write PI with 1000 decimal digits using Newtons formula
- Determine the truncated square root of a big integer number
- Exponentiation function for integer numbers
- Multiply integers using the peasant multiplication
- Matrix multiplication
- Random number generator
- Recursive fibonacci function
- Display 100 numbers of the fibonacci sequence
- The tak function
- The ackermann function
- File
- Convert files from windows to unix format
- Convert files from unix to windows format
- Copy all files from one directory to another directory
- Program that encodes and decodes with rot13
- Puzzles
- A program that writes itself
- Function to solve the Towers of Hanoi problem
- Write reciprocal values of the natural numbers from 1 to 20 with 60 digits
- Others
- Compute the sum of the elements of an array
- Compute the product of the elements of an array
|
|