Rust - The Algorithms

The Algorithms

À propos Faire un don

Rust

Retour arrière

All Combination of Size K

Graph Coloring

Hamiltonian Cycle

Knight Tour

N Queens

Parentheses Generator

Rat in Maze

Subset Sum

Sudoku Solver

+1

Word Break

Grand Entier

Fast Factorial

Poly 1305

Manipulation de bits

Counting Bits

Highest Set Bit

N Bits Gray Code

Sum of Two Integers

Chiffrement

AES

Another Rot 13

Baconian Cipher

Base 64

Blake 2b

Caesar

Chacha

Diffie Hellman

Hashing Traits

Kerninghan

Morse Code

Polybius

Railfence

Rot 13

Salsa

Sha 3

Tea

Theoretical Rot 13

Transposition

Vigenere

XOR Cipher

+3

Compression

Run Length Encoding

Run Length Encoding

Conversions

Binary to Decimal

+4

Binary to Hexadecimal

Decimal to Binary

+5

Decimal to Hexadecimal

Hexa Decimal To Binary

Hexadecimal to Decimal

Length Conversion

Octal to Binary

Octal to Decimal

Rgb Cmyk Conversion

Structures de données

Permutations

AVL Tree

+4

Binary Search Tree

+3

Fenwick Tree

+1

Floyds Algorithm

Graph

+1

Hash Table

Heap

+1

Lazy Segment Tree

Linked List

+1

Bloom Filter

Count Min Sketch

Queue

+3

Range Minimum Query

Rb Tree

Segment Tree

+4

Segment Tree Recursive

Stack with Singly Linked List

+3

Treap

Trie

+3

Veb Tree

Heap

+1

Disjoint Set Union

Lowest Common Ancestor

Postfix Evaluation

Prime

+8

Prime

+8

Reverse

Suffix Tree

Diviser pour régner

Convex Hull

Mergesort

+19

Programmation dynamique

Coin Change

+6

Egg Dropping

Fibonacci Numbers

+12

Knapsack

+2

Longest Common Subsequence

+1

Longest Common Substring

Longest Continuous Increasing Subsequence

Longest Increasing Subsequence

Matrix Chain Multiply

Maximal Square

Maximum Subarray

Minimum Cost Path

Rod Cutting

Snail

Subset Generation

Trapped Rainwater

Kadane Algorithm

Floyd Warshall

+3

Catalan Numbers

Factorial

+13

Exercism

Isogram

Financier

Present Value

Interest

Général

Hanoi

Huffman Encoding

Kmeans

Mex

Steinhaus Johnson Trotter

Kmeans

Géométrie

Closest Points

Jarvis Scan

Point

Polygon Points

Ramer Douglas Peucker

Segment

Graphes

A Star

Bellman Ford

+4

Bipartite Matching

Breadth First Search

+3

Centroid Decomposition

Decremental Connectivity

Depth First Search

+4

Depth First Search Tic Tac Toe

Detect Cycle

Dijkstra

+4

Dinic Maxflow

Eulerian Path

Graph Enumeration

Kosaraju

Lee Breadth First Search

Minimum Spanning Tree

Prim

Prufer Code

Strongly Connected Components

Tarjans Ssc

Two Satisfiability

Greedy

Stable Matching

Méthodes gourmandes

Fractional Knapsack

Hachage

Sha 256

Algèbre linéaire

Gaussian Elimination

Machine Learning

Cholesky

Linear Regression

Logistic Regression

Average Margin Ranking Loss

Hinge Loss

Huber Loss

Kl Divergence Loss

Mean Absolute Error Loss

Mean Squared Error Loss

Negative Log Likelihood

Adam

Gradient Descent

Huber Loss

Mathématiques

Multiply

Two Sum

Abs

+5

Aliquot Sum

+5

Amicable Numbers

Area of Polygon

Area Under Curve

Armstrong Number

+8

Average

Baby Step Giant Step

Bell Numbers

Binary Exponentiation

Binomial Coefficient

+1

Ceil

+1

Chinese Remainder Theorem

Collatz Sequence

Combinations

Cross Entropy Loss

Decimal to Fraction

Elliptic Curve

Euclidean Distance

Extended Euclidean Algorithm

Factors

Fast Power

Faster Perfect Numbers

Field

Frizzy Number

Gcd of N Numbers

Geometric Series

Greatest Common Divisor

Interquartile Range

Karatsuba Multiplication

LCM

+2

Leaky Relu

Least Square Approx

Linear Sieve

Logarithm

Lucas Series

Matrix Ops

Mersenne Primes

Miller Rabin

Modular Exponential

Newton Raphson

Nthprime

Perfect Cube

Perfect Number

+7

Perfect Square

+3

Pollard Rho

Prime Factors

Quadratic Residue

Random

Relu

Sieve of Eratosthenes

+4

Sigmoid

Signum

Simpsons Integration

Softmax

Sprague Grundy Theorem

Square Pyramidal Numbers

Square Root

Sum of Digits

+1

Sum of Geometric Progression

Sum of Harmonic Series

Sylvester Sequence

Tanh

Trapezoidal Integration

Trial Division

Trig Functions

Vector Cross Product

Zellers Congruence Algorithm

Matrice

Pascal Triangle

Navigation

Bearing

Haversine

Flux de réseaux

Ford Fulkerson

Réseau neuronal

Exponential Linear Unit

Gaussian Error Linear Unit

Théorie des nombres

Compute Totient

Kth Factor

Méthodes numériques

Fast Fourier Transform

Autres

Graham Scan

Doomsday

Requêtes de plage

Heavy Light Decomposition

Recherches

Union Find

+1

Interpolation

Binary Search

+15

Binary Search Recursive

Exponential Search

+2

Fibonacci Search

+5

Interpolation Search

+6

Jump Search

+8

Kth Smallest

Kth Smallest Heap

Linear Search

+14

Moore Voting

Quick Select

Saddleback Search

Ternary Search

+5

Ternary Search Min Max

Ternary Search Min Max Recursive

Ternary Search Recursive

Tris

Fisher Yates Shuffle

Topological Sort

+2

Bead Sort

+2

Binary Insertion Sort

+4

Bingo Sort

Bitonic Sort

Bogo Sort

+8

Bubble Sort

+19

Bucket Sort

+5

Cocktail Shaker Sort

Comb Sort

+8

Counting Sort

+9

Cycle Sort

+5

Dutch National Flag Sort

Exchange Sort

Gnome Sort

+8

Heap Sort

+15

Insertion Sort

+18

Intro Sort

Odd Even Sort

+2

Pancake Sort

+7

Patience Sort

+1

Pigeonhole Sort

+2

Quick Sort

+19

Quick Sort 3 Ways

Radix Sort

+9

Selection Sort

+14

Shell Sort

+10

Sleep Sort

Sort Utils

Stooge Sort

+1

Tim Sort

+3

Tree Sort

Wave Sort

Wiggle Sort

Piles

Infix To Postfix

Chaînes de caractère

Issubsequence

Genetic

Naive

Aho Corasick

Anagram

Autocomplete Using Trie

Boyer Moore Search

Burrows Wheeler Transform

Duval Algorithm

Hamming Distance

+7

Isomorphism

Jaro Winkler Distance

Knuth Morris Pratt

Levenshtein Distance

+2

Lipogram

Manacher

Palindrome

+2

Pangram

Rabin Karp

+2

Shortest Palindrome

Suffix Array

Suffix Array Manber Myers

Z Algorithm

Structure

Btree

© The Algorithms 2024

Qu'est-ce qu'un algorithme ?À propos de nous Langages de programmation Contribuer Faire un don

GitHub Gitter X Code source Contact

Powered by Vercel