forked from IITH-Compilers/IR2Vec
-
Notifications
You must be signed in to change notification settings - Fork 0
Files
/
Copy pathTimeTaken_Algos.csv
72 lines (72 loc) · 2.27 KB
/
TimeTaken_Algos.csv
1 | Benchmarks | FA | SYM |
---|---|---|---|
2 | birthday-paradox | 32.83 | 32.17 |
3 | tower-of-hanoi | 36.50 | 34.33 |
4 | largest-sum-contiguous-subarray | 36.67 | 35.67 |
5 | rotate-bits-of-an-integer | 36.83 | 33.17 |
6 | min-cost-path | 37.33 | 33.83 |
7 | nth-fibonacci-number | 37.50 | 31.83 |
8 | longest-increasing-subsequence | 37.67 | 32.83 |
9 | sort-n-numbers-linear-time | 40.33 | 35.83 |
10 | dfa-based-division | 40.83 | 34.17 |
11 | lexicographic-rank-of-a-string | 43.33 | 37.50 |
12 | insertion-sort-linked-list | 44.50 | 35.33 |
13 | permutations-string | 44.50 | 37.67 |
14 | largest-independent-set | 44.67 | 40.33 |
15 | channel-assignment | 45.00 | 37.00 |
16 | anagram-substring | 47.00 | 38.17 |
17 | rod-cutting | 47.33 | 35.00 |
18 | n-queen | 48.00 | 35.00 |
19 | binary-insertion-sort | 49.00 | 37.50 |
20 | kth-smallest-largest-element | 49.17 | 39.33 |
21 | m-coloring | 49.50 | 34.00 |
22 | mergeSort_LinkedList | 49.67 | 40.83 |
23 | edit-distance | 49.83 | 41.67 |
24 | quicksort-for-linked-list | 50.67 | 42.17 |
25 | binomial-coefficient | 52.50 | 33.50 |
26 | maximum-sum-increasing-subsequence | 52.83 | 36.00 |
27 | k-closest-elements | 53.50 | 39.33 |
28 | merge-sort-for-doubly-linked-list | 54.67 | 41.33 |
29 | knights-tour | 55.17 | 38.83 |
30 | hamiltonian-cycle-backtracking | 55.50 | 42.00 |
31 | kmp | 59.67 | 41.00 |
32 | quicksort-linked-list | 59.83 | 41.50 |
33 | longest-palindrome-substring | 60.17 | 41.50 |
34 | rabin-karp | 60.17 | 38.50 |
35 | Iterative_QuickSort | 66.17 | 41.17 |
36 | sudoku | 66.17 | 44.50 |
37 | palindrome-partitioning | 67.00 | 38.67 |
38 | boyer-moore | 71.33 | 44.67 |
39 | subset-sum | 72.00 | 37.83 |
40 | transitive-closure-of-a-graph | 72.83 | 36.17 |
41 | longest-bitonic-subsequence | 76.17 | 38.67 |
42 | shortest-common-supersequence | 76.17 | 38.50 |
43 | floyd-warshall | 77.17 | 40.50 |
44 | dfs | 77.50 | 62.50 |
45 | partition-problem | 81.33 | 37.67 |
46 | bellman-ford | 82.00 | 48.83 |
47 | vertex-cover-problem | 83.00 | 62.67 |
48 | cycle-in-a-graph | 83.33 | 64.67 |
49 | cycle-undirected-graph | 84.50 | 62.33 |
50 | box-stacking | 85.50 | 46.83 |
51 | optimal-binary-search-tree | 95.50 | 41.33 |
52 | karatsuba | 97.00 | 70.33 |
53 | bfs | 98.33 | 74.00 |
54 | trie-suffixes | 99.17 | 71.83 |
55 | longest-palindromic-subsequence | 103.83 | 36.17 |
56 | matrix-chain-multiplication | 105.50 | 39.17 |
57 | biconnectivity | 107.33 | 72.00 |
58 | cut-vertices | 110.17 | 74.17 |
59 | eulerian-path-and-circuit | 115.00 | 83.83 |
60 | graph-coloring | 118.00 | 78.00 |
61 | euler-circuit-directed-graph | 126.83 | 87.00 |
62 | boruvkas | 140.50 | 50.00 |
63 | weighted-job-scheduling | 149.33 | 98.83 |
64 | topological-sorting | 188.33 | 137.67 |
65 | tarjan | 204.50 | 142.83 |
66 | aho-corasick | 205.17 | 132.00 |
67 | strongly-connected-components | 215.00 | 143.33 |
68 | longest-path-directed-acyclic-graph | 234.00 | 156.17 |
69 | Nearly-sorted-algo | 246.00 | 171.17 |
70 | minimum-cut-in-a-directed-graph | 247.67 | 120.17 |
71 | kasai | 389.67 | 190.17 |
72 | boolean-parenthesization-problem | 1442.67 | 48.33 |