F-Sharp is a comprehensive open-source repository featuring algorithms and data structures implemented in the F programming language, designed primarily for educational purposes. The collection covers a wide range of fundamental topics including mathematical operations such as factorials, Fibonacci sequences, greatest common divisors, and perfect numbers. It includes classic sorting algorithms like Bubble Sort, Heap Sort, Merge Sort, and Quick Sort, as well as search strategies such as Binary Search. The suite also provides extensive string processing utilities for tasks like anagram detection, palindrome checking, pangram validation, edit distance calculation using Levenshtein distance, and pattern matching via Knuth Morris Pratt and Rabin Karp algorithms. Each implementation is written with clarity to aid learners in understanding logic and functional programming paradigms. The project maintains code quality through continuous integration testing and offers a structured directory organization for easy navig
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.