• Stars
    star
    1,865
  • Rank 24,853 (Top 0.5 %)
  • Language
    Dart
  • License
    MIT License
  • Created over 5 years ago
  • Updated 7 months ago

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

All Algorithms implemented in Dart

The Algorithms - Dart

Build Status Donate   Discord chat   Gitter chat

All algorithms implemented in Dart (for education)

These implementations are for learning purposes. They may be less efficient than the implementations in the Dart standard library.

List of Algorithms

See our directory for full list of all algorithms. A few of the algorithms (the most common ones) are explained here.

Search Algorithms

Linear

alt text

From Wikipedia: linear search or sequential search is a method for finding a target value within a list. It sequentially checks each element of the list for the target value until a match is found or until all the elements have been searched. Linear search runs in at the worst linear time and makes at most n comparisons, where n is the length of the list.

Properties

  • Worst case performance O(n)
  • Best case performance O(1)
  • Average case performance O(n)
  • Worst case space complexity O(1) iterative

Binary

alt text

From Wikipedia: Binary search, also known as half-interval search or logarithmic search, is a search algorithm that finds the position of a target value within a sorted array. It compares the target value to the middle element of the array; if they are unequal, the half in which the target cannot lie is eliminated and the search continues on the remaining half until it is successful.

Properties

  • Worst case performance O(log n)
  • Best case performance O(1)
  • Average case performance O(log n)
  • Worst case space complexity O(1)

Sort Algorithms

Bubble

alt text

From Wikipedia: Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted.

Properties

  • Worst case performance O(n^2)
  • Best case performance O(n)
  • Average case performance O(n^2)
View the algorithm in action

Insertion

alt text

From Wikipedia: Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.

Properties

  • Worst case performance O(n^2)
  • Best case performance O(n)
  • Average case performance O(n^2)
View the algorithm in action

Quick

alt text

From Wikipedia: Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order.

Properties

  • Worst case performance O(n^2)
  • Best case performance O(n log n) or O(n) with three-way partition
  • Average case performance O(n^2)
View the algorithm in action

Selection

alt text

From Wikipedia: The algorithm divides the input list into two parts: the sublist of items already sorted, which is built up from left to right at the front (left) of the list, and the sublist of items remaining to be sorted that occupy the rest of the list. Initially, the sorted sublist is empty and the unsorted sublist is the entire input list. The algorithm proceeds by finding the smallest (or largest, depending on sorting order) element in the unsorted sublist, exchanging (swapping) it with the leftmost unsorted element (putting it in sorted order), and moving the sublist boundaries one element to the right.

Properties

  • Worst case performance O(n^2)
  • Best case performance O(n^2)
  • Average case performance O(n^2)
View the algorithm in action

Merge

alt text

From Wikipedia: Merge sort (also commonly spelled mergesort) is a divide and conquer algorithm that was invented by John von Neumann in 1945. The algorithm dirst divides the list into the smallest unit (1 element), then compares each element with the adjacent list to sort and merge the two adjacent lists. Finally all the elements are sorted and merged. It is an efficient, general-purpose, comparison-based sorting algorithm.

Properties

  • Worst case performance O(n log n)
  • Best case performance O(n log n)
  • Average case performance O(n log n)
View the algorithm in action

Shell

alt text

From Wikipedia: Shellsort is a generalization of insertion sort that allows the exchange of items that are far apart. The idea is to arrange the list of elements so that, starting anywhere, considering every nth element gives a sorted list. Such a list is said to be h-sorted. Equivalently, it can be thought of as h interleaved lists, each individually sorted.

Properties

  • Worst case performance O(nlog2 2n)
  • Best case performance O(n log n)
  • Average case performance depends on gap sequence
View the algorithm in action

Time-Complexity Graphs

Comparing the complexity of sorting algorithms (Bubble Sort, Insertion Sort, Selection Sort)

Complexity Graphs


Community Channel

We're on Gitter! Please join us.

Contribution

Please read our CONTRIBUTING.md.

License

MIT

More Repositories

1

Python

All Algorithms implemented in Python
Python
193,522
star
2

Java

All Algorithms implemented in Java
Java
58,698
star
3

JavaScript

Algorithms and Data Structures implemented in JavaScript for beginners, following best practices.
JavaScript
32,052
star
4

C-Plus-Plus

Collection of various algorithms in mathematics, machine learning, computer science and physics implemented in C++ for educational purposes.
C++
30,445
star
5

Rust

All Algorithms implemented in Rust
Rust
22,144
star
6

C

Collection of various algorithms in mathematics, machine learning, computer science, physics, etc implemented in C for educational purposes.
C
19,092
star
7

Go

Algorithms and Data Structures implemented in Go for beginners, following best practices.
Go
15,840
star
8

C-Sharp

All algorithms implemented in C#.
C#
7,097
star
9

Algorithms-Explanation

Popular algorithms explained in simple language with examples and links to their implementation in various programming languages and other required resources.
3,019
star
10

PHP

All Algorithms implemented in PHP
PHP
1,803
star
11

Kotlin

All Algorithms implemented in Kotlin
Kotlin
1,362
star
12

TypeScript

Algorithms and Data Structures implemented in TypeScript for beginners, following best practices.
TypeScript
1,328
star
13

Ruby

All algorithms implemented in Ruby
Ruby
1,145
star
14

Scala

All Algorithms implemented in Scala
Scala
1,066
star
15

TheAlgorithms.github.io

This website is deprecated. The new website is https://the-algorithms.com. You can see the old website by going to https://thealgorithms.github.io/index-old.html
HTML
869
star
16

R

Collection of various algorithms implemented in R.
R
840
star
17

website

The Algorithms website providing GitHub's largest open-source algorithm library.
TypeScript
827
star
18

Jupyter

The repository contains script and notebook related to Statistics, Machine learning, Neural network, Deep learning, NLP, Numerical methods, and Automation.
Jupyter Notebook
768
star
19

Swift

All Algorithms implemented in Swift
Swift
457
star
20

Julia

Algorithms implemented in the Julia programming language. We're collaborating with the Humans of Julia community!
Julia
433
star
21

Haskell

Haskell
374
star
22

MATLAB-Octave

This repository contains algorithms written in MATLAB/Octave. Developing algorithms in the MATLAB environment empowers you to explore and refine ideas, and enables you test and verify your algorithm.
MATLAB
367
star
23

Solidity

Algorithms and data structures implemented in Solidity
Solidity
327
star
24

Lua

Algorithms and Data Structures implemented in the Lua programming language
Lua
265
star
25

Elixir

Elixir
228
star
26

F-Sharp

All Algorithms implemented in F#
F#
206
star
27

website-old

This website is no longer maintained. Please see https://github.com/TheAlgorithms/website
HTML
200
star
28

.github

Default configuration for @TheAlgorithms repositories
183
star
29

algorithms-keeper

A bot for TheAlgorithms/Python repository.
Python
155
star
30

AArch64_Assembly

All Algorithms implemented in AArch64 Assembly
Assembly
136
star
31

Zig

Collection of Algorithms implemented in Zig.
Zig
125
star
32

OCaml

Algorithms Implemented in OCaml
OCaml
91
star
33

Clojure

All Algorithms implemented in Clojure
Clojure
87
star
34

Nim

Collection of various algorithms implemented in Nim for educational purposes.
Nim
79
star
35

scripts

Scripts used across all The Algorithms repositories
Python
76
star
36

Elm

All Algorithms implemented in Elm
Elm
64
star
37

Fortran

All Algorithms implemented in Fortran. Making Fortran Great Again!
Fortran
37
star
38

Google-Summer-of-Code

Organization resources for Google Summer of Code '23
31
star
39

Mojo

All algorithms implemented in Mojo. (The first open-sourced Mojo repository on GitHub)
Mojo
26
star
40

Jule

Algorithms and data structures implemented in the Jule programming language.
17
star
41

Zig-delete

All Algorithms implemented in Zig
12
star
42

SessionGuard.js

https://github.com/TheAlgorithms/Google-Summer-of-Code/blob/main/project_ideas/AnomalousSessionRecorder.md
7
star
43

Personalised-Discounts

https://github.com/TheAlgorithms/Google-Summer-of-Code/blob/main/project_ideas/PersonalisedDiscounts.md
3
star
44

SessionGuard-Core

https://github.com/TheAlgorithms/Google-Summer-of-Code/blob/main/project_ideas/AnomalousSessionRecorder.md
3
star
45

EcomEntity

https://github.com/TheAlgorithms/Google-Summer-of-Code/blob/main/project_ideas/NamedEntityRecognitionForEcommerceSearchQueries.md
2
star