All public logs

Combined display of all available logs of Algorithm Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)

• 10:34, 15 February 2023 Admin talk contribs created page Chandra (Approximate MCOP Matrix Chain Multiplication) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(n)$? words (Derived: cannot find pdf of original paper or any description of the actual algorithm, but likely the same space as Chin's algorithm) == Description == == Approximate? == Approximate Approximation Factor: 2 == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1975 == Reference == https://www.worldcat.org/title/computing-matrix-chain-products-in-near-...")
• 10:34, 15 February 2023 Admin talk contribs created page Czumaj (Approximate MCOP Matrix Chain Multiplication) (Created page with "== Time Complexity == $O(\log n)$ == Space Complexity == $O(n)$ words? (Derived: solving the optimal triangulation problem of a convex polygon where there are $n+1$ vertices and $n+1$, so total $O(n)$ auxiliary space) == Description == == Approximate? == Approximate Approximation Factor: 1.1547 == Randomized? == No, deterministic == Model of Computation == CREW PRAM == Year == 1996 == Reference == https://citeseerx.ist.psu.edu/viewdoc/download?d...")
• 10:34, 15 February 2023 Admin talk contribs created page Dynamic Programming (Change-Making Problem Change-Making Problem) (Created page with "== Time Complexity == $O(Sn)$ == Space Complexity == $O(Sn)$ words (Easily derived) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1953 == Reference == https://dl.acm.org/doi/10.1145/321864.321874")
• 10:34, 15 February 2023 Admin talk contribs created page Brute Force (Change-Making Problem Change-Making Problem) (Created page with "== Time Complexity == $O(S^n)$ == Space Complexity == $O(n)$ words (Easily derived) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference == NA")
• 10:34, 15 February 2023 Admin talk contribs created page Dynamic Programming (Rod-Cutting Problem Rod-Cutting Problem) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n)$ words (easily derived) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1953 == Reference ==")
• 10:34, 15 February 2023 Admin talk contribs created page Brute Force (Rod-Cutting Problem Rod-Cutting Problem) (Created page with "== Time Complexity == $O(n*{2}^n)$ == Space Complexity == $O(n)$ words (easily derived) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference ==")
• 10:34, 15 February 2023 Admin talk contribs created page PMS (Motif Search Motif Search) (Created page with "== Time Complexity == $O(nm^{2} \sigma)$ == Space Complexity == $O(m^{2} n)$ words (https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2966288/pdf/1471-2105-11-S8-S1.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2007 == Reference == https://ieeexplore.ieee.org/abstract/document/4359890")
• 10:34, 15 February 2023 Admin talk contribs created page Risotto (Motif Search Motif Search) (Created page with "== Time Complexity == $O(mn^{2} \sigma)$ == Space Complexity == $O(mn^{2})$ words (https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2966288/pdf/1471-2105-11-S8-S1.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2006 == Reference == https://link.springer.com/chapter/10.1007/11682462_69")
• 10:34, 15 February 2023 Admin talk contribs created page Census (Motif Search Motif Search) (Created page with "== Time Complexity == $O(k nm \sigma)$ == Space Complexity == $O(mnk)$ words (https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2966288/pdf/1471-2105-11-S8-S1.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2003 == Reference == https://link.springer.com/chapter/10.1007/978-3-540-45078-8_5")
• 10:34, 15 February 2023 Admin talk contribs created page Mitra (Motif Search Motif Search) (Created page with "== Time Complexity == $O(k nm \sigma)$ == Space Complexity == $O(mnk)$ words (https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2966288/pdf/1471-2105-11-S8-S1.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2002 == Reference == https://pubmed.ncbi.nlm.nih.gov/12169566/")
• 10:34, 15 February 2023 Admin talk contribs created page Speller (Motif Search Motif Search) (Created page with "== Time Complexity == $O(mn^{2} \sigma)$ == Space Complexity == $O(mn^{2}/w)$ words (https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2966288/pdf/1471-2105-11-S8-S1.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1998 == Reference == https://link.springer.com/chapter/10.1007/BFb0054337")
• 10:34, 15 February 2023 Admin talk contribs created page Perumalla and Deo (1D Maximum Subarray Maximum Subarray Problem) (Created page with "== Time Complexity == $O(log n)$ == Space Complexity == $O(n)$ auxiliary words (constant number of arrays as outlined in algorithm) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == EREW PRAM == Year == 1995 == Reference == https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.24.1291&rep=rep1&type=pdf")
• 10:34, 15 February 2023 Admin talk contribs created page Kadane's Algorithm (1D Maximum Subarray Maximum Subarray Problem) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ auxiliary words (keep track of current tail sum and best sum) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1982 == Reference == -")
• 10:34, 15 February 2023 Admin talk contribs created page Shamos (1D Maximum Subarray Maximum Subarray Problem) (Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == $O(log n)$ auxiliary words (keep track of recursive maximums) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1978 == Reference == -")
• 10:34, 15 February 2023 Admin talk contribs created page Faster Brute Force (via x(L:U) = x(L:U-1)+x(U)) (1D Maximum Subarray Maximum Subarray Problem) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O({1})$ auxiliary words (keep track of which subarray is being computed, along with current maximum) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1977 == Reference == https://dl.acm.org/doi/pdf/10.1145/358234.381162")
• 10:34, 15 February 2023 Admin talk contribs created page Grenander (1D Maximum Subarray Maximum Subarray Problem) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n)$ words (storing precomputed cumulative sums) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1977 == Reference == -")
• 10:34, 15 February 2023 Admin talk contribs created page Brute Force (1D Maximum Subarray Maximum Subarray Problem) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == $O({1})$ auxiliary words (keep track of which subarray is being computed, along with current maximum) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1977 == Reference == -")
• 10:34, 15 February 2023 Admin talk contribs created page Bringman (Subset Sum The Subset-Sum Problem) (Created page with "== Time Complexity == $\tilde{O}(nt^{1+\epsilon})$ == Space Complexity == \tilde{O}(nt^\epsilon) (https://arxiv.org/abs/1610.04712) == Description == == Approximate? == Approximate Approximation Factor: (n+t)^{-\Omega(1)} error == Randomized? == Yes, Monte Carlo == Model of Computation == == Year == 2017 == Reference == https://arxiv.org/abs/1610.04712")
• 10:34, 15 February 2023 Admin talk contribs created page Koiliaris and Xu (Subset Sum The Subset-Sum Problem) (Created page with "== Time Complexity == $\tilde{O}(min{\sqrt{n'}t, t^{5/4}, σ})$ == Space Complexity == $O(t)$ (https://dl.acm.org/doi/pdf/10.1145/3329863, Table 1) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 2019 == Reference == https://dl.acm.org/doi/pdf/10.1145/3329863")
• 10:34, 15 February 2023 Admin talk contribs created page Psinger (Subset Sum The Subset-Sum Problem) (Created page with "== Time Complexity == $O(n max(S))$ == Space Complexity == $O(t)$ (https://dl.acm.org/doi/pdf/10.1145/3329863, Table 1) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1999 == Reference == https://www.sciencedirect.com/science/article/abs/pii/S0196677499910349")
• 10:34, 15 February 2023 Admin talk contribs created page Bellman dynamic programming algorithm (Subset Sum The Subset-Sum Problem) (Created page with "== Time Complexity == $O(n t)$ == Space Complexity == $O(t)$ (https://dl.acm.org/doi/pdf/10.1145/3329863, Table 1) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1956 == Reference == https://onlinelibrary.wiley.com/doi/10.1002/nav.3800030107")
• 10:34, 15 February 2023 Admin talk contribs created page Horowitz and Sahni (Subset Sum The Subset-Sum Problem) (Created page with "== Time Complexity == $O({2}^{(n/{2})})$ == Space Complexity == $O({2}^{(n/{2})$}) (https://dl.acm.org/doi/10.1145/321812.321823) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1974 == Reference == https://dl.acm.org/doi/10.1145/321812.321823")
• 10:34, 15 February 2023 Admin talk contribs created page R-tree (Nearest Neighbor Search (NNS) Nearest Neighbor Search) (Created page with "== Time Complexity == R-Tree construction: $O(n log n)$ NNS: $O(n)$ == Space Complexity == $O(log n)$ (https://www.sciencedirect.com/science/article/pii/S1877050915019675, Table 2) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1984 == Reference == http://www-db.deis.unibo.it/courses/SI-LS/papers/Gut84.pdf")
• 10:34, 15 February 2023 Admin talk contribs created page K-d Tree (Nearest Neighbor Search (NNS) Nearest Neighbor Search) (Created page with "== Time Complexity == k-d Tree construction: $O(n log n)$ NNS: $O(n)$ == Space Complexity == $O(n)$ (https://dl.acm.org/doi/pdf/10.1145/355744.355745) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1975 == Reference == https://dl.acm.org/doi/pdf/10.1145/355744.355745")
• 10:34, 15 February 2023 Admin talk contribs created page Linear search (Nearest Neighbor Search (NNS) Nearest Neighbor Search) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ (Derived: Only ever storing the current shortest distance and the corresponding node) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1940 == Reference == -")
• 10:34, 15 February 2023 Admin talk contribs created page Zhao-Saalfeld ( Line Simplification) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(n)$ (Derived: There is an auxiliary sleeve set that is $O(n)$ size worst-case) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1997 == Reference == http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.494.7321")
• 10:34, 15 February 2023 Admin talk contribs created page Lang simplification ( Line Simplification) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ (Derived: The only auxiliary space used is the current search line and the distance from a point in the search interval to the search line, which is all $O(1)$ space) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1969 == Reference == -")
• 10:34, 15 February 2023 Admin talk contribs created page Opheim simplification ( Line Simplification) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ (Derived: The only auxiliary space used is the current search ray and the current best, the distances from the next point to the ray and to the ray's origin, candidate point to stay in the simplified line) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1981 == Reference == http://dx.doi.org/10.2312/eg.19811012")
• 10:34, 15 February 2023 Admin talk contribs created page Reumann–Witkam ( Line Simplification) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ (Derived: The only auxiliary space used is the current search line and the distance from the next point to the line.) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1974 == Reference ==")
• 10:34, 15 February 2023 Admin talk contribs created page Visvalingam–Whyatt ( Line Simplification) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n)$ (Derived: Storing each points effective area) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1993 == Reference == https://hull-repository.worktribe.com/output/459275")
• 10:33, 15 February 2023 Admin talk contribs created page Ramer–Douglas–Peucker algorithm ( Line Simplification) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n)$? (Derived: Recursive algorithm that has a worst-case recursion tree depth of O(n)?) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1972 == Reference == https://www.sciencedirect.com/science/article/abs/pii/S0146664X72800170")
• 10:33, 15 February 2023 Admin talk contribs created page Long Multiplication ( Multiplication) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n)$ auxiliary bits (Easily derived (needed for intermediate results)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1940 == Reference ==")
• 10:33, 15 February 2023 Admin talk contribs created page Toom-3 ( Multiplication) (Created page with "== Time Complexity == $O(n^{1.{4}6})$ == Space Complexity == $O(n)$ auxiliary bits (Re-use space across recursive subcalls (to obtain the recursion S(n) = S(n/3)+O(n))) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1969 == Reference == https://www.ams.org/journals/tran/1969-142-00/S0002-9947-1969-0249212-8/S0002-9947-1969-0249212-8.pdf")
• 10:33, 15 February 2023 Admin talk contribs created page Karatsuba Algorithm ( Multiplication) (Created page with "== Time Complexity == $O(n^{1.{5}8})$ == Space Complexity == $O(n)$ auxiliary bits (Re-use space across recursive subcalls (to obtain the recursion S(n) = S(n/2)+O(n))) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1962 == Reference == http://www.mathnet.ru/php/archive.phtml?wshow=paper&jrnid=dan&paperid=26729&option_lang=eng")
• 10:33, 15 February 2023 Admin talk contribs created page Rabin–Scott powerset construction ( NFA to DFA conversion) (Created page with "== Time Complexity == $O({2}^n)$ == Space Complexity == $O({1})$ (Derived: besides the O(2^n) output nodes and the O(n) input nodes, there's nothing to store) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1959 == Reference == https://ieeexplore.ieee.org/document/5392601")
• 10:33, 15 February 2023 Admin talk contribs created page Fast clipping (Rectangular Window Line Clipping) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ auxiliary words (Easily derived (O(1) per segment, space can be re-used)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1987 == Reference == https://www.sciencedirect.com/science/article/pii/0097849387900616")
• 10:33, 15 February 2023 Admin talk contribs created page Nicholl–Lee–Nicholl (Rectangular Window Line Clipping) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ auxiliary words (Easily derived (O(1) per segment, space can be re-used)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1987 == Reference == https://dl.acm.org/doi/10.1145/37401.37432")
• 10:33, 15 February 2023 Admin talk contribs created page Cyrus–Beck (Convex Polygonal Window; Convex Polyhedral window Line Clipping) (Created page with "== Time Complexity == $O(np)$ == Space Complexity == $O({1})$ auxiliary? words (Easily derived? (O(1) per segment, space can be re-used)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1978 == Reference == https://www.sciencedirect.com/science/article/pii/0097849378900213")
• 10:33, 15 February 2023 Admin talk contribs created page Liang–Barsky (Rectangular Window Line Clipping) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ auxiliary words (Easily derived (O(1) per segment, space can be re-used)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1984 == Reference == https://dl.acm.org/doi/10.1145/357332.357333")
• 10:33, 15 February 2023 Admin talk contribs created page Cohen–Sutherland (Rectangular Window Line Clipping) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ auxiliary words (Easily derived (O(1) per segment, space can be re-used)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1967 == Reference == https://books.google.com/books/about/Principles_of_interactive_computer_graph.html?id=inJ8AAAAIAAJ")
• 10:33, 15 February 2023 Admin talk contribs created page David Sankoff (Edit sequence, global alignment Sequence Alignment) (Created page with "== Time Complexity == $O(mn)$ == Space Complexity == $O(mn)$ words (Uses a constant number of m*n arrays, whose contents are of size O(1)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1972 == Reference == https://www.ncbi.nlm.nih.gov/pmc/articles/PMC427531/")
• 10:33, 15 February 2023 Admin talk contribs created page Myers and Miller (Edit sequence, local alignment Sequence Alignment) (Created page with "== Time Complexity == $O(mn)$ == Space Complexity == $O(n+log(m)$) words (https://academic.oup.com/bioinformatics/article/4/1/11/205106?login=true) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1988 == Reference == https://academic.oup.com/bioinformatics/article/4/1/11/205106?login=true")
• 10:33, 15 February 2023 Admin talk contribs created page Altschul and Erickson (Edit sequence, local alignment Sequence Alignment) (Created page with "== Time Complexity == $O(mn)$ == Space Complexity == $O(mn)$ words (Uses a constant number of m*n arrays, whose contents are of size O(1)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1986 == Reference == https://link.springer.com/article/10.1007/BF02462326")
• 10:33, 15 February 2023 Admin talk contribs created page Gotoh (Edit sequence, local alignment Sequence Alignment) (Created page with "== Time Complexity == $O(mn)$ == Space Complexity == $O(mn)$ words (Uses a constant number of m*n arrays, whose contents are of size O(1)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1982 == Reference == https://www.sciencedirect.com/science/article/pii/0022283682903989")
• 10:33, 15 February 2023 Admin talk contribs created page FASTA (Edit sequence, local alignment Sequence Alignment) (Created page with "== Time Complexity == $O(mn)$ == Space Complexity == $O(mn)$ words (Uses an m*n array, whose contents are of size O(1)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1985 == Reference == https://www.ncbi.nlm.nih.gov/pubmed/2983426")
• 10:33, 15 February 2023 Admin talk contribs created page Hirschberg's algorithm (Edit sequence, constant-size alphabet Sequence Alignment) (Created page with "== Time Complexity == $O(mn)$ == Space Complexity == $O(n)$ words (https://dl.acm.org/doi/10.1145/360825.360861) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1975 == Reference == http://www.mathcs.emory.edu/~cheung/Courses/323/Syllabus/DynProg/Docs/Hirschberg-LCS-1975.pdf")
• 10:33, 15 February 2023 Admin talk contribs created page Masek; Patterson (Edit distance, constant-size alphabet Sequence Alignment) (Created page with "== Time Complexity == $O(mn / log(n))$ == Space Complexity == $O(n)$ words (https://www.sciencedirect.com/science/article/pii/0022000080900021?via%3Dihub) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1980 == Reference == https://www.sciencedirect.com/science/article/pii/0022000080900021")
• 10:33, 15 February 2023 Admin talk contribs created page Smith–Waterman algorithm (Edit sequence, local alignment Sequence Alignment) (Created page with "== Time Complexity == $O(mn^{2})$ == Space Complexity == $O(mn)$ words (Uses an m*n array, whose contents are of size O(1)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1981 == Reference == https://www.sciencedirect.com/science/article/pii/0022283681900875")
• 10:33, 15 February 2023 Admin talk contribs created page Needleman–Wunsch algorithm (Edit sequence, global alignment Sequence Alignment) (Created page with "== Time Complexity == $O(mn)$ == Space Complexity == $O(mn)$ words (Uses an m*n array, whose contents are of size O(1)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1970 == Reference == https://www.sciencedirect.com/science/article/pii/0022283670900574")
• 10:33, 15 February 2023 Admin talk contribs created page Rabin-Karp (RK) algorithm (Single String Search String Search) (Created page with "== Time Complexity == $O(mn)$ == Space Complexity == $O({1})$ words (Derived: only storing a rolling hash) == Description == Hashing-based, compare the text and patterns via their hash functions == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1987 == Reference == https://pdfs.semanticscholar.org/c47d/151f09c567013761632c89e237431c6291a2.pdf")

(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)