The Algorithms - F#

This repository contains algorithms and data structures implemented in F# for eductional purposes.

Overview

• Algorithms
  • Math
    • Abs
    • Abs Maximum
    • Abs Minimum
    • Factorial
    • Fibonacci
    • Perfect Numbers
    • Power
  • Search
    • Binary Search
  • Sort
    • Bubble Sort
    • Comb Sort
    • Cycle Sort
    • Gnome Sort
    • Heap Sort
    • Insertion Sort
    • Merge Sort
    • Pancake Sort
    • Quick Sort
  • Strings
    • Capitalize
    • Check Anagrams
    • Check Pangram
    • Is Palindrome
    • Jaro Winkler
    • Knuth Morris Pratt
    • Levenshtein Distance
    • Lower
    • Manacher
    • Min Cost String Conversion
    • Navie String Search
    • Prefix Function
    • Rabin Karp
    • Remove Duplicates
    • Reversel Letters
    • Reverse Words
    • Split
    • Swap Case
    • Upper
    • Word Occurrence
    • Z Function

Contribution

You can contribute with pleasure to this repository. Please orient on the directory structure and overall code style of this repository. If you want to ask a question or suggest something, please open an issue.