PackageTrack
Sign in Get early access

algokit

A versatile Dart algorithms library providing implementations of various algorithms..

1.1.0 vijaykarthiktk/algokit

What this package is like to depend on

Last release 1 years ago

06 Mar 2025

Too new to tell

only 2 release windows

Nearly every release is documented

notes for 6 of 6 stable releases

Nothing withdrawn

no release was ever pulled

2 years old

6 releases · first in 2025

0 releases in the last 12 months

see the full history below

Release timeline

6 releases · Feb 2025 to Mar 2025
2026
Release Pre-release

Releases

latest 6
  1. 1.1.0 06 Mar 2025
    Release notes
    • Added Queue implementation with standard operations (enqueue, dequeue, peek)
    • Added Stack implementation with standard operations (push, pop, peek)
    • Added LinkedList implementation with basic operations (insert, delete, traverse)
    • Comprehensive test coverage for Queue, Stack, and LinkedList operations
    Open source →
  2. 1.0.4 12 Feb 2025
    Release notes

    Data Structures:

    • Added Complex Number implementation with basic arithmetic operations (addition, subtraction, multiplication, division)
    • Support for complex number comparisons and conversions
    • Comprehensive test coverage for complex number operations
    Open source →
  3. 1.0.3 12 Feb 2025
    Release notes

    Sorting:

    • Shell Sort implementation with O(n log n) best case, O(n²) worst case time complexity
    Open source →
  4. 1.0.2 11 Feb 2025
    Release notes

    Sorting:

    • Insertion Sort implementation with O(n²) time complexity
    • Heap Sort implementation with O(n log n) time complexity

    Searching:

    • Interpolation Search implementation with O(log log n) time complexity for uniformly distributed data
    Open source →
  5. 1.0.1 11 Feb 2025
    Release notes
    • Selection Sort implementation with O(n²) time complexity
    Open source →
  6. 1.0.0 11 Feb 2025
    Release notes

    Sorting Algorithms:

    • Bubble Sort implementation with O(n²) time complexity
    • Merge Sort implementation with O(n log n) time complexity
    • Quick Sort implementation with O(n log n) average time complexity

    Searching Algorithms:

    • Binary Search implementation with O(log n) time complexity
    • Linear Search implementation with O(n) time complexity
    • Jump Search implementation with O(√n) time complexity

    Example Files:

    • Added example implementations for all sorting algorithms
    • Added example implementations for all searching algorithms

    Test Cases:

    • Comprehensive test coverage for all implemented algorithms
    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