algorithmic
0.0.11, released 4 years ago by an unverified publisher
A collection of searching, sorting, and string metric algorithms.
What it does
Provides various sorting algorithms (such as bubble sort, merge sort, quick sort), searching algorithms (binary and linear search variants), and string metric algorithms (like Levenshtein distance, Jaccard index, and Hamming distance).
AI-written summary of version 0.0.11, based on the package's README and metadata. Report an inaccuracy
Use it when
- You need standard computer science algorithms like sorting or binary search in Dart.
- You require string similarity or distance metrics like Levenshtein or Jaccard index.
- You want performance-optimized algorithmic implementations.
Skip it when
- You are dealing with high-level app state or UI components.
- You require standard library collections that already satisfy your requirements.
Strengths
- Includes benchmarks and tests for its algorithms.
- Wide range of sorting, searching, and string distance metrics.
- Zero external dependencies.
Weaknesses
- Very narrow scope focused strictly on basic algorithms.
- No UI or platform-specific utility support.
Setup
- Kind
- Pure Dart
- Effort
- Low
- Code generation
- No
- Direct dependencies
- 0
import 'package:algorithmic/algorithmic.dart';
void main() {
final list = [1, 2, 3, 4, 5];
final index = binarySearch(list, 3);
}Alternatives
Packages that do the same job and could replace algorithmic.
- weak_map
A map whose keys are weakly held, and cache functions for memoization.
80Compare - data
Time and space efficient data structures and algorithms for vectors, matrices, and math.
72Compare - swiss_knife
Collection of Dart utility tools for collections, math, date, URI, JSON, events, and resources.
72Compare - comprehensive_utils
A collection of performance-oriented tools, widgets, stream helpers, and numeric types.
63Compare
Works with
Packages commonly used together with algorithmic: ones it builds on, ones built on it, and its own family.