{"id":21542290,"url":"https://github.com/allalgorithms/algorithms","last_synced_at":"2025-04-10T01:10:29.501Z","repository":{"id":41831664,"uuid":"149230474","full_name":"AllAlgorithms/algorithms","owner":"AllAlgorithms","description":"The All ▲lgorithms documentation website.","archived":false,"fork":false,"pushed_at":"2023-09-27T14:32:06.000Z","size":1127,"stargazers_count":164,"open_issues_count":8,"forks_count":59,"subscribers_count":14,"default_branch":"master","last_synced_at":"2025-04-02T22:07:44.639Z","etag":null,"topics":["algorithms","allalgorithms","bit-manipulation","c","clustering","cpp","csharp","game-theory","go","greedy-algorithm","hacktoberfest","java","javascript","numerical-analysis","python","ruby","selection-algorithm","sort","sorting-algorithms","swift"],"latest_commit_sha":null,"homepage":"https://allalgorithms.com/","language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/AllAlgorithms.png","metadata":{"files":{"readme":"readme.md","changelog":null,"contributing":".github/contributing.md","funding":null,"license":"license","code_of_conduct":".github/code-of-conduct.md","threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2018-09-18T04:47:08.000Z","updated_at":"2025-03-13T13:38:01.000Z","dependencies_parsed_at":"2025-02-10T00:10:38.532Z","dependency_job_id":"42366564-bc1a-42b6-801c-c5250c6b4b04","html_url":"https://github.com/AllAlgorithms/algorithms","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AllAlgorithms%2Falgorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AllAlgorithms%2Falgorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AllAlgorithms%2Falgorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AllAlgorithms%2Falgorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/AllAlgorithms","download_url":"https://codeload.github.com/AllAlgorithms/algorithms/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248137886,"owners_count":21053775,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","allalgorithms","bit-manipulation","c","clustering","cpp","csharp","game-theory","go","greedy-algorithm","hacktoberfest","java","javascript","numerical-analysis","python","ruby","selection-algorithm","sort","sorting-algorithms","swift"],"created_at":"2024-11-24T05:09:10.107Z","updated_at":"2025-04-10T01:10:29.484Z","avatar_url":"https://github.com/AllAlgorithms.png","language":"JavaScript","readme":"\u003cdiv align=\"center\" id=\"top\"\u003e\n\t\u003cbr\u003e\n\t\u003cbr\u003e\n\t\u003cbr\u003e\n\t\u003cbr\u003e\n\t\u003cimg width=\"500\" height=\"350\" src=\"https://cdn.abranhe.com/projects/algorithms/logo.svg\" alt=\"Algorithms Logo\"\u003e\n\t\u003cbr\u003e\n\t\u003cbr\u003e\n\t\u003cbr\u003e\n\t\u003cbr\u003e\n\t\u003cbr\u003e\n\t\u003cbr\u003e\n\n\u003cp\u003e\n\t\u003ca href=\"#what-is-an-algorithm\"\u003eWhat is an algorithm?\u003c/a\u003e\u0026nbsp;\u0026nbsp;\u0026nbsp;\n\t\u003ca href=\"https://github.com/AllAlgorithms/algorithms/blob/master/.github/contributing.md\"\u003eContributing\u003c/a\u003e\u0026nbsp;\u0026nbsp;\u0026nbsp;\n\t\u003ca href=\"https://www.redbubble.com/people/abranhe/works/34285088\"\u003eStickers \u0026 T-Shirts\u003c/a\u003e\n\u003c/p\u003e\n\n\n\u003cp\u003e\n\u003ca href=\"https://twitter.com/AllAlgorithms\"\u003e\n  \u003cimg src=\"https://cdn.svgporn.com/logos/twitter.svg\" width=\"17px\"\u003e Twitter\n\u003c/a\u003e\u0026nbsp;\u0026nbsp;\u0026nbsp;\n\u003ca href=\"https://instagram.com/AllAlgorithms\"\u003e\n  \u003cimg src=\"https://www.instagram.com/static/images/ico/apple-touch-icon-152x152-precomposed.png/419a6f9c7454.png\" width=\"17px\"\u003e Instagram\n\u003c/a\u003e\u0026nbsp;\u0026nbsp;\u0026nbsp;\n\u003ca href=\"https://github.com/AllAlgorithms\"\u003e\n  \u003cimg src=\"https://img.icons8.com/ios-glyphs/90/333333/github.png\" width=\"18px\"\u003e Github\n\u003c/a\u003e\u0026nbsp;\u0026nbsp;\u0026nbsp;\n\u003c/p\u003e\n\n\u003cbr\u003e\n\u003cp align=\"center\"\u003e\n  \u003ci\u003eHuge collection of All ▲lgorithms implemented in multiple languages\u003c/i\u003e\n\u003c/p\u003e\n\u003cbr\u003e\n\n\u003ca href=\"https://github.com/AllAlgorithms\"\u003e\u003cimg src=\"https://cdn.abranhe.com/projects/algorithms/badge.svg\" /\u003e\u003c/a\u003e\n\u003ca href=\"https://cash.me/$abranhe\"\u003e\u003cimg src=\"https://cdn.abranhe.com/badges/cash-me.svg\"\u003e\u003c/a\u003e\n\u003ca href=\"https://paypal.me/abranhe/10\"\u003e\u003cimg src=\"https://cdn.abranhe.com/badges/paypal.svg\"\u003e\u003c/a\u003e\n\u003ca href=\"https://patreon.com/abranhe\"\u003e\u003cimg src=\"https://cdn.abranhe.com/badges/patreon.svg\" /\u003e\u003c/a\u003e\n\n\u003c/div\u003e\n\n## See\n\n- [What is an algorithm](#what-is-an-algorithm)\n- [Contributing](https://github.com/AllAlgorithms/algorithms/blob/master/.github/contributing.md)\n- [Code of Conduct](https://github.com/AllAlgorithms/algorithms/blob/master/.github/code-of-conduct.md)\n- [Stickers and T-Shirts](https://www.redbubble.com/people/abranhe/works/34285088)\n- [Twitter](https://twitter.com/AllAlgorithms)\n- [Instagram](https://instagram.com/AllAlgorithms)\n- [Algorithms Categories](#categories)\n- [Maintainers](#maintainers)\n- [License](#license)\n\n\n## What is an algorithm?\n\nInformally, an algorithm is any well-defined computational procedure that takes\nsome value, or set of values, as input and produces some value, or set of values, as\noutput. An algorithm is thus a sequence of computational steps that transform the\ninput into the output.\n\nAn algorithm should have three important characteristics to be considered valid:\n\n- **It should be finite**: If your algorithm never ends trying to solve the problem\nit was designed to solve then it is useless\n- **It should have well defined instructions**: Each step of the algorithm has to\nbe precisely defined; the instructions should be unambiguously specified for each case.\n- **It should be effective**: The algorithm should solve the problem it was designed\nto solve. And it should be possible to demonstrate that the algorithm converges with\njust a paper and pencil.\n\n## Categories\n\n\u003e Structure of The All ▲lgoritms project\n\n- [Artificial Intelligence](#artificial-intelligence)\n- [Backtracking](#backtracking)\n- [Bit Manipulation](#bit-manipulation)\n- [Cellular Automaton](#cellular-automaton)\n- [Ciphers](#ciphers)\n- [Computational Geometry](#computational-geometry)\n- [Cryptography](#cryptography)\n- [Data Structures](#data-structures)\n- [Divide and conquer](#divide-and-conquer)\n- [Dynamic Programming](#dynamic-programming)\n- [Gaming Theory](#gaming-theory)\n- [Graphs](#graphs)\n- [Greedy Algorithms](#greedy-algorithms)\n- [Math](#math)\n- [Networking](#networking)\n- [Numerical Analysis](#numerical-analysis)\n- [Operating system](#operating-system)\n- [Randomized Algorithms](#randomized-algorithms)\n- [Searches](#searches)\n- [Selections Algorithms](#selections-algorithms)\n- [Sorting](#sorting)\n- [Strings](#strings)\n- [Online Challenges](#online-challenges)\n- [Others](#others)\n\n\n## Artificial Intelligence\n\n- [Dbscan](https://allalgorithms.com/docs/dbscan)\n- [Isodata](https://allalgorithms.com/docs/isodata)\n- [Linear regression](https://allalgorithms.com/docs/linear-regression)\n- [Logistic regression](https://allalgorithms.com/docs/logistic-regression)\n- [Neutral style transfer](https://allalgorithms.com/docs/neutral-style-transfer)\n- [Boolean satisfiability problem](https://allalgorithms.com/docs/sat)\n- [Tsp](https://allalgorithms.com/docs/tsp)\n- [A star](https://allalgorithms.com/docs/a-star)\n- [Artificial neutral network](https://allalgorithms.com/docs/artificial-neutral-network)\n- [Convolutional neutral network](https://allalgorithms.com/docs/convolutional-neutral-network)\n- [Decision tree](https://allalgorithms.com/docs/decision-tree)\n- [Factorization machines](https://allalgorithms.com/docs/factorization-machines)\n- [Gaussian mixtrue model](https://allalgorithms.com/docs/gaussian-mixtrue-model)\n- [Gradient boostring trees](https://allalgorithms.com/docs/gradient-boostring-trees)\n- [Hierachical clustering](https://allalgorithms.com/docs/hierachical-clustering)\n- [Image processing](https://allalgorithms.com/docs/image-processing)\n- [K nearest neighbors](https://allalgorithms.com/docs/k-nearest-neighbors)\n- [K means](https://allalgorithms.com/docs/k-means)\n- [Minimax](https://allalgorithms.com/docs/minimax)\n- [Native bayes](https://allalgorithms.com/docs/native-bayes)\n- [Nearest sequence memory](https://allalgorithms.com/docs/nearest-sequence-memory)\n- [Neutral network](https://allalgorithms.com/docs/neutral-network)\n- [Perceptron](https://allalgorithms.com/docs/perceptron)\n- [Principal component analysis](https://allalgorithms.com/docs/principal-component-analysis)\n- [Q learning](https://allalgorithms.com/docs/q-learning)\n- [Random forest](https://allalgorithms.com/docs/random-forest)\n- [Restricted boltzman machine](https://allalgorithms.com/docs/restricted-boltzman-machine)\n\n## Backtracking\n\n- [Algorithm x](https://allalgorithms.com/docs/algorithm-x)\n- [Crossword Puzzle](https://allalgorithms.com/docs/crossword-puzzle)\n- [Knight tour](https://allalgorithms.com/docs/knight-tour)\n- [M coloring problem](https://allalgorithms.com/docs/m-coloring-problem)\n- [N queen](https://allalgorithms.com/docs/n-queen)\n- [Number of ways in maze](https://allalgorithms.com/docs/number-of-ways-in-maze)\n- [Partitions of set](https://allalgorithms.com/docs/partitions-of-set)\n- [Permutation of strings](https://allalgorithms.com/docs/permutation-of-strings)\n- [Powerset](https://allalgorithms.com/docs/powerset)\n- [Rat in maze](https://allalgorithms.com/docs/rat-in-maze)\n- [Subset sum](https://allalgorithms.com/docs/subset-sum)\n- [Sudoku solve](https://allalgorithms.com/docs/sudoku-solve)\n\n## Bit manipulation\n\n- [Adding using bits](https://allalgorithms.com/docs/adding-using-bits)\n- [Bit divisor](https://allalgorithms.com/docs/bit-divisor)\n- [Byte swapper](https://allalgorithms.com/docs/byte-swapper)\n- [Convert numbers to binary](https://allalgorithms.com/docs/convert-numbers-to-binary)\n- [Count set bits](https://allalgorithms.com/docs/count-set-bits)\n- [Flip bits](https://allalgorithms.com/docs/flip-bits)\n- [Hamming distace](https://allalgorithms.com/docs/hamming-distace)\n- [Invert bit](https://allalgorithms.com/docs/invert-bit)\n- [Lonely integer](https://allalgorithms.com/docs/lonely-integer)\n- [Magic number](https://allalgorithms.com/docs/magic-number)\n- [Maximun xor value](https://allalgorithms.com/docs/maximun-xor-value)\n- [Power of 2](https://allalgorithms.com/docs/power-of-2)\n- [Subset generation](https://allalgorithms.com/docs/subset-generation)\n- [Sum binary numbers](https://allalgorithms.com/docs/sum-binary-numbers)\n- [Sum equals xor](https://allalgorithms.com/docs/sum-equals-xor)\n- [Thrice unique number](https://allalgorithms.com/docs/thrice-unique-number)\n- [Twice unique number](https://allalgorithms.com/docs/twice-unique-number)\n- [Xor swap](https://allalgorithms.com/docs/xor-swap)\n\n## Cellular automaton\n\n- [Brians brain](https://allalgorithms.com/docs/brians-brain)\n- [Conways game of life](https://allalgorithms.com/docs/conways-game-of-life)\n- [Elementary cellular automata](https://allalgorithms.com/docs/elementary-cellular-automata)\n- [Generic algorithm](https://allalgorithms.com/docs/generic-algorithm)\n- [Langtons ant](https://allalgorithms.com/docs/langtons-ant)\n- [Nobili cellular automata](https://allalgorithms.com/docs/nobili-cellular-automata)\n- [Von neoumann cellular automata](https://allalgorithms.com/docs/von-neoumann-cellular-automata)\n\n## Computational geometry\n\n- [2d line intersection](https://allalgorithms.com/docs/2d-line-intersection)\n- [2d separating axis test](https://allalgorithms.com/docs/2d-separating-axis-test)\n- [Area of polygon](https://allalgorithms.com/docs/area-of-polygon)\n- [Area of triangle](https://allalgorithms.com/docs/area-of-triangle)\n- [Axis aligned bounding box collision](https://allalgorithms.com/docs/axis-aligned-bounding-box-collision)\n- [Bresenham line](https://allalgorithms.com/docs/bresenham-line)\n- [Chans algorithm](https://allalgorithms.com/docs/chans-algorithm)\n- [Cohen-Sutherland lineclip](https://allalgorithms.com/docs/cohen-sutherland-lineclip)\n- [Distance between points](https://allalgorithms.com/docs/distance-between-points)\n- [Graham scan](https://allalgorithms.com/docs/graham-scan)\n- [Halfplane intersection](https://allalgorithms.com/docs/halfplane-intersection)\n- [Jarvis march](https://allalgorithms.com/docs/jarvis-march)\n- [Quickhull](https://allalgorithms.com/docs/quickhull)\n- [Sphere tetrahedron intersection](https://allalgorithms.com/docs/sphere-tetrahedron-intersection)\n- [Sutherland-Hodgman clipping](https://allalgorithms.com/docs/sutherland-hodgman-clipping)\n\n## Cryptography\n\n- [Affine cipher](https://allalgorithms.com/docs/affine-cipher)\n- [Atbash cipher](https://allalgorithms.com/docs/atbash-cipher)\n- [Autokey cipher](https://allalgorithms.com/docs/autokey-cipher)\n- [Baconian cipher](https://allalgorithms.com/docs/baconian-cipher)\n- [Caesar cipher](https://allalgorithms.com/docs/caesar-cipher)\n- [Colummnar cipher](https://allalgorithms.com/docs/colummnar-cipher)\n- [Vigenere cipher](https://allalgorithms.com/docs/vigenere-cipher)\n\n## Data structures\n\n- [Bag](https://allalgorithms.com/docs/bag)\n- [Hashes](https://allalgorithms.com/docs/hashes)\n- [Linked list](https://allalgorithms.com/docs/linked-list)\n- [List](https://allalgorithms.com/docs/list)\n- [Queue](https://allalgorithms.com/docs/queue)\n- [Stack](https://allalgorithms.com/docs/stack)\n- [Tree](https://allalgorithms.com/docs/tree)\n\n## Divide and conquer\n\n- [Strassen matrix manipulation](https://allalgorithms.com/docs/strassen-matrix-manipulation)\n- [Closest pair of point](https://allalgorithms.com/docs/closest-pair-of-point)\n- [Inversion count](https://allalgorithms.com/docs/inversion-count)\n- [Karatsuba multiplication](https://allalgorithms.com/docs/karatsuba-multiplication)\n- [Maximum contiguous subsequence sum](https://allalgorithms.com/docs/maximum-contiguous-subsequence-sum)\n- [Merge sort using divide and conquer](https://allalgorithms.com/docs/merge-sort-using-divide-and-conquer)\n- [Quick sort using divide and conquer](https://allalgorithms.com/docs/quick-sort-using-divide-and-conquer)\n- [Tournament method to find min max](https://allalgorithms.com/docs/tournament-method-to-find-min-max)\n- [Warnock algorithm](https://allalgorithms.com/docs/warnock-algorithm)\n- [X power y](https://allalgorithms.com/docs/x-power-y)\n\n## Dynamic programming\n\n- [Array median](https://allalgorithms.com/docs/array-median)\n- [Optima binary search tree](https://allalgorithms.com/docs/optima-binary-search-tree)\n- [Binomial coefficient](https://allalgorithms.com/docs/binomial-coefficient)\n\n## Gaming theory\n\n- [Nim next best move game](https://allalgorithms.com/docs/nim-next-best-move-game)\n- [Nim win loss game](https://allalgorithms.com/docs/nim-win-loss-game)\n- [Grundy numbers kayle game](https://allalgorithms.com/docs/grundy-numbers-kayle-game)\n\n## Graphs\n\n- [Bipartite check](https://allalgorithms.com/docs/bipartite-check)\n- [Adjacency lists graphs representation](https://allalgorithms.com/docs/adjacency-lists-graphs-representation)\n\n## Greedy algorithms\n\n- [Activity selection](https://allalgorithms.com/docs/activity-selection)\n- [Dijkstra shortest path](https://allalgorithms.com/docs/dijkstra-shortest-path)\n- [Egyptian fraction](https://allalgorithms.com/docs/egyptian-fraction)\n\n## Math\n\n- [2 sum](https://allalgorithms.com/docs/2-sum)\n- [Add polynomials](https://allalgorithms.com/docs/add-polynomials)\n- [Amicable numbers](https://allalgorithms.com/docs/amicable-numbers)\n- [Armstrong numbers](https://allalgorithms.com/docs/armstrong-numbers)\n- [Automorphic numbers](https://allalgorithms.com/docs/automorphic-numbers)\n- [Average stream numbers](https://allalgorithms.com/docs/average-stream-numbers)\n- [Babylonian method](https://allalgorithms.com/docs/babylonian-method)\n- [Binomial coefficient](https://allalgorithms.com/docs/binomial-coefficient)\n- [Catalan number](https://allalgorithms.com/docs/catalan-number)\n- [Check is square](https://allalgorithms.com/docs/check-is-square)\n- [Convolution](https://allalgorithms.com/docs/convolution)\n- [Coprime numbers](https://allalgorithms.com/docs/coprime-numbers)\n- [Count digits](https://allalgorithms.com/docs/count-digits)\n- [Count trailing zeroes](https://allalgorithms.com/docs/count-trailing-zeroes)\n- [Decoding of string](https://allalgorithms.com/docs/decoding-of-string)\n- [Delannoy number](https://allalgorithms.com/docs/delannoy-number)\n- [Derangements](https://allalgorithms.com/docs/derangements)\n- [Dfa division](https://allalgorithms.com/docs/dfa-division)\n- [Diophantine](https://allalgorithms.com/docs/diophantine)\n- [Divided differences](https://allalgorithms.com/docs/divided-differences)\n- [Euler totient](https://allalgorithms.com/docs/euler-totient)\n- [Exponentiation power](https://allalgorithms.com/docs/exponentiation-power)\n- [Factorial](https://allalgorithms.com/docs/factorial)\n- [Fast Fourier Transform](https://allalgorithms.com/docs/fast-fourier-transform)\n- [Fast inverse square root](https://allalgorithms.com/docs/fast-inverse-square-root)\n\n## Networking\n\n- [Packet sniffer](https://allalgorithms.com/docs/packet-sniffer)\n- [Determine endianess](https://allalgorithms.com/docs/determine-endianess)\n- [Validate ip](https://allalgorithms.com/docs/validate-ip)\n\n## Numerical analysis\n\n- [Integral](https://allalgorithms.com/docs/integral)\n- [Monte carlo](https://allalgorithms.com/docs/monte-carlo)\n- [Runge kutt](https://allalgorithms.com/docs/runge-kutt)\n\n## Randomized algorithms\n\n- [Birthday paradox](https://allalgorithms.com/docs/birthday-paradox)\n- [Karger minimum cut algorithm](https://allalgorithms.com/docs/karger-minimum-cut-algorithm)\n- [Kth smallest element algorithm](https://allalgorithms.com/docs/kth-smallest-element-algorithm)\n- [Random from stream](https://allalgorithms.com/docs/random-from-stream)\n- [Random node linked list](https://allalgorithms.com/docs/random-node-linked-list)\n- [Randomized quicksort](https://allalgorithms.com/docs/randomized-quicksort)\n- [Reservoir sampling](https://allalgorithms.com/docs/reservoir-sampling)\n- [Shuffle an array](https://allalgorithms.com/docs/shuffle-an-array)\n\n## Searches\n\n- [Binary search](https://allalgorithms.com/docs/binary-search)\n- [Exponential search](https://allalgorithms.com/docs/exponential-search)\n- [Fibonacci search](https://allalgorithms.com/docs/fibonacci-search)\n- [Fuzzy search](https://allalgorithms.com/docs/fuzzy-search)\n- [Interpolation search](https://allalgorithms.com/docs/interpolation-search)\n- [Jump search](https://allalgorithms.com/docs/jump-search)\n- [Linear search](https://allalgorithms.com/docs/linear-search)\n- [Ternay search](https://allalgorithms.com/docs/ternay-search)\n\n## Selections algorithms\n\n- [Median of medians](https://allalgorithms.com/docs/median-of-medians)\n- [Quick select](https://allalgorithms.com/docs/quick-select)\n\n## Sorting\n\n- [Bead sort](https://allalgorithms.com/docs/bead-sort)\n- [Bogo sort](https://allalgorithms.com/docs/bogo-sort)\n- [Bubble sort](https://allalgorithms.com/docs/bubble-sort)\n- [Bucket sort](https://allalgorithms.com/docs/bucket-sort)\n- [Circle sort](https://allalgorithms.com/docs/circle-sort)\n- [Comb sort](https://allalgorithms.com/docs/comb-sort)\n- [Counting sort](https://allalgorithms.com/docs/counting-sort)\n- [Cycle sort](https://allalgorithms.com/docs/cycle-sort)\n- [Flash sort](https://allalgorithms.com/docs/flash-sort)\n- [Gnome sort](https://allalgorithms.com/docs/gnome-sort)\n- [Heap sort](https://allalgorithms.com/docs/heap-sort)\n- [Insertion sort](https://allalgorithms.com/docs/insertion-sort)\n- [Intro sort](https://allalgorithms.com/docs/intro-sort)\n- [Merge sort](https://allalgorithms.com/docs/merge-sort)\n- [Pigeonhole sort](https://allalgorithms.com/docs/pigeonhole-sort)\n- [Quick sort](https://allalgorithms.com/docs/quick-sort)\n- [Radix sort](https://allalgorithms.com/docs/radix-sort)\n- [Selection sort](https://allalgorithms.com/docs/selection-sort)\n- [Shaker sort](https://allalgorithms.com/docs/shaker-sort)\n- [Shell sort](https://allalgorithms.com/docs/shell-sort)\n- [Sleep sort](https://allalgorithms.com/docs/sleep-sort)\n- [Stooge sort](https://allalgorithms.com/docs/stooge-sort)\n- [Topological sort](https://allalgorithms.com/docs/topological-sort)\n- [Tree sort](https://allalgorithms.com/docs/tree-sort)\n\n## Strings\n\n- [Aho-Corasick algorithm](https://allalgorithms.com/docs/aho-corasick-algorithm)\n- [Anagram search](https://allalgorithms.com/docs/anagram-search)\n- [Arithmetic on large numbers](https://allalgorithms.com/docs/arithmetic-on-large-numbers)\n- [Boyer-Moore algorithm](https://allalgorithms.com/docs/boyer-moore-algorithm)\n- [Finite automata](https://allalgorithms.com/docs/finite-automata)\n- [Kasai algorithm](https://allalgorithms.com/docs/kasai-algorithm)\n- [Kmp algorithm](https://allalgorithms.com/docs/kmp-algorithm)\n- [Levenshtein distance](https://allalgorithms.com/docs/levenshtein-distance)\n- [Lipogram checker](https://allalgorithms.com/docs/lipogram-checker)\n\n## Online challenges\n\n- [Coderbyte](https://allalgorithms.com/docs/coderbyte)\n- [Code chef](https://allalgorithms.com/docs/code-chef)\n- [Code eval](https://allalgorithms.com/docs/code-eval)\n- [Hackerearth](https://allalgorithms.com/docs/hackerearth)\n- [Hackerrank](https://allalgorithms.com/docs/hackerrank)\n- [Leetcode](https://allalgorithms.com/docs/leetcode)\n- [Project euler](https://allalgorithms.com/docs/project-euler)\n- [Rosalind](https://allalgorithms.com/docs/rosalind)\n- [Spoj](https://allalgorithms.com/docs/spoj)\n- [Top coder](https://allalgorithms.com/docs/top-coder)\n\n## No category\n\n- [Average](https://allalgorithms.com/docs/average)\n- [Biggest of n numbers](https://allalgorithms.com/docs/biggest-of-n-numbers)\n- [Biggest suffix](https://allalgorithms.com/docs/biggest-suffix)\n- [Fifteen puzzle](https://allalgorithms.com/docs/fifteen-puzzle)\n- [Jaccard similarity](https://allalgorithms.com/docs/jaccard-similarity)\n- [Jose phus problem](https://allalgorithms.com/docs/jose-phus-problem)\n- [Lapindrom checker](https://allalgorithms.com/docs/lapindrom-checker)\n- [Leap year](https://allalgorithms.com/docs/leap-year)\n- [Magic square](https://allalgorithms.com/docs/magic-square)\n- [Majority element](https://allalgorithms.com/docs/majority-element)\n- [Minimum subarray size with degree](https://allalgorithms.com/docs/minimum-subarray-size-with-degree)\n- [No operator addition](https://allalgorithms.com/docs/no-operator-addition)\n- [Paint fill](https://allalgorithms.com/docs/paint-fill)\n- [Split list](https://allalgorithms.com/docs/split-list)\n- [Tokenizer](https://allalgorithms.com/docs/tokenizer)\n- [Unique number](https://allalgorithms.com/docs/unique-number)\n\n## License\n\nThis work is released under MIT License.\n\nTo the extent possible under law, [Abraham Hernandez (@abranhe)](https://go.abranhe.com/github) has waived all copyright and related or neighboring rights to this work.\n\n\u003cdiv align=\"center\"\u003e\n\t\u003ca href=\"https://github.com/abranhe/algorithms\"\u003e\n\t\t\u003cimg src=\"https://cdn.abranhe.com/projects/algorithms/logo.svg\" width=\"50px\"\u003e\n\t\u003c/a\u003e\n  \u003cbr\u003e\n\u003c/div\u003e\n","funding_links":["https://paypal.me/abranhe/10","https://patreon.com/abranhe"],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fallalgorithms%2Falgorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fallalgorithms%2Falgorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fallalgorithms%2Falgorithms/lists"}