GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — AlgorithmVisualizer/algorithm/category.json at master · Hrobot/AlgorithmVisualizer Expand file tree/ Copy pathcategory.jsonMore file actions 121 lines (121 loc) · 3.49 KB / Copy pathcategory.jsonFile metadata and controls121 lines (121 loc) · 3.49 KB 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 { "backtracking": { "list": { "knight's_tour": "Knight’s tour problem", "n_queens": "N Queens Problem" }, "name": "Backtracking" }, "cryptography": { "list": { "affine_cipher": "Affine Cipher", "caesar_cipher": "Caesar Cipher" }, "name": "Cryptography" }, "dp": { "list": { "catalan_number": "Catalan Number", "fibonacci": "Fibonacci Sequence", "integer_partition": "Integer Partition", "knapsack_problem": "Knapsack Problem", "longest_common_subsequence": "Longest Common Subsequence", "longest_increasing_subsequence": "Longest Increasing Subsequence", "longest_palindromic_subsequence": "Longest Palindromic Subsequence", "max_subarray": "Maximum Subarray", "max_sum_path": "Maximum Sum Path", "pascal_triangle": "Pascal's Triangle", "shortest_common_supersequence": "Shortest Common Supersequence", "sliding_window": "Sliding Window", "ugly_numbers": "Ugly Numbers" }, "name": "Dynamic Programming" }, "graph_search": { "list": { "bellman_ford": "Bellman-Ford", "bfs": "BFS", "bridges": "Find-Bridges", "dfs": "DFS", "dls": "Depth-Limited Search", "dijkstra": "Dijkstra", "floyd_warshall": "Floyd-Warshall", "page_rank": "PageRank Algorithm", "topological_sort": "Topological-Sort" }, "name": "Graph Search" }, "greedy": { "list": { "job_scheduling": "Job Scheduling Problem", "majority_element": "Majority Element(Boyer–Moore majority vote algorithm)" }, "name": "Greedy" }, "mst": { "list": { "kruskal": "Kruskal's Algorithm", "prim": "Prim's Algorithm" }, "name": "Minimum Spanning Tree" }, "number_theory": { "list": { "euclidean_algorithm": "Euclidean Algorithm", "sieve_of_eratosthenes": "Sieve of Eratosthenes" }, "name": "Number Theory" }, "search": { "list": { "binary_search": "Binary Search" }, "name": "Search" }, "sorting": { "list": { "bucket": "Bucket Sort", "bubble": "Bubble Sort", "comb": "Comb Sort", "counting": "Counting Sort", "cycle": "Cycle Sort", "heap": "Heapsort", "insertion": "Insertion Sort", "merge": "Merge Sort", "pigeonhole": "Pigeonhole Sort", "quick": "Quicksort", "radix": "Radix Sort", "selection": "Selection Sort", "shell": "Shellsort", "pancake": "Pancake Sort" }, "name": "Sorting" }, "string": { "list": { "edit_distance": "Edit Distance", "knuth_morris_pratt": "KMP Substring Search", "rabin_karp_algorithm": "Rabin-Karp Algorithm", "suffix_array": "Suffix Array (construction & usage)", "z_algorithm": "Z Algorithm" }, "name": "String" }, "tree": { "list": { "binary_search_tree": "Binary Search Tree", "binary_tree_traversal": "Binary Tree Traversal", "lowest_common_ancestor": "Lowest Common Ancestor" }, "name": "Tree" }, "etc": { "list": { "flood_fill": "Flood Fill", "cellular_automata": "Cellular Automata", "create_maze": "Create Maze", "magic_square": "Magic Square" }, "name": "Uncategorized" } } |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |