PHP - The Algorithms

The Algorithms

À propos Faire un don

PHP

Chiffrement

Atbash Cipher

Caesar Cipher

Mono Alphabetic Cipher

Morse Code

Rail Fence Cipher

Vignere Cipher

XOR Cipher

+3

Conversions

Binary to Decimal

+4

Decimal to Binary

+5

Hexadecimal to Decimal

Octal to Decimal

Speed Conversion

Temperature Conversions

Structures de données

AVL Tree

+4

AVL Tree Node

Tree Traversal

BST Node

Duplicate Key Exception

Disjoint Set

Disjoint Set Node

Doubly Linked List

+5

Node

Queue

+3

Segment Tree

+4

Segment Tree Node

Singly Linked List

+3

Splay Tree

Splay Tree Node

Splay Tree Rotations

Stack

+4

Trie

+3

Trie Node

Prime

+8

Diviser pour régner

Mergesort

+19

Programmation dynamique

Factorial

+13

Fibonacci Numbers

+12

Graphes

Bellman Ford

+4

Breadth First Search

+3

Depth First Search

+4

Mathématiques

Absolute Max

Absolute Min

Armstrong Number

+8

Base X

Check Even

Check Odd

Eratosthenes Sieve

Fast Exponentiation

Fast Inverse Square Root

Fibonacci 2

Greatest Common Divisor

Median

Mode

Neon Number

Perfect Number

+7

Perfect Square

+3

Distance

Méthodes numériques

Mean

Autres

Two Pointers

Recherches

Binary Tree Traversal

Binary Search

+15

Exponential Search

+2

Fibonacci Search

+5

Interpolation Search

+6

Jump Search

+8

Linear Search

+14

Lower Bound

Sentinel Search

Ternary Search

+5

Upper Bound

Tris

Array Keys Sort

Bubble Sort

+19

Bubble Sort 2

Count Sort

Gnome Sort

+8

Heap Sort

+15

Insertion Sort

+18

Quick Sort

+19

Radix Sort

+9

Selection Sort

+14

Shell Sort

+10

Chaînes de caractère

Check Palindrome

Check Anagram

+2

Check Palindrome

Check Palindrome 2

Count Consonants

Count Homogenous

Count Sentences

Count Vowels

Max Character

Reverse String

Reverse Words

Structure

Bstree

Utils

Array Helpers

Execution Time

© 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