PackageTrack
Sign in Get early access

algorithmic

A collection of useful algorithms keeping performance and flexibility on mind.

0.0.11 dipu-bd/algorithmic

What this package is like to depend on

Last release 4 years ago

no release in 18 months

Ships unpredictably

gaps range from 9 days to 11 months

Nearly every release is documented

notes for 11 of 11 stable releases

Nothing withdrawn

no release was ever pulled

5 years old

11 releases · first in 2021

0 releases in the last 12 months

see the full history below

Release timeline

11 releases · Dec 2021 to Dec 2022
2022 2023 2024 2025 2026
Release Pre-release

Releases

latest 11
  1. 0.0.11 03 Dec 2022
    Release notes
    • Fixes dartdoc issues
    • Move string metrics to algorithmic.string.metrics library
    Open source →
  2. 0.0.10 03 Dec 2022
    Release notes
    • New algorithms:
      • damerauLevenshteinDistance
      • damerauLevenshteinDistanceOf
      • restrictedDamerauDistance
      • restrictedDamerauDistanceOf
      • hammingDistance
      • hammingDistanceOf
      • leeDistance
      • leeDistanceOf
      • longestCommonSubsequenceLength
      • longestCommonSubsequenceLengthOf
      • tverskyIndex
      • tverskyIndexOf
      • diceIndex
      • diceIndexOf
      • jaccardIndex
      • jaccardIndexOf
      • jaccardDistance
      • jaccardDistanceOf
    • Update documentations, test and benchmarks.
    Open source →
  3. 0.0.9 11 Jan 2022
    Release notes
    • New algorithms:
      • countingSort
      • countingSortOf
      • radixSort
      • radixSortOf
      • levenshteinDistance
      • levenshteinDistanceOf
    Open source →
  4. 0.0.8 17 Dec 2021
    Release notes
    • New algorithms:
      • mergeSort
      • combSort
      • cocktailShakerSort
    • Refactor exports
    • Performance improvements
    Open source →
  5. 0.0.7 12 Dec 2021
    Release notes
    • New algorithms:
      • quickSortHaore
    • Performance improvement:
      • Removes final from function parameters.
      • Pre-declare all variables.
    Open source →
  6. 0.0.6 10 Dec 2021
    Release notes
    • New algorithms:
      • binarySearchQuick
      • quickSortLomuto
      • gnomeSort
    • Changes algorithms:
      • binarySearchUpper: renamed from binarySearchMax
    Open source →
  7. 0.0.5 09 Dec 2021
    Release notes
    • Adds sorting algorithms:
      • bubbleSort
      • insertionSort
      • selectionSort
    • Refactor binary searching to improve performance.
      • lowerBound: parameter change
      • lowerBoundBy: removed (merged with lowerBound)
    Open source →
  8. 0.0.4 08 Dec 2021
    Release notes
    • Refactor linear searching for better flexibility and performance. Modified methods are:
      • linearSearch: parameter change
      • linearSearchReversed: parameter change
      • linearSearchBy: new
      • linearSearchReversedBy: new
    • Refactor binary searching for better flexibility and performance. Modified methods are:
      • lowerBound: parameter change
      • upperBound: parameter change
      • lowerBoundBy: new
      • upperBoundBy: new
      • binarySearchMax: instead of binarySearchReversed
    Open source →
  9. 0.0.3 07 Dec 2021
    Release notes
    • Update linear search method documentation.
    • Implements binary searching algorithms:
      • lowerBound
      • upperBound
      • binarySearch
      • binarySearchReversed
    Open source →
  10. 0.0.2 07 Dec 2021
    Release notes
    • Add benchmarking and organize examples.
    • Improves runtime for linear searching.
    Open source →
  11. 0.0.1 07 Dec 2021
    Release notes
    • Implements linear searching algorithms:
      • linearSearch
      • linearSearchReversed
    Open source →

Every package, every release, already written down.

The archive is open and free. Watching your own project is what we are building next.

Browse the archive