सार्वजनिक जानकारी से बना चयन मार्गदर्शन। केवल संदर्भ हेतु।
एक फ्लटर/डार्ट पैकेज जो प्रदर्शन के ध्यान में रखते हुए दक्ष और लचीले एल्गोरिदम का संग्रह प्रदान करता है। यह आम गणितीय कार्यों के लिए पुनः उपयोगी समाधान प्रदान करता है, जिससे गणित-आधारित या पाठ प्रसंस्करण एप्लिकेशन पर काम करने वाले डेवलपर्स के लिए आदर्श है। पैकेज सभी प्रमुख प्लेटफॉर्म पर अनुकूलित है, जिससे एक समान व्यवहार और गति सुनिश्चित होती है। साफ और अच्छी तरह से दस्तावेज़ीकृत कोड के साथ, यह सरल उपयोग के मामलों से लेकर जटिल एल्गोरिदम की आवश्यकताओं तक समर्थन करता है।
उपयोग
डेटा क्रमबद्धता और खोज
पाठ पैटर्न मैचिंग
गणितीय गणना
अनुकूलन समस्याएँ
संरचित डेटा का विश्लेषण
एल्गोरिदम प्रोटोटाइपिंग
मुख्य विशेषताएँ
उच्च प्रदर्शन वास्तविकीकरण
क्रॉस-प्लेटफॉर्म संगतता
मॉड्यूलर और विस्तारशील डिज़ाइन
अच्छी तरह से दस्तावेज़ित APIs
लचीलापन और दक्षता पर ध्यान केंद्रित करें
विविध एल्गोरिदम प्रकार के लिए समर्थन
इनके लिए उपयुक्त
त्वरित एल्गोरिदम की आवश्यकता वाले विकासकर्ता
गणित और डेटा प्रोसेसिंग एप्लिकेशन
पाठ विश्लेषण उपकरण
शैक्षिक परियोजनाएँ
प्रदर्शन-महत्वपूर्ण एप्लिकेशन
विचार योग्य बातें
एल्गोरिदमिक अवधारणाओं की समझ की आवश्यकता है
पूर्ण कार्यक्षमता के लिए अतिरिक्त निर्भरताओं की आवश्यकता हो सकती है
गैर-जटिल गणनात्मक कार्यों के लिए सबसे उपयुक्त
केवल मूलभूत उपयोगिता कार्यों के लिए नहीं बनाया गया है
मूल README
संबंधित सोर्स रिपॉज़िटरी के मूल README का स्नैपशॉट। नवीनतम सामग्री के लिए रिपॉज़िटरी देखें।
algorithmic
A collection of useful algorithms keeping performance and flexibility on mind.
Usage
The following import will give you access to all the algorithms in this package.
You can check the benchmark.log file for the benchmark results.
Searching algorithms
Index searching algorithms attempt to find the index of an item from a list.
Binary Search
⭐ 1000% faster than collection.lowerBound() and collection.binarySearch()
A faster searching algorithm for sorted list of items. It divides the list into two parts and discard one based on the middle value of them. This requires the list to be sorted in an increasing order.
Functions
Performance
Tests
Benchmark
Since
lowerBound()
O(logn)
✔️
✔️
0.0.3
upperBound()
O(logn)
✔️
✔️
0.0.3
binarySearch()
O(logn)
✔️
✔️
0.0.3
binarySearchUpper()
O(logn)
✔️
✔️
0.0.6
binarySearchQuick()
O(logn)
✔️
✔️
0.0.6
Linear Search
A general searching algorithm for any kind of list. It tests every elements on the list one by one.
Functions
Performance
Tests
Benchmark
Since
linearSearch()
O(n)
✔️
✔️
0.0.1
linearSearchBy()
O(n)
✔️
✔️
0.0.4
linearSearchReversed()
O(n)
✔️
✔️
0.0.1
linearSearchReversedBy()
O(n)
✔️
✔️
0.0.4
NOTE:
Sorting algorithms
Sorting algorithms puts a list of items into an increasing order.
Quick Sort
⭐ 500% faster than list.sort() for 700k items [algorithmic.quickSortHaore()]
Quicksort is an in-place sorting algorithm that works by selecting a pivot element and partitioning the list surrounding it. There are several schemes for selecting the pivot. The sorting performance varies for different schemes.
Functions
Performance
Tests
Benchmark
Since
quickSortHaore()
O(nlogn)
✔️
✔️
0.0.7
quickSortLomuto()
O(nlogn)
✔️
✔️
0.0.6
Counting Sort
⭐ 600% faster than list.sort() for 700k numbers
Counting sort is a specialized sorting algorithm to sort integers of ranges in linear time. It counts the frequencies of the numbers appearing in an array, and uses it to reconstruct a sorted list.
Functions
Performance
Tests
Benchmark
Since
countingSort()
O(n + k)
✔️
✔️
0.0.9
countingSortOf()
O(n + k)
✔️
✔️
0.0.9
Here, k is the range of numbers
Cocktail Shaker Sort
⭐ 400% faster than list.sort() for 32 items
Cocktail shaker sort extends bubble sort by operating in two directions. It has O(n) time complexity for an already sorted list.
This algorithm is known by many other names, e.g.: bidirectional bubble sort, cocktail sort, shaker sort, ripple sort, shuffle sort, shuttle sort etc.
Functions
Performance
Tests
Benchmark
Since
cocktailShakerSort()
O(n²)
✔️
✔️
0.0.8
Insertion Sort
⭐ 300% faster than list.sort() for 32 items
Insertion sort sorts splits the list into two parts: the left part is ordered and the right part is unordered. In each iteration, it removes the first item from right part, and insert it into the left part maintaining the increasing order.
Functions
Performance
Tests
Benchmark
Since
insertionSort()
O(n²)
✔️
✔️
0.0.5
Comb Sort
Comb sort improves bubble sort by eliminating small values near the end of the list, since they slows down bubble sort. It has O(n) time complexity for an already sorted list.
Functions
Performance
Tests
Benchmark
Since
combSort()
O(n²)
✔️
✔️
0.0.8
Selection Sort
Selection sort algorithm performs sorting by finding the minimum element from the unordered range and putting it at the beginning in each iteration.
Functions
Performance
Tests
Benchmark
Since
selectionSort()
O(n²)
✔️
✔️
0.0.5
Bubble Sort
Bubble sort performs sorting by repeatedly stepping through the list, comparing adjacent elements and swapping them if they are in the wrong order.
Functions
Performance
Tests
Benchmark
Since
bubbleSort()
O(n²)
✔️
✔️
0.0.5
Gnome Sort
⭐ 300% faster than list.sort() for 32 numbers
Gnome sort is a variation to the insertion sort which uses a much simpler implementation. It has O(n) time complexity for an already sorted list.
Functions
Performance
Tests
Benchmark
Since
gnomeSort()
O(n²)
✔️
✔️
0.0.5
Merge Sort
Merge sort is a divide and conquer based algorithm, which can handle very large arrays. Unlike quick sort, it promises O(n log n) performance in worst case and provides stable sort. But it requires equal amount of memory as the length of the array and the implementation runs slower compared than quick sort.
Functions
Performance
Tests
Benchmark
Since
mergeSort()
O(nlogn)
✔️
✔️
0.0.8
Radix Sort
⭐ 200% faster than list.sort() for 700k numbers
Radix sort can sort a range of integers without using any comparisons. It is a special form of bucket sort, which distribute elements into buckets according to their radix.
Functions
Performance
Tests
Benchmark
Since
radixSort()
O(nlog_bn)
✔️
✔️
0.0.9
radixSortOf()
O(nlog_bn)
✔️
✔️
0.0.9
Here, b is the radix
String Algorithms
String Metrics
Levenshtein Distance
⭐ 120% faster than edit_distance.Levenshtein().distance()
Levenshtein distance returns the minimum number of ediit operations to transform one string (or array) to another. The permitted operations here are insertion, deletion and substitution. The Levenshtein distance between ABCD and BED is 2.
Functions
Performance
Tests
Benchmark
Since
levenshteinDistance()
O(nm)
✔️
✔️
0.0.9
levenshteinDistanceOf()
O(nm)
✔️
✔️
0.0.9
Here, n and m are the length of first and second string respectively.
Damerau-Levenshtein Distance
⭐ 200% faster than edit_distance.Damerau().distance()
Damerau–Levenshtein distance is a variation of Lavenshtein distance which permits transposition of two adjacent characters along with insertion, deletion and substitution. e.g.: The Damerau-Levenshtein distance between CA and ABC is 2.
Functions
Performance
Tests
Benchmark
Since
damerauLevenshteinDistance()
O(nmlog k)
✔️
✔️
0.0.10
damerauLevenshteinDistanceOf()
O(nmlog k)
✔️
✔️
0.0.10
Here, n and m are the length of first and second string respectively and k is number of unique characters appearing in both string.
⭐ 1000% faster than edit_distance.Damerau().distance()
The Damerau–Levenshtein distance can be restricted with a condition that no substring can be edited more than once, which simplifies the implementation of transposition lookup. This distance is also known as Optimal String Alignment distance. e.g.: The restricted Damerau-Levenshtein edit distance between CA and ABC is 3.
Functions
Performance
Tests
Benchmark
Since
restrictedDamerauDistance()
O(nm)
✔️
✔️
0.0.10
restrictedDamerauDistanceOf()
O(nm)
✔️
✔️
0.0.10
Here, n and m are the length of first and second string respectively.
Jaro similarity & Jaro-Winkler distance
The Jaro similarity between two strings is the weighted sum of percentage of matched characters from each string and transposed characters. Winkler increased this measure for matching initial characters.
Functions
Performance
Tests
Benchmark
Since
jaroSimilarity()
O(nm)
✔️
✔️
0.0.10
jaroSimilarityOf()
O(nm)
✔️
✔️
0.0.10
jaroWinklerSimilarity()
O(nm)
✔️
✔️
0.0.10
jaroWinklerSimilarityOf()
O(nm)
✔️
✔️
0.0.10
Here, n and m are the length of first and second string respectively.
Hamming Distance
Hamming distance between two equal-length strings is the number of positions at which the characters differs. In this implementation, if two strings are not equal, the shorter string is padded to match the longer ones.
Functions
Performance
Tests
Benchmark
Since
hammingDistance()
O(n)
✔️
➖
0.0.10
hammingDistanceOf()
O(n)
✔️
➖
0.0.10
Lee Distance
Lee distance can only be calculated between two equal-length strings.
Functions
Performance
Tests
Benchmark
Since
leeDistance()
O(n)
✔️
➖
0.0.10
leeDistanceOf()
O(n)
✔️
➖
0.0.10
Longest Common Subsequence Length
⭐ 200% faster than edit_distance.LongestCommonSubsequence().distance()
Longest common substrings and longest common subsequences are not the same. Unlike substrings, subsequences are not required to occupy consecutive positions.
Functions
Performance
Tests
Benchmark
Since
longestCommonSubsequenceLength()
O(nm)
✔️
✔️
0.0.10
longestCommonSubsequenceLengthOf()
O(nm)
✔️
✔️
0.0.10
Here, n and m are the length of first and second string respectively.
Jaccard index / Tanimoto coefficient
⭐ 150% faster than edit_distance.LongestCommonSubsequence().distance()
Jaccard index is a metric used to measure similarity of two samples sets.
The complement of it is Jaccard distance which measures the total number of items that is present in one list but not the other.