GeezerVison is showing github.com — all algorithms use mathjax for complexities (#212) · mohaike/AlgorithmVisualizer@f039b39
File treeExpand file treeCollapse file tree Open diff view settings cryptography/affine_cipher longest_common_subsequence longest_increasing_subsequence longest_palindromic_subsequence shortest_common_supersequence
Some content is hiddenLarge Commits have some content hidden by default. Use the searchbox below for content that may be hidden. Expand file treeCollapse file tree Open diff view settings Collapse file Copy file name to clipboardExpand all lines: algorithm/backtracking/knight's_tour/desc.json +2-2Lines changed: 2 additions & 2 deletions | Original file line number | Diff line number | Diff line change |
|---|
| 1 | 1 | { | 2 | 2 | "Knight’s tour problem": "A knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every square only once. If the knight ends on a square that is one knight's move from the beginning square (so that it could tour the board again immediately, following the same path), the tour is closed, otherwise it is open.", | 3 | 3 | "Complexity": { | 4 | | - "time": "Worst $$O(8^{N^{2}})$$", | 5 | | - "space": "Worst $$O(N^2)$$" | | 4 | + "time": "Worst $O(8^{N^{2}})$", | | 5 | + "space": "Worst $O(N^2)$" | 6 | 6 | }, | 7 | 7 | "References": [ | 8 | 8 | "<a href='https://en.wikipedia.org/wiki/Knight%27s_tour'>Wikipedia</a>" | |
Collapse file Copy file name to clipboardExpand all lines: algorithm/backtracking/n_queens/desc.json +2-2Lines changed: 2 additions & 2 deletions | Original file line number | Diff line number | Diff line change |
|---|
| 5 | 5 | "Searching" | 6 | 6 | ], | 7 | 7 | "Complexity": { | 8 | | - "time": "Worst $$O(N!)$$", | 9 | | - "space": "Worst $$O(N)$$" | | 8 | + "time": "Worst $O(N!)$", | | 9 | + "space": "Worst $O(N)$" | 10 | 10 | }, | 11 | 11 | "References": [ | 12 | 12 | "<a href='http://www.geeksforgeeks.org/backtracking-set-3-n-queen-problem/'>geeksforgeeks</a>" | |
Collapse file Copy file name to clipboardExpand all lines: algorithm/cryptography/affine_cipher/desc.json +2-2Lines changed: 2 additions & 2 deletions | Original file line number | Diff line number | Diff line change |
|---|
| 5 | 5 | "More complex Variations of Affine Cipher are used in practical cryptography" | 6 | 6 | ], | 7 | 7 | "Complexity": { | 8 | | - "time": "worst O(N), N = length of plain/cipher text", | 9 | | - "space": "worst O(N), to create the new mapping (plain->cipher, cipher->plain)" | | 8 | + "time": "worst $O(N)$, $N$ = length of plain/cipher text", | | 9 | + "space": "worst $O(N)$, to create the new mapping (plain->cipher, cipher->plain)" | 10 | 10 | }, | 11 | 11 | "References": [ | 12 | 12 | "<a href='http://practicalcryptography.com/ciphers/affine-cipher/'>Practicalcryptography</a>" | |
Collapse file Copy file name to clipboardExpand all lines: algorithm/dp/catalan_number/desc.json +3-3Lines changed: 3 additions & 3 deletions | Original file line number | Diff line number | Diff line change |
|---|
| 6 | 6 | "The number of ways to cut an n+2-sided convex polygon in a plane into triangles by connecting vertices with straight, non-intersecting lines is the nth Catalan number. This is the application in which Euler was interested." | 7 | 7 | ], | 8 | 8 | "Complexity": { | 9 | | - "time": " O(N<sup>2</sup>)", | 10 | | - "space": "O(N)" | | 9 | + "time": " $O(N^2)$", | | 10 | + "space": "$O(N)$" | 11 | 11 | }, | 12 | 12 | "References": [ | 13 | 13 | "<a href='https://en.wikipedia.org/wiki/Catalan_number'>Wikipedia</a>", | | 16 | 16 | "files": { | 17 | 17 | "catalan_number": "Catalan Number" | 18 | 18 | } | 19 | | -} | | 19 | +} |
Collapse file Copy file name to clipboardExpand all lines: algorithm/dp/fibonacci/desc.json +2-2Lines changed: 2 additions & 2 deletions | Original file line number | Diff line number | Diff line change |
|---|
| 1 | 1 | { | 2 | 2 | "Fibonacci Sequence": "Finding Fibonacci sequence using dynamic programming.", | 3 | 3 | "Complexity": { | 4 | | - "time": "O(n)", | 5 | | - "space": "O(n)" | | 4 | + "time": "$O(n)$", | | 5 | + "space": "$O(n)$" | 6 | 6 | }, | 7 | 7 | "References": [ | 8 | 8 | "<a href='https://en.wikipedia.org/wiki/Dynamic_programming#Fibonacci_sequence'>Wikipedia</a>" | |
Collapse file Copy file name to clipboard +3-3Lines changed: 3 additions & 3 deletions | Original file line number | Diff line number | Diff line change |
|---|
| 1 | 1 | { | 2 | 2 | "Integer Partition": "In number theory and combinatorics, a partition of a positive integer n, also called an integer partition, is a way of writing n as a sum of positive integers.", | 3 | 3 | "Complexity": { | 4 | | - "time": "O(n(log n))", | 5 | | - "space": "O(n<sup>2</sup>)" | | 4 | + "time": "$O(n(log \\, n))$", | | 5 | + "space": "$O(n^2)$" | 6 | 6 | }, | 7 | 7 | "References": [ | 8 | 8 | "<a href='https://en.wikipedia.org/wiki/Partition_(number_theory)'>Wikipedia</a>" | 9 | 9 | ], | 10 | 10 | "files": { | 11 | 11 | "basic": "Integer partition" | 12 | 12 | } | 13 | | -} | | 13 | +} |
Collapse file Copy file name to clipboardExpand all lines: algorithm/dp/knapsack_problem/desc.json +2-2Lines changed: 2 additions & 2 deletions | Original file line number | Diff line number | Diff line change |
|---|
| 1 | 1 | { | 2 | 2 | "Knapsack Problem": "Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible.", | 3 | 3 | "Complexity": { | 4 | | - "time": "O(n<sup>2</sup>)", | 5 | | - "space": "O(n<sup>2</sup>)" | | 4 | + "time": "$O(n^2)$", | | 5 | + "space": "$O(n^2)$" | 6 | 6 | }, | 7 | 7 | "References": [ | 8 | 8 | "<a href='https://en.wikipedia.org/wiki/Knapsack_problem'>Wikipedia</a>" | |
Collapse file Copy file name to clipboard +3-3Lines changed: 3 additions & 3 deletions | Original file line number | Diff line number | Diff line change |
|---|
| 1 | 1 | { | 2 | 2 | "Longest Common Subsequence": "The longest common subsequence (LCS) problem is the problem of finding the longest subsequence common to all sequences in a set of sequences (often just two sequences)." , | 3 | 3 | "Complexity": { | 4 | | - "time": "O(mn)", | 5 | | - "space": "O(mn)" | | 4 | + "time": "$O(m\\cdot n)$", | | 5 | + "space": "$O(m\\cdot n)$" | 6 | 6 | }, | 7 | 7 | "References": [ | 8 | 8 | "<a href='https://en.wikipedia.org/wiki/Longest_common_subsequence_problem'>Wikipedia</a>" | 9 | 9 | ], | 10 | 10 | "files": { | 11 | 11 | "basic": "Longest common subsequence" | 12 | 12 | } | 13 | | -} | | 13 | +} |
Collapse file Copy file name to clipboard +3-3Lines changed: 3 additions & 3 deletions | Original file line number | Diff line number | Diff line change |
|---|
| 1 | 1 | { | 2 | 2 | "Longest Increasing Subsequence": "Find the length of the longest subsequence of a given sequence such that all elements of the subsequence are sorted in increasing order", | 3 | 3 | "Complexity": { | 4 | | - "time": "O(n(log n))", | 5 | | - "space": "O(n)" | | 4 | + "time": "$O(n(log\\,n))$", | | 5 | + "space": "$O(n)$" | 6 | 6 | }, | 7 | 7 | "References": [ | 8 | 8 | "<a href='https://en.wikipedia.org/wiki/Longest_increasing_subsequence'>Wikipedia</a>" | 9 | 9 | ], | 10 | 10 | "files": { | 11 | 11 | "basic": "Longest increasing subsequence" | 12 | 12 | } | 13 | | -} | | 13 | +} |
Collapse file Copy file name to clipboardExpand all lines: algorithm/dp/longest_palindromic_subsequence/desc.json +2-2Lines changed: 2 additions & 2 deletions | Original file line number | Diff line number | Diff line change |
|---|
| 1 | 1 | { | 2 | 2 | "Longest Palindromic Subsequence": "Find the length of the longest palindromic subsequence in a given sequence", | 3 | 3 | "Complexity": { | 4 | | - "time": "O(n<sup>2</sup>)", | 5 | | - "space": "O(n<sup>2</sup>)" | | 4 | +"time": "$O(n^2)$", | | 5 | +"space": "$O(n^2)$" | 6 | 6 | }, | 7 | 7 | "References": [ | 8 | 8 | "<a href='http://www.geeksforgeeks.org/dynamic-programming-set-12-longest-palindromic-subsequence/'>GeeksForGeeks</a>" | |
|