-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
0 parents
commit e598095
Showing
7 changed files
with
972 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,389 @@ | ||
| <!DOCTYPE html> | ||
| <html lang="en"><head><meta charset="UTF-8"><meta name="viewport" content="width=device-width,initial-scale=1"><title>The Algorithms - JavaScript</title><link rel="stylesheet" href="./style.css"></head><body><h1> | ||
| The Algorithms - JavaScript (<a href="https://github.com/TheAlgorithms/JavaScript" target="_blank">Source</a>) | ||
| </h1> | ||
| <p> | ||
| Algorithm: | ||
| <select id="algorithm-select"></select> | ||
| </p> | ||
| <div id="container" style="height: 80vh"></div> | ||
|
|
||
| <script> | ||
| const algorithms = [ | ||
| "Backtracking/AllCombinationsOfSizeK", | ||
| "Backtracking/GeneratePermutations", | ||
| "Backtracking/KnightTour", | ||
| "Backtracking/NQueens", | ||
| "Backtracking/RatInAMaze", | ||
| "Backtracking/Sudoku", | ||
| "Backtracking/SumOfSubset", | ||
| "Backtracking/generateParentheses", | ||
| "Bit-Manipulation/BinaryCountSetBits", | ||
| "Bit-Manipulation/IsPowerOfTwo", | ||
| "Bit-Manipulation/LogTwo", | ||
| "Bit-Manipulation/NextPowerOfTwo", | ||
| "Bit-Manipulation/SetBit", | ||
| "Cache/LFUCache", | ||
| "Cache/LRUCache", | ||
| "Cache/Memoize", | ||
| "Cache/test/cacheTest", | ||
| "Cellular-Automata/ConwaysGameOfLife", | ||
| "Cellular-Automata/Elementary", | ||
| "Ciphers/AffineCipher", | ||
| "Ciphers/Atbash", | ||
| "Ciphers/CaesarCipher", | ||
| "Ciphers/KeyFinder", | ||
| "Ciphers/KeywordShiftedAlphabet", | ||
| "Ciphers/MorseCode", | ||
| "Ciphers/ROT13", | ||
| "Ciphers/VigenereCipher", | ||
| "Ciphers/XORCipher", | ||
| "Conversions/ArbitraryBase", | ||
| "Conversions/ArrayBufferToBase64", | ||
| "Conversions/Base64ToArrayBuffer", | ||
| "Conversions/BinaryToDecimal", | ||
| "Conversions/BinaryToHex", | ||
| "Conversions/DateDayDifference", | ||
| "Conversions/DateToDay", | ||
| "Conversions/DecimalToBinary", | ||
| "Conversions/DecimalToHex", | ||
| "Conversions/DecimalToOctal", | ||
| "Conversions/DecimalToRoman", | ||
| "Conversions/HexToBinary", | ||
| "Conversions/HexToDecimal", | ||
| "Conversions/HexToRGB", | ||
| "Conversions/LitersToImperialGallons", | ||
| "Conversions/LitersToUSGallons", | ||
| "Conversions/LowerCaseConversion", | ||
| "Conversions/MeterToFeetConversion", | ||
| "Conversions/OctToDecimal", | ||
| "Conversions/OuncesToKilograms", | ||
| "Conversions/RGBToHex", | ||
| "Conversions/RailwayTimeConversion", | ||
| "Conversions/RgbHsvConversion", | ||
| "Conversions/RomanToDecimal", | ||
| "Conversions/TemperatureConversion", | ||
| "Conversions/TitleCaseConversion", | ||
| "Conversions/UpperCaseConversion", | ||
| "Data-Structures/Array/LocalMaximomPoint", | ||
| "Data-Structures/Array/NumberOfLocalMaximumPoints", | ||
| "Data-Structures/Array/QuickSelect", | ||
| "Data-Structures/Array/Reverse", | ||
| "Data-Structures/Graph/Graph", | ||
| "Data-Structures/Graph/Graph2", | ||
| "Data-Structures/Graph/Graph3", | ||
| "Data-Structures/Heap/KeyPriorityQueue", | ||
| "Data-Structures/Heap/MaxHeap", | ||
| "Data-Structures/Heap/MinHeap", | ||
| "Data-Structures/Heap/MinPriorityQueue", | ||
| "Data-Structures/Linked-List/AddTwoNumbers", | ||
| "Data-Structures/Linked-List/CycleDetection", | ||
| "Data-Structures/Linked-List/DoublyLinkedList", | ||
| "Data-Structures/Linked-List/ReverseSinglyLinkedList", | ||
| "Data-Structures/Linked-List/SinglyCircularLinkedList", | ||
| "Data-Structures/Linked-List/SinglyLinkedList", | ||
| "Data-Structures/Queue/CircularQueue", | ||
| "Data-Structures/Queue/Queue", | ||
| "Data-Structures/Queue/QueueUsing2Stacks", | ||
| "Data-Structures/Stack/Stack", | ||
| "Data-Structures/Stack/StackES6", | ||
| "Data-Structures/Tree/AVLTree", | ||
| "Data-Structures/Tree/BinarySearchTree", | ||
| "Data-Structures/Tree/SegmentTree", | ||
| "Data-Structures/Tree/Trie", | ||
| "Data-Structures/Vectors/Vector2", | ||
| "Dynamic-Programming/CatalanNumbers", | ||
| "Dynamic-Programming/ClimbingStairs", | ||
| "Dynamic-Programming/CoinChange", | ||
| "Dynamic-Programming/EditDistance", | ||
| "Dynamic-Programming/FastFibonacciNumber", | ||
| "Dynamic-Programming/FibonacciNumber", | ||
| "Dynamic-Programming/FindMonthCalendar", | ||
| "Dynamic-Programming/KadaneAlgo", | ||
| "Dynamic-Programming/LevenshteinDistance", | ||
| "Dynamic-Programming/LongestCommonSubsequence", | ||
| "Dynamic-Programming/LongestIncreasingSubsequence", | ||
| "Dynamic-Programming/LongestPalindromicSubsequence", | ||
| "Dynamic-Programming/LongestValidParentheses", | ||
| "Dynamic-Programming/MaxNonAdjacentSum", | ||
| "Dynamic-Programming/MaxProductOfThree", | ||
| "Dynamic-Programming/MinimumCostPath", | ||
| "Dynamic-Programming/NumberOfSubsetEqualToGivenSum", | ||
| "Dynamic-Programming/RodCutting", | ||
| "Dynamic-Programming/Shuf", | ||
| "Dynamic-Programming/SieveOfEratosthenes", | ||
| "Dynamic-Programming/SudokuSolver", | ||
| "Dynamic-Programming/TrappingRainWater", | ||
| "Dynamic-Programming/TribonacciNumber", | ||
| "Dynamic-Programming/UniquePaths", | ||
| "Dynamic-Programming/UniquePaths2", | ||
| "Dynamic-Programming/ZeroOneKnapsack", | ||
| "Dynamic-Programming/Sliding-Window/HouseRobber", | ||
| "Dynamic-Programming/Sliding-Window/LongestSubstringWithoutRepeatingCharacters", | ||
| "Dynamic-Programming/Sliding-Window/MaxConsecutiveOnes", | ||
| "Dynamic-Programming/Sliding-Window/MaxConsecutiveOnesIII", | ||
| "Dynamic-Programming/Sliding-Window/PermutationinString", | ||
| "Geometry/Circle", | ||
| "Geometry/Cone", | ||
| "Geometry/ConvexHullGraham", | ||
| "Geometry/Pyramid", | ||
| "Geometry/Sphere", | ||
| "Graphs/BellmanFord", | ||
| "Graphs/BinaryLifting", | ||
| "Graphs/BreadthFirstSearch", | ||
| "Graphs/BreadthFirstShortestPath", | ||
| "Graphs/ConnectedComponents", | ||
| "Graphs/Density", | ||
| "Graphs/DepthFirstSearchIterative", | ||
| "Graphs/DepthFirstSearchRecursive", | ||
| "Graphs/Dijkstra", | ||
| "Graphs/DijkstraSmallestPath", | ||
| "Graphs/FloydWarshall", | ||
| "Graphs/Kosaraju", | ||
| "Graphs/KruskalMST", | ||
| "Graphs/LCABinaryLifting", | ||
| "Graphs/NodeNeighbors", | ||
| "Graphs/NumberOfIslands", | ||
| "Graphs/PrimMST", | ||
| "Hashes/SHA1", | ||
| "Hashes/SHA256", | ||
| "Maths/Abs", | ||
| "Maths/AliquotSum", | ||
| "Maths/Area", | ||
| "Maths/ArithmeticGeometricMean", | ||
| "Maths/ArmstrongNumber", | ||
| "Maths/AverageMean", | ||
| "Maths/AverageMedian", | ||
| "Maths/BinaryConvert", | ||
| "Maths/BinaryExponentiationIterative", | ||
| "Maths/BinaryExponentiationRecursive", | ||
| "Maths/BinomialCoefficient", | ||
| "Maths/BisectionMethod", | ||
| "Maths/CheckKishnamurthyNumber", | ||
| "Maths/CircularArc", | ||
| "Maths/CoPrimeCheck", | ||
| "Maths/CollatzSequence", | ||
| "Maths/Coordinate", | ||
| "Maths/CountNumbersDivisible", | ||
| "Maths/DecimalExpansion", | ||
| "Maths/DecimalIsolate", | ||
| "Maths/DegreeToRadian", | ||
| "Maths/EulerMethod", | ||
| "Maths/EulersTotient", | ||
| "Maths/EulersTotientFunction", | ||
| "Maths/ExponentialFunction", | ||
| "Maths/ExtendedEuclideanGCD", | ||
| "Maths/Factorial", | ||
| "Maths/Factors", | ||
| "Maths/FareyApproximation", | ||
| "Maths/FermatPrimalityTest", | ||
| "Maths/Fibonacci", | ||
| "Maths/FigurateNumber", | ||
| "Maths/FindHcf", | ||
| "Maths/FindLcm", | ||
| "Maths/FindMaxRecursion", | ||
| "Maths/FindMin", | ||
| "Maths/FindMinIterator", | ||
| "Maths/FriendlyNumbers", | ||
| "Maths/GetEuclidGCD", | ||
| "Maths/GridGet", | ||
| "Maths/HexagonalNumber", | ||
| "Maths/IntToBase", | ||
| "Maths/IsDivisible", | ||
| "Maths/IsEven", | ||
| "Maths/IsOdd", | ||
| "Maths/IsPronic", | ||
| "Maths/IsSquareFree", | ||
| "Maths/JugglerSequence", | ||
| "Maths/LeapYear", | ||
| "Maths/LinearSieve", | ||
| "Maths/LiouvilleFunction", | ||
| "Maths/LucasSeries", | ||
| "Maths/Mandelbrot", | ||
| "Maths/MatrixExponentiationRecursive", | ||
| "Maths/MatrixMultiplication", | ||
| "Maths/MeanAbsoluteDeviation", | ||
| "Maths/MeanSquareError", | ||
| "Maths/MidpointIntegration", | ||
| "Maths/MobiusFunction", | ||
| "Maths/ModularArithmetic", | ||
| "Maths/ModularBinaryExponentiationRecursive", | ||
| "Maths/NumberOfDigits", | ||
| "Maths/Palindrome", | ||
| "Maths/ParityOutlier", | ||
| "Maths/PascalTriangle", | ||
| "Maths/PerfectCube", | ||
| "Maths/PerfectNumber", | ||
| "Maths/PerfectSquare", | ||
| "Maths/PermutationAndCombination", | ||
| "Maths/PiApproximationMonteCarlo", | ||
| "Maths/Polynomial", | ||
| "Maths/Pow", | ||
| "Maths/PowLogarithmic", | ||
| "Maths/PrimeCheck", | ||
| "Maths/PrimeFactors", | ||
| "Maths/RadianToDegree", | ||
| "Maths/ReverseNumber", | ||
| "Maths/ReversePolishNotation", | ||
| "Maths/ShorsAlgorithm", | ||
| "Maths/SieveOfEratosthenes", | ||
| "Maths/SieveOfEratosthenesIntArray", | ||
| "Maths/Signum", | ||
| "Maths/SimpsonIntegration", | ||
| "Maths/Softmax", | ||
| "Maths/SquareRoot", | ||
| "Maths/SquareRootLogarithmic", | ||
| "Maths/SumOfDigits", | ||
| "Maths/SumOfGeometricProgression", | ||
| "Maths/TwinPrime", | ||
| "Maths/Volume", | ||
| "Maths/WhileLoopFactorial", | ||
| "Maths/ZellersCongruenceAlgorithm", | ||
| "Maths/isPalindromeIntegerNumber", | ||
| "Maths/test/EulerMethod.manual-test", | ||
| "Maths/test/Mandelbrot.manual-test", | ||
| "Navigation/Haversine", | ||
| "Project-Euler/Problem001", | ||
| "Project-Euler/Problem002", | ||
| "Project-Euler/Problem003", | ||
| "Project-Euler/Problem004", | ||
| "Project-Euler/Problem005", | ||
| "Project-Euler/Problem006", | ||
| "Project-Euler/Problem007", | ||
| "Project-Euler/Problem008", | ||
| "Project-Euler/Problem009", | ||
| "Project-Euler/Problem010", | ||
| "Project-Euler/Problem011", | ||
| "Project-Euler/Problem012", | ||
| "Project-Euler/Problem013", | ||
| "Project-Euler/Problem014", | ||
| "Project-Euler/Problem015", | ||
| "Project-Euler/Problem016", | ||
| "Project-Euler/Problem017", | ||
| "Project-Euler/Problem018", | ||
| "Project-Euler/Problem020", | ||
| "Project-Euler/Problem021", | ||
| "Project-Euler/Problem023", | ||
| "Project-Euler/Problem025", | ||
| "Project-Euler/Problem028", | ||
| "Project-Euler/Problem035", | ||
| "Project-Euler/Problem044", | ||
| "Recursive/BinaryEquivalent", | ||
| "Recursive/BinarySearch", | ||
| "Recursive/EucledianGCD", | ||
| "Recursive/Factorial", | ||
| "Recursive/FibonacciNumberRecursive", | ||
| "Recursive/FloodFill", | ||
| "Recursive/KochSnowflake", | ||
| "Recursive/KochSnowflake.manual-test", | ||
| "Recursive/LetterCombination", | ||
| "Recursive/Palindrome", | ||
| "Recursive/SubsequenceRecursive", | ||
| "Recursive/TowerOfHanoi", | ||
| "Search/BinarySearch", | ||
| "Search/ExponentialSearch", | ||
| "Search/FibonacciSearch", | ||
| "Search/InterpolationSearch", | ||
| "Search/JumpSearch", | ||
| "Search/LinearSearch", | ||
| "Search/Minesweeper", | ||
| "Search/QuickSelectSearch", | ||
| "Search/SlidingWindow", | ||
| "Search/StringSearch", | ||
| "Search/TernarySearch", | ||
| "Search/UnionFind", | ||
| "Sorts/AlphaNumericalSort", | ||
| "Sorts/BeadSort", | ||
| "Sorts/BinaryInsertionSort", | ||
| "Sorts/BogoSort", | ||
| "Sorts/BubbleSort", | ||
| "Sorts/BucketSort", | ||
| "Sorts/CocktailShakerSort", | ||
| "Sorts/CombSort", | ||
| "Sorts/CountingSort", | ||
| "Sorts/CycleSort", | ||
| "Sorts/DutchNationalFlagSort", | ||
| "Sorts/FindSecondLargestElement", | ||
| "Sorts/FisherYatesShuffle", | ||
| "Sorts/FlashSort", | ||
| "Sorts/GnomeSort", | ||
| "Sorts/HeapSort", | ||
| "Sorts/HeapSortV2", | ||
| "Sorts/InsertionSort", | ||
| "Sorts/IntroSort", | ||
| "Sorts/MergeSort", | ||
| "Sorts/OddEvenSort", | ||
| "Sorts/PancakeSort", | ||
| "Sorts/PigeonHoleSort", | ||
| "Sorts/QuickSort", | ||
| "Sorts/QuickSortRecursive", | ||
| "Sorts/RadixSort", | ||
| "Sorts/SelectionSort", | ||
| "Sorts/ShellSort", | ||
| "Sorts/SimplifiedWiggleSort", | ||
| "Sorts/StoogeSort", | ||
| "Sorts/SwapSort", | ||
| "Sorts/TimSort", | ||
| "Sorts/TopologicalSort", | ||
| "String/AlphaNumericPalindrome", | ||
| "String/AlternativeStringArrange", | ||
| "String/BoyerMoore", | ||
| "String/CheckAnagram", | ||
| "String/CheckCamelCase", | ||
| "String/CheckExceeding", | ||
| "String/CheckFlatCase", | ||
| "String/CheckKebabCase", | ||
| "String/CheckPalindrome", | ||
| "String/CheckPangram", | ||
| "String/CheckPascalCase", | ||
| "String/CheckRearrangePalindrome", | ||
| "String/CheckSnakeCase", | ||
| "String/CheckWordOccurrence", | ||
| "String/CountLetters", | ||
| "String/CountSubstrings", | ||
| "String/CountVowels", | ||
| "String/CreatePermutations", | ||
| "String/DiceCoefficient", | ||
| "String/FirstUniqueCharacter", | ||
| "String/FormatPhoneNumber", | ||
| "String/GenerateGUID", | ||
| "String/HammingDistance", | ||
| "String/IsPalindrome", | ||
| "String/KMPPatternSearching", | ||
| "String/LevenshteinDistance", | ||
| "String/Lower", | ||
| "String/MaxCharacter", | ||
| "String/MaxWord", | ||
| "String/PatternMatching", | ||
| "String/PercentageOfLetters", | ||
| "String/PermutateString", | ||
| "String/ReverseString", | ||
| "String/ReverseWords", | ||
| "String/ScrambleStrings", | ||
| "String/Upper", | ||
| "String/ValidateCreditCard", | ||
| "String/ValidateEmail", | ||
| "String/ZFunction", | ||
| "Timing-Functions/GetMonthDays", | ||
| "Timing-Functions/IntervalTimer", | ||
| "Trees/BreadthFirstTreeTraversal", | ||
| "Trees/DepthFirstSearch", | ||
| "Trees/FenwickTree", | ||
| ]; | ||
| const algorithmSelect = document.getElementById("algorithm-select"); | ||
| algorithms.forEach((algorithm) => { | ||
| const option = document.createElement("option"); | ||
| option.value = algorithm; | ||
| option.innerText = algorithm; | ||
| option.id = algorithm; | ||
| algorithmSelect.appendChild(option); | ||
| }); | ||
|
|
||
| const params = new URLSearchParams(window.location.search); | ||
| const selected = | ||
| (params.get("algorithm") && | ||
| algorithms.find((algorithm) => algorithm === params.get("algorithm"))) || | ||
| "Search/BinarySearch"; | ||
| document.getElementById(selected).selected = true; | ||
| </script> | ||
| <script src="./script.js" type="module"></script></body></html> |
Oops, something went wrong.