├── .gitignore ├── .htaccess ├── Mainscreen.png ├── README.md ├── book.html ├── book.php ├── book ├── book.aux ├── book.html ├── book.log ├── book.pdf ├── book.synctex.gz ├── book.tex └── book.toc ├── composer.json ├── data ├── AVL_Tree.txt ├── Adjacency_List.txt ├── Adjacency_Matrix.txt ├── Advanced_Data_Structures.txt ├── Advanced_Dynamic_Programming.txt ├── Advanced_Graph_Theory.txt ├── Advanced_Recursion.txt ├── Arrays.txt ├── Backtracking.txt ├── Basics.txt ├── Bellman_Ford.txt ├── Binary.txt ├── Binary_Search.txt ├── Binary_Search_Tree.txt ├── Binary_Tree.txt ├── Boolean.txt ├── Bozo_Sort.txt ├── Breadth_First_Search.txt ├── Breath_First_Search.txt ├── Bubble_Sort.txt ├── Character.txt ├── Cheat_Sheat.txt ├── Coin_Problem.txt ├── Connected_Components.txt ├── Control_Structures.txt ├── Cycle_detection.txt ├── Data_Structures.txt ├── Data_Types.txt ├── Depth_First_Search.txt ├── Dijkstra's.txt ├── Dynamic_Programming.txt ├── Float.txt ├── Flood_Fill.txt ├── Floyd_Warshall.txt ├── Functions.txt ├── Fundamentals.txt ├── Geometry.txt ├── Getting_Started.txt ├── Gift_wrapping.txt ├── Graph_Representations.txt ├── Graph_Theory.txt ├── Greedy_Algorithm.txt ├── Hash_Map.txt ├── Hash_Set.txt ├── Hash_Sets.txt ├── Heap.txt ├── Heap_Sort.txt ├── Input_Ouput.txt ├── Input_Output.txt ├── Insertion_Sort.txt ├── Integer.txt ├── Knapsack_Problem.txt ├── Kruskal.txt ├── Line_Sweeping.txt ├── Linked_List.txt ├── Longest_Common_Subsequence.txt ├── Maps.txt ├── Merge_Sort.txt ├── Minimum_Spanning_Tree.txt ├── Miracle_Sort.txt ├── Number_Theory.txt ├── Pattern_Matching.txt ├── Permutation_Sort.txt ├── Prim's.txt ├── Priority_Queue.txt ├── Queue.txt ├── Quick_Sort.txt ├── Recursion.txt ├── Runtime_and_Memory.txt ├── Searches.txt ├── Selection_Sort.txt ├── Sets.txt ├── Shortest_Path.txt ├── Sorting.txt ├── Spanning_Tree.txt ├── Stack.txt ├── Strings.txt ├── Ternary_Search.txt ├── Topics.txt ├── Topological_Sorting.txt ├── Tree.txt ├── Tree_Map.txt ├── Tree_Set.txt ├── Trees.txt ├── Vector.txt ├── breadcrumbs.txt ├── cheat_sheet.txt ├── exercises.txt ├── interviews.txt └── todo.txt ├── index.php ├── manifest.txt ├── public_html ├── TheComputerScienceHandbook.pdf ├── img │ ├── favicon.png │ ├── icon-algorithms-hover.png │ ├── icon-algorithms.png │ ├── icon-guys-hover.png │ ├── icon-guys.png │ ├── icon-website-hover.png │ ├── icon-website.png │ ├── icon_algorithms.png │ ├── icon_guys.png │ ├── icon_website.png │ ├── link.png │ ├── link_large.png │ ├── logo.png │ ├── logo.psd │ ├── logo_hover.png │ ├── nav-icon.png │ ├── raw │ │ ├── adt.png │ │ ├── array.png │ │ ├── array2.png │ │ ├── array3.png │ │ ├── backtracking.png │ │ ├── basic.png │ │ ├── bellmanford.png │ │ ├── bellmanford2.png │ │ ├── bellmanford3.png │ │ ├── bellmanford4.png │ │ ├── bellmanford5.png │ │ ├── bfs.png │ │ ├── binarysearch.png │ │ ├── binarytree.png │ │ ├── bottle.png │ │ ├── bst-rem-case1.png │ │ ├── bst-rem-case11.png │ │ ├── bst-rem-case12.png │ │ ├── bst-rem-case2.png │ │ ├── bst-rem-case21.png │ │ ├── bst-rem-case22.png │ │ ├── bst-rem-case3.png │ │ ├── bst-rem-case31.png │ │ ├── bst-rem-case32.png │ │ ├── bst-rem-case33.png │ │ ├── bst-rem-case34.png │ │ ├── bst-rem.png │ │ ├── bst.png │ │ ├── bstcompare.png │ │ ├── bstcontains.png │ │ ├── bstcontains2.png │ │ ├── bstcontains3.png │ │ ├── bstcontains4.png │ │ ├── bstinsert.png │ │ ├── bstinsert2.png │ │ ├── bstinsert3.png │ │ ├── bstinsert4.png │ │ ├── bubble_sort.png │ │ ├── bucket.png │ │ ├── bucket2.png │ │ ├── bucket3.png │ │ ├── bucket4.png │ │ ├── centergraph.png │ │ ├── connectedcomponents.png │ │ ├── connectedcomponents2.png │ │ ├── connectedcomponents3.png │ │ ├── connectedcomponents4.png │ │ ├── connectedcomponents5.png │ │ ├── connectedcomponents6.png │ │ ├── connectedcomponents7.png │ │ ├── connectedcomponents8.png │ │ ├── controlstruct.png │ │ ├── convexhull.png │ │ ├── convexhull2.png │ │ ├── couplematch.png │ │ ├── couplematch2.png │ │ ├── cycle.png │ │ ├── cycle2.png │ │ ├── dfs-postorder.png │ │ ├── dfs-preorder.png │ │ ├── dfs.png │ │ ├── digraph.png │ │ ├── directedcycle.png │ │ ├── djikstra.png │ │ ├── djikstra1.png │ │ ├── djikstra2.png │ │ ├── djikstra3.png │ │ ├── djikstra4.png │ │ ├── djikstra5.png │ │ ├── djikstra6.png │ │ ├── doublelinkedlist.png │ │ ├── enumerate-sets.png │ │ ├── floodfill.png │ │ ├── floydwarshall.png │ │ ├── floydwarshall1.png │ │ ├── gasproblem.png │ │ ├── gasproblem1.png │ │ ├── gasproblem2.png │ │ ├── gasproblem3.png │ │ ├── gasproblem4.png │ │ ├── gasproblem5.png │ │ ├── gasproblem6.png │ │ ├── gasproblem7.png │ │ ├── gasproblem8.png │ │ ├── graph.png │ │ ├── hanoi.png │ │ ├── hanoi2.png │ │ ├── hanoi3.png │ │ ├── hanoi4.png │ │ ├── hanoi5.png │ │ ├── hanoi6.png │ │ ├── hashcode.png │ │ ├── hashset.png │ │ ├── hashsetcontains.png │ │ ├── hashsetcontains2.png │ │ ├── hashsetcontains3.png │ │ ├── hashsetinsert.png │ │ ├── hashsetrem.png │ │ ├── hashsetrem2.png │ │ ├── hashsetrem3.png │ │ ├── insertion_sort.png │ │ ├── intervalschedule.png │ │ ├── intervalschedule2.png │ │ ├── intervalschedule3.png │ │ ├── intervalschedule4.png │ │ ├── kruskal.png │ │ ├── kruskal2.png │ │ ├── kruskal3.png │ │ ├── kruskal4.png │ │ ├── kruskal5.png │ │ ├── kruskal6.png │ │ ├── kruskal7.png │ │ ├── linked_list_converge.png │ │ ├── linkedlist.png │ │ ├── linkedlist2.png │ │ ├── linkedlist3.png │ │ ├── linkedlist4.png │ │ ├── linkedlistget.png │ │ ├── linkedlistget2.png │ │ ├── linkedlistget3.png │ │ ├── linkedlistinsert.png │ │ ├── linkedlistinsert2.png │ │ ├── linkedlistpop.png │ │ ├── linkedlistpop2.png │ │ ├── linkedlistpush.png │ │ ├── linkedlistpush1.png │ │ ├── linkedlistpush2.png │ │ ├── linkedlistpush3.png │ │ ├── linkedlistrem.png │ │ ├── linkedlistrem2.png │ │ ├── maxheap.png │ │ ├── maxheap2.png │ │ ├── maxheappop.png │ │ ├── maxheappop1.png │ │ ├── maxheappop2.png │ │ ├── maxheappop3.png │ │ ├── maxheappush.png │ │ ├── maxheappush2.png │ │ ├── maxheappush3.png │ │ ├── mergesort.png │ │ ├── nqueen.gif │ │ ├── nqueen.jpg │ │ ├── nqueen.png │ │ ├── nqueen1.png │ │ ├── nqueen2.png │ │ ├── nqueen3.png │ │ ├── pqueue.png │ │ ├── pqueuepop.png │ │ ├── pqueuepush.png │ │ ├── prim.png │ │ ├── prim1.png │ │ ├── prim2.png │ │ ├── prim3.png │ │ ├── prim4.png │ │ ├── prim5.png │ │ ├── prim6.png │ │ ├── prim7.png │ │ ├── queue.png │ │ ├── queue2.png │ │ ├── quicksort.png │ │ ├── recursion_grid.png │ │ ├── recursion_grid2.png │ │ ├── selection_sort.png │ │ ├── spanningtree.png │ │ ├── stack.png │ │ ├── stack2.png │ │ ├── strongconnected.png │ │ ├── ternarycase1.png │ │ ├── ternarycase11.png │ │ ├── ternarycase12.png │ │ ├── ternarycase2.png │ │ ├── ternarycase21.png │ │ ├── ternarycase22.png │ │ ├── ternarysearch.png │ │ ├── ternarysearch2.png │ │ ├── ternarysearch3.png │ │ ├── ternarysearch4.png │ │ ├── ternarysearch5.png │ │ ├── ternarysearch6.png │ │ ├── ternarysearch7.png │ │ ├── topsort.png │ │ ├── tree.png │ │ ├── treegraph.png │ │ ├── treeroot.png │ │ ├── vector.png │ │ ├── vector2.png │ │ ├── vector3.png │ │ ├── vector4.png │ │ ├── vectorget.png │ │ ├── vectorinsert.png │ │ └── vectorinsert2.png │ ├── squared_metal.png │ └── uploads │ │ ├── adt.png │ │ ├── array.png │ │ ├── array2.png │ │ ├── array3.png │ │ ├── backtracking.png │ │ ├── basic.png │ │ ├── bellmanford.png │ │ ├── bellmanford2.png │ │ ├── bellmanford3.png │ │ ├── bellmanford4.png │ │ ├── bellmanford5.png │ │ ├── bfs.png │ │ ├── binarysearch.png │ │ ├── binarytree.png │ │ ├── bottle.png │ │ ├── bst-rem-case1.png │ │ ├── bst-rem-case11.png │ │ ├── bst-rem-case12.png │ │ ├── bst-rem-case2.png │ │ ├── bst-rem-case21.png │ │ ├── bst-rem-case22.png │ │ ├── bst-rem-case3.png │ │ ├── bst-rem-case31.png │ │ ├── bst-rem-case32.png │ │ ├── bst-rem-case33.png │ │ ├── bst-rem-case34.png │ │ ├── bst-rem.png │ │ ├── bst.png │ │ ├── bstcompare.png │ │ ├── bstcontains.png │ │ ├── bstcontains2.png │ │ ├── bstcontains3.png │ │ ├── bstcontains4.png │ │ ├── bstinsert.png │ │ ├── bstinsert2.png │ │ ├── bstinsert3.png │ │ ├── bstinsert4.png │ │ ├── bubble_sort.png │ │ ├── bucket.png │ │ ├── bucket2.png │ │ ├── bucket3.png │ │ ├── bucket4.png │ │ ├── centergraph.png │ │ ├── connectedcomponents.png │ │ ├── connectedcomponents2.png │ │ ├── connectedcomponents3.png │ │ ├── connectedcomponents4.png │ │ ├── connectedcomponents5.png │ │ ├── connectedcomponents6.png │ │ ├── connectedcomponents7.png │ │ ├── connectedcomponents8.png │ │ ├── controlstruct.png │ │ ├── convexhull.png │ │ ├── convexhull2.png │ │ ├── couplematch.png │ │ ├── couplematch2.png │ │ ├── cycle.png │ │ ├── cycle2.png │ │ ├── dfs-postorder.png │ │ ├── dfs-preorder.png │ │ ├── dfs.png │ │ ├── digraph.png │ │ ├── djikstra.png │ │ ├── djikstra1.png │ │ ├── djikstra2.png │ │ ├── djikstra3.png │ │ ├── djikstra4.png │ │ ├── djikstra5.png │ │ ├── djikstra6.png │ │ ├── doublelinkedlist.png │ │ ├── enumerate-sets.png │ │ ├── floodfill.png │ │ ├── floydwarshall.png │ │ ├── floydwarshall1.png │ │ ├── gasproblem.png │ │ ├── gasproblem1.png │ │ ├── gasproblem2.png │ │ ├── gasproblem3.png │ │ ├── gasproblem4.png │ │ ├── gasproblem5.png │ │ ├── gasproblem6.png │ │ ├── gasproblem7.png │ │ ├── gasproblem8.png │ │ ├── graph.png │ │ ├── hanoi.png │ │ ├── hanoi2.png │ │ ├── hanoi3.png │ │ ├── hanoi4.png │ │ ├── hanoi5.png │ │ ├── hanoi6.png │ │ ├── hashcode.png │ │ ├── hashset.png │ │ ├── hashsetcontains.png │ │ ├── hashsetcontains2.png │ │ ├── hashsetcontains3.png │ │ ├── hashsetinsert.png │ │ ├── hashsetrem.png │ │ ├── hashsetrem2.png │ │ ├── hashsetrem3.png │ │ ├── insertion_sort.png │ │ ├── intervalschedule.png │ │ ├── intervalschedule2.png │ │ ├── intervalschedule3.png │ │ ├── intervalschedule4.png │ │ ├── kruskal.png │ │ ├── kruskal2.png │ │ ├── kruskal3.png │ │ ├── kruskal4.png │ │ ├── kruskal5.png │ │ ├── kruskal6.png │ │ ├── kruskal7.png │ │ ├── linkedlist.png │ │ ├── linkedlist2.png │ │ ├── linkedlist3.png │ │ ├── linkedlist4.png │ │ ├── linkedlistconverge.png │ │ ├── linkedlistget.png │ │ ├── linkedlistget2.png │ │ ├── linkedlistget3.png │ │ ├── linkedlistinsert.png │ │ ├── linkedlistinsert2.png │ │ ├── linkedlistpop.png │ │ ├── linkedlistpop2.png │ │ ├── linkedlistpush.png │ │ ├── linkedlistpush1.png │ │ ├── linkedlistpush2.png │ │ ├── linkedlistpush3.png │ │ ├── linkedlistrem.png │ │ ├── linkedlistrem2.png │ │ ├── maxheap.png │ │ ├── maxheap2.png │ │ ├── maxheappop.png │ │ ├── maxheappop1.png │ │ ├── maxheappop2.png │ │ ├── maxheappop3.png │ │ ├── maxheappush.png │ │ ├── maxheappush2.png │ │ ├── maxheappush3.png │ │ ├── mergesort.png │ │ ├── nqueen.gif │ │ ├── nqueen.jpg │ │ ├── nqueen.png │ │ ├── nqueen1.png │ │ ├── nqueen2.png │ │ ├── nqueen3.png │ │ ├── pqueue.png │ │ ├── pqueuepop.png │ │ ├── pqueuepush.png │ │ ├── prim.png │ │ ├── prim1.png │ │ ├── prim2.png │ │ ├── prim3.png │ │ ├── prim4.png │ │ ├── prim5.png │ │ ├── prim6.png │ │ ├── prim7.png │ │ ├── queue.png │ │ ├── queue2.png │ │ ├── quicksort.png │ │ ├── recursion_grid.png │ │ ├── recursion_grid2.png │ │ ├── selection_sort.png │ │ ├── spanningtree.png │ │ ├── stack.png │ │ ├── stack2.png │ │ ├── strongconnected.png │ │ ├── ternarycase1.png │ │ ├── ternarycase11.png │ │ ├── ternarycase12.png │ │ ├── ternarycase2.png │ │ ├── ternarycase21.png │ │ ├── ternarycase22.png │ │ ├── ternarysearch.png │ │ ├── ternarysearch2.png │ │ ├── ternarysearch3.png │ │ ├── ternarysearch4.png │ │ ├── ternarysearch5.png │ │ ├── ternarysearch6.png │ │ ├── ternarysearch7.png │ │ ├── topsort.png │ │ ├── tree.png │ │ ├── treegraph.png │ │ ├── treeroot.png │ │ ├── vector.png │ │ ├── vector2.png │ │ ├── vector3.png │ │ ├── vector4.png │ │ ├── vectorget.png │ │ ├── vectorinsert.png │ │ └── vectorinsert2.png ├── js │ ├── nested_nav.js │ ├── responsive_nav.js │ ├── responsive_table.js │ └── side_nav.js ├── sitemap.xml ├── stylesheets │ ├── about.css │ ├── header_footer.css │ ├── list.css │ ├── reset.css │ └── responsive_nav.css └── vendor │ ├── prettify │ ├── desert.css │ ├── lang-apollo.js │ ├── lang-basic.js │ ├── lang-clj.js │ ├── lang-css.js │ ├── lang-dart.js │ ├── lang-erlang.js │ ├── lang-go.js │ ├── lang-hs.js │ ├── lang-lisp.js │ ├── lang-llvm.js │ ├── lang-lua.js │ ├── lang-matlab.js │ ├── lang-ml.js │ ├── lang-mumps.js │ ├── lang-n.js │ ├── lang-pascal.js │ ├── lang-proto.js │ ├── lang-r.js │ ├── lang-rd.js │ ├── lang-scala.js │ ├── lang-sql.js │ ├── lang-tcl.js │ ├── lang-tex.js │ ├── lang-vb.js │ ├── lang-vhdl.js │ ├── lang-wiki.js │ ├── lang-xq.js │ ├── lang-yaml.js │ ├── prettify.css │ ├── prettify.js │ └── run_prettify.js │ └── typeahead │ ├── typeahead.css │ └── typeahead.js ├── scripts ├── breadcrumbs.php ├── checkCode.php ├── createDB.php ├── enumExer.php ├── migrateData.php ├── resizeImg.php └── saveData.php ├── src ├── db.php └── parser.php └── templates ├── about.html.php ├── donate.html.php ├── donateFooter.php ├── edit.html.php ├── indexFooter.php ├── indexHeader.php ├── list.html.php ├── listFooter.php ├── listHeader.php ├── main.html.php └── nav.php /.gitignore: -------------------------------------------------------------------------------- 1 | .idea/* 2 | .idea 3 | config/local_config.ini 4 | .gitignore 5 | .cache/* 6 | .cache 7 | composer.lock 8 | vendor/* 9 | book 10 | -------------------------------------------------------------------------------- /.htaccess: -------------------------------------------------------------------------------- 1 | RewriteEngine On 2 | 3 | RewriteCond %{REQUEST_FILENAME} !-f 4 | RewriteCond %{REQUEST_FILENAME} !-d 5 | 6 | RewriteCond $1 !^(index\.php) 7 | RewriteRule ^(.*)$ index.php/$1 [L] 8 | -------------------------------------------------------------------------------- /Mainscreen.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/Mainscreen.png -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | The CS Handbook is a online reference guide for learning algorithms and data structures in a way that could be understood without a strong math background. 4 | 5 | ## Home page 6 | 7 | ![Home page](Mainscreen.png?raw=true "Main page") 8 | 9 | ## Contributing 10 | 11 | All the articles are stored in /data as my flavour of Markdown and loaded into a databse by a script. 12 | Everything in /book is generated by book.php which gets articles from the database. 13 | 14 | To fix typos and other errors, make a Pull Request changing the appropriate file in /data. No other change 15 | is necessary. 16 | 17 | All contributors will be recognized. 18 | 19 | Contributors who make many PR's will be given a free book. 20 | 21 | ## setup 22 | 23 | ``` 24 | curl -sS https://getcomposer.org/installer | sudo php -- --install-dir=/usr/local/bin --filename=composer 25 | composer install 26 | ``` 27 | 28 | Create config/local_config.ini: 29 | 30 | ``` 31 | env=production 32 | 33 | sections[] = Getting Started 34 | sections[] = Fundamentals 35 | sections[] = Recursion 36 | sections[] = Sorting 37 | sections[] = Data Structures 38 | sections[] = Graph Theory 39 | sections[] = Searches 40 | sections[] = Dynamic Programming 41 | sections[] = Strings 42 | 43 | [db] 44 | host = localhost 45 | user=root 46 | password=YOURPASSWORD 47 | database = algorithms 48 | ``` 49 | 50 | Import articles into mysql 51 | 52 | ``` 53 | cd scripts 54 | php migrateData.php 55 | ``` 56 | -------------------------------------------------------------------------------- /book/book.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/book/book.pdf -------------------------------------------------------------------------------- /book/book.synctex.gz: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/book/book.synctex.gz -------------------------------------------------------------------------------- /composer.json: -------------------------------------------------------------------------------- 1 | { 2 | "require": { 3 | "php": ">= 5.4.0", 4 | "michelf/php-markdown": "1.4.0", 5 | "dispatch/dispatch":"4.x" 6 | } 7 | } 8 | -------------------------------------------------------------------------------- /data/AVL_Tree.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | An AVL tree is a balanced binary search tree where the left subtree and right subtree of each node differ in height by at most one. The definition is recursive as every subtree in an AVL tree is also a AVL tree. -------------------------------------------------------------------------------- /data/Adjacency_List.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | An adjacency list stores a graph in an array of [[linked lists|Linked Lists]]. Each node stores its neighbours by keeping a linked list of edges. Adjacency lists are slower when checking if an edge exists but they are more memory efficient since they only need to store the total number of edges. 4 | 5 | Example: 6 | 7 | {{graph.png}} 8 | 9 | The adjacency list of the graph is: 10 | 11 | Node | edges 12 | ---|----- 13 | 1 | 2 5 14 | 2 | 1 3 5 15 | 3 | 2 4 16 | 4 | 3 5 6 17 | 5 | 1 2 4 18 | 6 |4 19 | 20 | ## Implementation 21 | 22 | Here is a function that takes in an array of edges and returns an adjacency list of the graph. 23 | 24 | [[[[ 25 | class edge { 26 | int weight, source, dest; 27 | public edge(int source, int dest, int weight) { 28 | this.source = source; 29 | this.dest = dest; 30 | this.weight = weight; 31 | } 32 | } 33 | 34 | public static Vector> getAdjList(Vector edges, int n) { 35 | Vector> adjList = new Vector>(); 36 | for (int i = 0; i < n; i++){ 37 | adjList.add(new Vector()); 38 | } 39 | 40 | for(edge e: edges){ 41 | adjList.get(e.source).add(e); 42 | adjList.get(e.dest).add(e); 43 | } 44 | return adjList; 45 | } 46 | ]]]] -------------------------------------------------------------------------------- /data/Adjacency_Matrix.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | An adjacency matrix stores a graph of N nodes with a two dimensional NxN array. We let adjMatrix[i][j] represents the weight between the node i and node j. If we have a sparse graph which has many nodes but few edges, the memory storage will be very inefficient and it would be better to use an [[adjacency list|Adjacency List]]. However, if the graph is very dense, or there are few nodes, then an adjacency matrix is quick and easy to use. Checking if an edge exists between two nodes is O(1). 4 | 5 | Example: 6 | 7 | {{graph.png}} 8 | 9 | The adjacency matrix of the graph is: 10 | 11 | |1|2|3|4|5|6 12 | -|-|-|-|-|-|- 13 | 1 | 0 | 1 | 0 | 0 | 1 | 0 14 | 2 | 1 | 0 | 1 | 0 | 1 | 0 15 | 3 |0 | 1 | 0 | 1 | 0 | 0 16 | 4 | 0 | 0 | 1 | 0 | 1 |1 17 | 5 | 1 | 1 | 0 | 1 | 0 | 0 18 | 6 | 0 | 0 | 0 | 1 | 0 | 0 19 | 20 | ## Implementation 21 | 22 | [[[[ 23 | class edge { 24 | int weight, source, dest; 25 | public edge(int source, int dest, int weight) { 26 | this.source = source; 27 | this.dest = dest; 28 | this.weight = weight; 29 | } 30 | } 31 | 32 | public static int[][] getAdjMatrix(Vector edges, int n) { 33 | int adjMatrix[][] = new int[n][n]; 34 | 35 | for (int i = 0; i < n; i++) { 36 | for (int j = 0; j < n; j++) { 37 | adjMatrix[i][j] = 0; 38 | } 39 | } 40 | 41 | for (int i = 0; i < edges.size(); i++) { 42 | edge e = edges.get(i); 43 | adjMatrix[e.source][e.dest] = e.weight; 44 | adjMatrix[e.dest][e.source] = e.weight; 45 | } 46 | return adjMatrix; 47 | } 48 | ]]]] -------------------------------------------------------------------------------- /data/Advanced_Data_Structures.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | Advanced data structures are data structures that are very specific in performing a single task and they usually require more time to implement. 4 | 5 | ## [[Trees]] 6 | 7 | Trees are data structures that follow a hierarchy, each node has exactly one or zero parents and each node has children. 8 | 9 | Trees are recursive structures meaning that each child of a tree is also a tree. 10 | 11 | A tree within another tree is called a **subtree**. 12 | 13 | A **child** is a node that is below another node. A **parent** is a node that is above another node. 14 | 15 | The element at the top of the tree with no parents is called a **root**. The node at the bottom of the tree with no children is called a **leaf**. 16 | 17 | Each node can hold different kinds of information depending on the tree. A node can hold the children it has, the parent it has, a key associated with the node and a value associated with the node. 18 | 19 | ### B-tree 20 | 21 | A B-tree is a tree that keeps data sorted, insertions and deletions in O(log n) time. 22 | 23 | ### Binary Indexed Tree 24 | 25 | ### [[AVL Tree]] 26 | 27 | An AVL tree is a self balancing [[binary tree|Binary Tree]]. 28 | 29 | ### Red Black Tree 30 | 31 | ### Segment Tree 32 | 33 | ### Interval Tree 34 | 35 | ### Splay Tree 36 | 37 | ## [[Heap]] 38 | 39 | ### Fibonacci Heap 40 | 41 | ### Binomial Heap 42 | 43 | ## Trie 44 | 45 | A trie is tree which stores strings by their prefixes. A trie can replace a set for storing strings as it is faster than a hash set and it can the stored strings sorted but it takes more memory. 46 | 47 | Let m be the length of the string. 48 | 49 | | Operation | Membership | Insertion | Deletion 50 | |- 51 | | Time Complexity | O(m) | O(m) | O(m) -------------------------------------------------------------------------------- /data/Advanced_Graph_Theory.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | *Prerequisites*: [[Graph Theory]] 4 | 5 | Advanced topics on graph theory. 6 | 7 | ## Bipartite Graph 8 | 9 | A bipartite graph is a graph which can be partitioned into two sets such that no nodes in a set connect to another node in the same set. 10 | 11 | ## Special Paths 12 | 13 | A path is a certain order of visiting objects. 14 | 15 | ### [[Hamiltonian Path]] 16 | 17 | A [[Hamiltonian Path]] is a path that visits every node exactly once. 18 | 19 | ### [[Eulerian Path]] 20 | 21 | A [[Eulerian Path]] is a path that visited every edge exactly once. 22 | 23 | ## Special Cycles 24 | 25 | A cycle is a path that ends up at the same starting position. 26 | 27 | ### [[Hamiltonian Cycle]] 28 | 29 | A [[Hamiltonian cycle]] is a cycle that visits every node exactly once at ends back at the start. 30 | 31 | ### [[Eulerian Cycle]] 32 | 33 | A [[Eulerian Cycle]] is a cycle that visited every edge exactly once at ends back at the start. 34 | 35 | ### [[Travelling Salesman Problem]] 36 | 37 | The [[Travelling salesman]] is the problem where a salesman wants to find a cycle that minimizes the total cost of weights used of edges. 38 | 39 | ## Special Nodes 40 | 41 | Some graphs may have nodes that have special properties. 42 | 43 | ### Root 44 | 45 | A node in a directed acyclic graph that has no ancestors is a root. 46 | 47 | {{treeroot.png}} 48 | 49 | ### Center 50 | 51 | The center of a undirected tree is the node that minimizes the sum of the distance to every other node. The center can be found be continuously stripping away leaf nodes (nodes with only one edge) layer by layer until either 1 or 2 nodes remain. The longest path in a tree will contain the center. 52 | 53 | {{centergraph.png}} 54 | 55 | ## Network Flow 56 | 57 | ### Max Flow Problem 58 | 59 | ### Min Cut Problem 60 | 61 | ### Ford-Fulkerson 62 | -------------------------------------------------------------------------------- /data/Arrays.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | Let's say we need to store 10 numbers. We could store the numbers in 10 variables like such: 4 | 5 | [[[[ 6 | Scanner scan = new Scanner(System.in); 7 | int a,b,c,d,e,f,g,h,i,j; 8 | scan.nextInt(a); 9 | scan.nextInt(b); 10 | scan.nextInt(c); 11 | scan.nextInt(d); 12 | scan.nextInt(e); 13 | scan.nextInt(f); 14 | scan.nextInt(g); 15 | scan.nextInt(h); 16 | scan.nextInt(i); 17 | scan.nextInt(j); 18 | ]]]] 19 | 20 | However, if we had to store 100 numbers, this process would be very tedious and annoying. A better way would be to use a block of numbers and treat it as one variable instead of many variables. This is called an array. 21 | 22 | An **array** is the most basic data structure that stores elements of the same type in a fixed block. The fact that it is in one block and the same type is important because it allows accessing elements very quickly if you have the index. All you have to do is look at the index and retrieve the element. However, inserting elements in the array is slow because you would have to shift all the elements and also if you want to shift past the fixed size you will get an error. (Imagine the parking spaces are full and you wanted to insert a car somewhere, there will still be one car that will have no parking space). 23 | 24 | Arrays can be multidimensional meaning you can have an array of array of objects. (Imagine a parking lot with multiple rows of parking spaces). 25 | 26 | -------------------------------------------------------------------------------- /data/Binary.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | Computers don't use base 10 like us, they use binary numbers (base 2) to perform their operations. 4 | 5 | ## Exercises 6 | 7 | * Given a number, determine if it is a power of 2 -------------------------------------------------------------------------------- /data/Binary_Tree.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | A binary tree is a [[tree|Tree]] such that each node has at most 2 children. 4 | 5 | {{binarytree.png}} 6 | 7 | ## [[Binary Search Tree]] 8 | 9 | A binary search tree is a type of binary tree where all the nodes in a left subtree will be smaller than the node and all the nodes in a right subtree will be greater than the node. It has a recursive structure such that each subtree is also a binary search tree. 10 | 11 | {{bst.png}} -------------------------------------------------------------------------------- /data/Boolean.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | A boolean is stored in a bit that is either true or false. Booleans are usually used as flags to store if something is one one state or the other. 4 | 5 | Data type| Number of bits | Range 6 | -|-|-|- 7 | bool| 2 bits | true or false 8 | 9 | ## Example 10 | 11 | [[[[ 12 | boolean w = false; 13 | boolean x = true; 14 | boolean y = (w || x); 15 | boolean z = (1 == 4); 16 | ]]]] -------------------------------------------------------------------------------- /data/Bozo_Sort.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | Bozo sort is a sort that keeps randomly arranging an array until it is sorted. This sort should never been used. 4 | 5 | ## Implementation 6 | 7 | We keep checking if the array is sorted and if is not, we pick two random indexes to swap. 8 | 9 | ### Code 10 | 11 | [[[[ 12 | boolean sorted(int[] arr) { 13 | for (int i = 1; i < arr.length; i++) { 14 | if (arr[i] < arr[i - 1]) { 15 | return false; 16 | } 17 | } 18 | return true; 19 | } 20 | 21 | public void bozoSort(int[] arr) { 22 | 23 | int i = 0; 24 | 25 | // Keep trying until sorted. 26 | while (!sorted(arr)) { 27 | // Pick two random positions. 28 | int x = (int) (Math.random() * arr.length); 29 | int y = (int) (Math.random() * arr.length); 30 | // Swap array positions. 31 | int temp = arr[x]; 32 | arr[x] = arr[y]; 33 | arr[y] = temp; 34 | } 35 | } 36 | ]]]] 37 | 38 | -------------------------------------------------------------------------------- /data/Breadth_First_Search.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | **Prerequisites**: [[Recursion]], [[Queue]] 4 | 5 | A breadth first search is a search that traverses level by level. For example, in a tree, the search will transverse everything from the first layer, to the second layer, the third layer and all the way down to the last layer. BFS is implemented with a queue. 6 | 7 | 1. Push the root into the queue. 8 | 2. Pop the first element from the queue and push its non-visited neighbours. 9 | 3. Repeat 2 until the queue is empty. 10 | 11 | {{bfs.png}} 12 | 13 | ## Implementation 14 | 15 | Printing a binary tree using BFS: 16 | 17 | [[[[ 18 | void bfs(Node root) { 19 | Queue q = new Queue(); 20 | q.push(root); 21 | while (q.isEmpty() == false) { 22 | Node cur = q.pop(); 23 | System.out.println(cur.value); 24 | if (cur.left) { 25 | q.push(cur.left); 26 | } 27 | if (cur.right) { 28 | q.push(cur.right); 29 | } 30 | } 31 | } 32 | ]]]] 33 | 34 | ## Exercises 35 | 36 | 1. Given a grid of squares with walls at certain locations and two locations A and B, find the minimum distance (going up/left/right/down) between the locations or impossible otherwise. For example if A is at (1,1) and B is at (3,1) but there is a wall at (2,1) then the minimum distance would be 4 (down, left, left, up). 37 | 2. Given a tree of letters (A is the root), output the tree using BFS with separators between levels: 38 | * Example: A→B, B→D,B→C, C->G will output A | B | C D | G. 39 | 3. Given a tree of letters, and two letters X and Y determine if X is an ancestor of Y or if Y is a ancestor of X or neither. X is an ancestor of Y if X's subtrees contain Y. 40 | * Example: A→B, B→C, B→D, D→G, A is a parent of both C and D but G and C are not ancestors of each other 41 | 4. Given a binary tree and a node in the binary tree, find the next node in BFS order of the tree. -------------------------------------------------------------------------------- /data/Breath_First_Search.txt: -------------------------------------------------------------------------------- 1 | A bfs is -------------------------------------------------------------------------------- /data/Bubble_Sort.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | Bubble sort is one of the most basic sorting algorithms Its name describes how the algorithm works: bigger bubbles float to the top. Each time we pass through the array, we swap adjacent bigger elements with smaller elements. We keep passing through the array bubbling bigger elements to the top and until the array is sorted. It can be proved that you will need to pass through the array at most N times. Try to prove this for yourself. 4 | 5 | ## Implementation 6 | 7 | Bubble sort works by going through the array multiple times and swapping elements that are out of order as we go through the array. Every pass through the array, we move the largest element to the end. 8 | 9 | {{bubble_sort.png}} 10 | 11 | ### Code 12 | 13 | [[[[ 14 | public static void bubbleSort(int array[]) { 15 | // Keep going through array unless until no swaps are made. 16 | boolean swapped = true; 17 | while (swapped) { 18 | swapped = false; 19 | // Iterate through the array. 20 | for (int j = 1; j < array.length; j++) { 21 | // Swap if current element is bigger then next. 22 | if (array[j - 1] > array[j]) { 23 | // Swap two adjacent elements. 24 | int temp = array[j]; 25 | array[j] = array[j - 1]; 26 | array[j - 1] = temp; 27 | swapped = true; 28 | } 29 | } 30 | } 31 | } 32 | ]]]] -------------------------------------------------------------------------------- /data/Character.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | A character is any letter or symbol. For example: 'a','B','8','!'. 4 | 5 | Characters are usually stored as a number and then displayed as a character by the computer. An encoding is a computer translation from a number to a character. We store simple characters such as lower case and upper case letters, numbers and common punctuation, in 8 bits (0-255) and we can use it to encompass the English language. For these 8 bits, we use an encoding called ASCII. For example: '0' is 48 and 'B' is 66. There are other encodings like Unicode which uses more bits to convert to more languages such as Chinese or Russian. For the most part, we will just use ASCII. 6 | 7 | Data type| Number of bits | Range 8 | -|-|-|- 9 | char| 8 bits | 256 bits -------------------------------------------------------------------------------- /data/Cheat_Sheat.txt: -------------------------------------------------------------------------------- 1 | ## Cheat Sheet 2 | 3 | [[Sorting]] 4 | 5 | Name | Runtime 6 | -|- 7 | [[Bubble Sort]] | O(n^^2^^) 8 | [[Selection Sort]] | O(n^^2^^) 9 | [[Insertion Sort]] | O(n^^2^^) 10 | [[Heap Sort]] | O(n log n) 11 | [[Merge Sort]] | O(n log n) 12 | [[Quick Sort]] | O(n log n) 13 | 14 | [[Vector]] 15 | 16 | Operation | Get | Push | Pop | Insert | Remove 17 | -----------|---------|-- 18 | Time Complexity | O(1) | O(1) | O(1) | O(n) | O(n) 19 | 20 | [[Linked List]] 21 | 22 | | Operation | Get | Push | Delete | Insert 23 | |-----------|---------|------------|--------- 24 | | Time Complexity | O(n) | O(1) | O(1) | O(1) 25 | 26 | [[Hash Set]] 27 | 28 | | Operation | Membership | Insertion | Deletion 29 | |- 30 | | Time Complexity | O(1) | O(1) | O(1) 31 | 32 | [[Tree Set]] 33 | 34 | | Operation | Membership | Insertion | Deletion 35 | |- 36 | | Time Complexity | O(log n) | O(log n) | O(log n) 37 | 38 | [[Heap]] 39 | 40 | Operation | Resize | Push | Pop | Heapify 41 | -----------|---------|-- 42 | Time Complexity | O(n)| O(log n) | O(log n) | O(n) 43 | 44 | [[Shortest Path]] 45 | 46 | | Algorithm | Time | Space 47 | |----------|----|------|-----|---------- 48 | |[[Floyd Warshall]] | O(n^^3^^) | O(n^^2^^) 49 | |[[Bellman Ford]] | O(n^^2^^) | O(n) 50 | |[[Dijkstra's]] | O(n log n) | O(n log n) -------------------------------------------------------------------------------- /data/Data_Types.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | We use closets or drawers to store our clothes and garages to store our cars. Similarly, we store different types of data in different kinds of data types. Most programming languages will support these data types and picking the right data type is important. 4 | 5 | To define a variable of a data type we use the follow syntax: 6 | 7 | **datatype** **variable_name** = **init_val**; 8 | 9 | * **datatype** is the type of variable 10 | * **variable_name** is the name of the variable used 11 | * **init_val** is the initial value of the variable 12 | 13 | Example: 14 | [[[[ 15 | int x = 3; 16 | double y = -4.5; 17 | ]]]] 18 | 19 | x is an integer, and we initialize it with the value 3. y is a double floating point number (essentially a decimal number) and we initialize it with -4.5. 20 | 21 | There are 4 main types of data types: 22 | 23 | * [[Boolean]]: Binary bit 24 | * [[Integer]]: Stores an integer 25 | * [[Character]]: Stores a character 26 | * [[Float]]: Stores a decimal 27 | 28 | ## [[Boolean]] 29 | 30 | ((((Boolean.Introduction)))) 31 | 32 | ## [[Integer]] 33 | 34 | ((((Integer.Introduction)))) 35 | 36 | ## [[Character]] 37 | 38 | ((((Character.Introduction)))) 39 | 40 | ## [[Float]] 41 | 42 | ((((Float.Introduction)))) -------------------------------------------------------------------------------- /data/Float.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | A float is a decimal stored as binary in memory. We use scientific notation to represent the decimal. Scientific notation is a decimal number < 10 times some exponent of 10. For example: 8.23 * 10^^4^^ is in scientific notation. Decimals can be stored in 32 bits or 64 bits. 4 | 5 | In a 32bit float, we have 1 bit for the sign (positive or negative), 23 bits for the significant figures (7 digits) and 8 bits for the exponent. 6 | 7 | In a 64bit double we have 1 bit for the sign (positive or negative), 52 bits for the significant figures (16 digits) and 11 bits for the exponent. 8 | 9 | Data type| Number of bits | Range 10 | -|-|-|-|- 11 | float| 32 bits | 3.4e−038 to 3.4e+038 12 | double| 64 bits| 1.7e−308 to 1.7e+308 13 | 14 | ## Example 15 | [[[[ 16 | double x = 1.0/4.0; 17 | double y = 1.78e5; 18 | double z = -10.535246; 19 | ]]]] -------------------------------------------------------------------------------- /data/Fundamentals.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | Before we can learn about algorithms and data structures we must first learn how to analyze algorithms and data structures so we can apply them to the right needs. 4 | 5 | It is highly recommended that you understand the syntax and control structures for Java or C++ before you continue. 6 | 7 | ## [[Runtime and Memory]] 8 | 9 | ((((Runtime and Memory.Introduction)))) 10 | -------------------------------------------------------------------------------- /data/Getting_Started.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | The Computer Science handbook is a handbook designed to explain algorithms and data structures in a way that anyone can understand. Many websites (e.g. Wikipedia) contain lengthy and wordy explanations that are full of technical jargon. I have tried my hardest to simplify language to make it easy to read without a strong math or computer science background. I hope to share my knowledge with you and I hope you will learn something new from reading this! 4 | 5 | Before you get started with this handbook, it is highly recommended that you are already familiar with Java or C++ syntax. This handbook is not meant for learning programming basics since there are other resources better suited for that material. 6 | 7 | ## Format 8 | 9 | Each article will have multiple sections to help you understand the content. 10 | 11 | ### Introduction 12 | 13 | The introduction section gives a brief overview of what the article is about. It will usually come with a prerequisite section which will contain topics that will be recommended to have been read before the article. 14 | 15 | ### Implementation 16 | 17 | The implementation section will be an implementation of the article in Java. It is recommended that you try to implement things yourself first before looking at the implementation. If you truly understand the concept, then you will never have to memorize a single line of code. The code will come from your understanding of how it works. 18 | 19 | ### Exercises 20 | 21 | The exercises section contains practice problems to test your understanding. Some of these questions come from real interview questions. 22 | 23 | -------------------------------------------------------------------------------- /data/Gift_wrapping.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | ## Test -------------------------------------------------------------------------------- /data/Graph_Representations.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | A graph can be represented in various ways, but the most useful representations are as an adjacency matrix or as an adjacency list. 4 | 5 | ## [[Adjacency Matrix]] 6 | 7 | ((((Adjacency Matrix.Introduction)))) 8 | 9 | ## [[Adjacency List]] 10 | 11 | ((((Adjacency List.Introduction)))) -------------------------------------------------------------------------------- /data/Hash_Sets.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/data/Hash_Sets.txt -------------------------------------------------------------------------------- /data/Heap_Sort.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | *Prerequisites*: [[Heap]] 4 | 5 | Heap sort is a sort that takes advantage of the efficiencies of a heap. To sort an array of N elements, we convert it to a heap by using heapify and then we pop out all the elements one by one since can the root element will be either the maximum or minimum element. 6 | 7 | ## Implementation 8 | 9 | We can simply use the heap built into the standard library for this sort by adding all the elements to the array which is O(n log n) and then popping all the elements which is O(n log n). 10 | 11 | ### Code 12 | 13 | [[[[ 14 | public void heapSort(int[] arr) { 15 | // Use a built-in heap. 16 | PriorityQueue pq = new PriorityQueue(); 17 | 18 | // Add all elements into heap. 19 | for (int i = 0; i < arr.length; i++) { 20 | pq.add(arr[i]); 21 | } 22 | // Pop all elements from heap. 23 | for (int i = 0; i < arr.length; i++) { 24 | arr[i] = pq.poll(); 25 | } 26 | } 27 | ]]]] -------------------------------------------------------------------------------- /data/Input_Ouput.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | Programs need to be able to read data to process and output some kind of information. Your computer uses the keyboard, mouse, microphone or other peripherals for input. It also uses the monitor, printer and any other peripherals as output. Perhaps one day we will be able to integrate input and output so seamlessly that we are able to use our neurological pathways to communicate with computers. 4 | 5 | ## Input 6 | 7 | For Java programs, the easiest form of builtin input is reading from the keyboard (standard input) or reading from a file. 8 | 9 | Examples: 10 | [[[[ 11 | Scanner s = new Scanner(System.in); 12 | int n = s.nextInt(); // Read in an integer 13 | ]]]] 14 | 15 | 16 | ## Output 17 | 18 | For Java programs, the easiest output method is to console (standard output) or writing to a file. 19 | 20 | Examples: 21 | 22 | [[[[ 23 | int x = 30; 24 | double y = 12.5; 25 | System.out.println(x + " " + y); //30 12.5 26 | ]]]] -------------------------------------------------------------------------------- /data/Input_Output.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | Programs need to be able to read data to process and output some kind of information. Your computer uses the keyboard, mouse, microphone or other peripherals for input. It also uses the monitor, printer and any other peripherals as output. Perhaps one day we will be able to integrate input and output so seamlessly that we are able to use our neurological pathways to communicate with computers. 4 | 5 | ## Input 6 | 7 | For Java programs, the easiest form of builtin input is reading from the keyboard (standard input) or reading from a file. The built in Scanner allows us to read in a datatype from input. 8 | 9 | Function | Returns 10 | -|- 11 | s.nextInt() | Integer 12 | s.nextDouble() | Double 13 | s.nextLine() | String up to '\n' 14 | s.next() | String up to space 15 | 16 | Since Scanner is not automatically included, we need to import it to at the top of any file we use it in: 17 | 18 | [[[[ 19 | import java.util.Scanner; 20 | ]]]] 21 | 22 | Examples: 23 | [[[[ 24 | Scanner s = new Scanner(System.in); 25 | int n = s.nextInt(); // Read in an integer 26 | ]]]] 27 | 28 | 29 | ## Output 30 | 31 | For Java programs, the easiest output method is to console (standard output) or writing to a file. For Java there are two console output functions that we will primarily use: 32 | 33 | [[[[ 34 | //prints object of any type 35 | System.out.print(object); 36 | 37 | //prints object of any type and a newline 38 | System.out.println(object); 39 | ]]]] 40 | Examples: 41 | 42 | [[[[ 43 | int x = 30; 44 | double y = 12.5; 45 | 46 | System.out.println(x); //30 47 | System.out.println(y); //12.5 48 | ]]]] -------------------------------------------------------------------------------- /data/Insertion_Sort.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | Insertion is a sort that works by inserting unused elements into a sorted array. We start with an empty array and we add the first element to the array. We then add the second element to the array and we "insert" it by shifting elements. We keep doing this until the array is sorted. 4 | 5 | ## Implementation 6 | 7 | We split the original array into two parts: the first part is sorted and the second part is unsorted. We take the first element from the second part and insert it into the sorted part. We keep doing this until we have no more elements in the unsorted part and we only have the sorted part. 8 | 9 | {{insertion_sort.png}} 10 | 11 | ### Code 12 | 13 | [[[[ 14 | public static void insertionSort(int[] array) { 15 | int i,j; 16 | 17 | // Iterate through size of array. 18 | for (j = 1; j < array.length; j++) { 19 | int element = array[j]; 20 | // Shift all elements until beginning of array or correct position. 21 | for (i = j - 1; (i >= 0) && (array[i] < element); i--) { 22 | array[i + 1] = array[i]; 23 | } 24 | // Insert element into correct position. 25 | array[i + 1] = element; 26 | } 27 | } 28 | ]]]] -------------------------------------------------------------------------------- /data/Integer.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | An integer is any number that does not contain decimals. It is stored as binary number in memory. For example: 0, -5, 6 are integers. 4 | 5 | Data type| Number of bits | Range 6 | -|-|-|- 7 | byte|8 bits| -128 to 127 8 | short|16 bits | -32,768 to 32,767 9 | int| 32 bits | −2,147,483,648 to 2,147,483,647 10 | long| 64 bits | −9,223,372,036,854,775,808 to 9,223,372,036,854,755,807 11 | 12 | ## Example 13 | 14 | [[[[ 15 | short x = 5; 16 | int y = 10; 17 | long z = 100; 18 | ]]]] -------------------------------------------------------------------------------- /data/Line_Sweeping.txt: -------------------------------------------------------------------------------- 1 | 2 | 3 | ## Intersection of line segments 4 | 5 | ### 1D intersection of line segments 6 | 7 | Given a list of line segments in 1D, find the area of overlap. For example: (1,5), (6, 7), (2, 6). The area of overlap is 3 since (1,5) overlaps with (2,6) at (2,5) so the area is 3. 8 | 9 | Every line segment has a starting point and ending point. Let the starting point will be the smaller coordinate and the ending point be the larger coordinate. We can then put all these points in a priority queue 10 | 11 | When we reach a starting point we will increase a counter and when we reach an ending point we will decrease the counter. When the counter is > 0 then we can add the distance between points to the total length. 12 | 13 | ### 2D intersection of line segments 14 | 15 | ## Intersection of rectangles 16 | 17 | ## Exercises 18 | 19 | 1. Given a list of points, find the minimum distance between a pair of points. -------------------------------------------------------------------------------- /data/Maps.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | *Prerequisites*: [[Sets]] 4 | 5 | A map is an abstract data type that stores key-value pairs. 6 | 7 | Imagine you had a English dictionary. If you look up a word, you can find it's definition. For example if you looked up the word 'cat' in the English dictionary, you would look through the dictionary alphabetically until you found the word 'cat' and then you would look at the definition: 'a feline animal'. If you really wanted to, you could also add your own words into the dictionary and the definitions of your words. This type of structure is called a map. 8 | 9 | Maps (also called dictionaries) are abstract data types that store pairs of key-values and can be used to look up values from the keys. The keys are like the words in an English dictionary and the definitions can be seen as the values. Maps are able to insert key-value pairs, retrieve values from keys, and delete key-value pairs. 10 | 11 | ## Implementations 12 | 13 | Type | Get | Put | Deletion 14 | -|- 15 | [[Hash Map]] | O(1) | O(1) | O(1) 16 | [[Tree Map]] | O(log n) | O(log n) | O(log n) 17 | 18 | ## Exercises 19 | 20 | 1. Given a list of N strings, output the strings in alphabetical order and the number of times they appear in the list. 21 | 2. Given a mapping of ids to names, output the ids in order by lexicographical name. 22 | -------------------------------------------------------------------------------- /data/Minimum_Spanning_Tree.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | **Prerequisites**: [[Graph Theory]] 4 | 5 | A spanning tree of a graph is a tree that spans all the nodes of the graph but only using some of the edges to connect all the nodes. 6 | 7 | A [[minimum spanning tree|Minimum Spanning Tree]] is the spanning tree that requires the minimum of some property such as total weight or total edges. 8 | 9 | Spanning tree algorithms are essential in networking to ensure no loops occur when sending data through a network. 10 | 11 | ## Implementations 12 | 13 | | Algorithm | Desc | Time | Space 14 | |- 15 | |[[Prim's]] | Using greedy method | O(n log n) | O(n^^2^^) 16 | |[[Kruskal]] | Using connected components| O(n log n) | O(n^^2^^) 17 | 18 | ## Exercises 19 | 20 | 1. Given a weighted graph with N nodes, find the smallest total cost to connect all nodes into 3 separate groups. (A single node can be a group) 21 | 2. Same as 3, but a group must contain at least 3 other nodes. -------------------------------------------------------------------------------- /data/Miracle_Sort.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | *Prerequisites*: Miracles, Sense of Humour 4 | 5 | Miracle sort is a sort that truly requires a miracle. We keep checking the array until it is sorted. It requires that some external force (a miracle?) changes some bits in the computer in a way that it becomes sorted. 6 | 7 | ## Implementation 8 | 9 | We keep checking if the array is sorted until some miracle occurs. 10 | 11 | ### Code 12 | 13 | [[[[ 14 | public void miracleSort(int[] arr) { 15 | boolean sorted = false; 16 | do { 17 | sorted = true; 18 | for (int i = 1; i < arr.length; i++) { 19 | if (arr[i] < arr[i - 1]) { 20 | sorted = false; 21 | break; 22 | } 23 | } 24 | } while (!sorted); 25 | } 26 | ]]]] -------------------------------------------------------------------------------- /data/Number_Theory.txt: -------------------------------------------------------------------------------- 1 | ##Primes 2 | 3 | Primes are an important part of encryption for modern cryptography. Many transactions use RSA which rely on prime numbers. 4 | 5 | ###Sieve 6 | 7 | 8 | ### Primality Test 9 | 10 | ## GCD 11 | 12 | Greatest common denominator 13 | 14 | [[[[ 15 | public int gcd(int p,int q){ 16 | if(q==0)return p; 17 | return gcd(q, p % q); 18 | } 19 | ]]]] 20 | 21 | ## Exercises 22 | 23 | 1. Given two numbers X and Y, how do you divide X by Y without using division? -------------------------------------------------------------------------------- /data/Pattern_Matching.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | Pattern matching is finding if a certain sequence of elements exists in another larger sequence of elements. For example we want to find if the string "abc" is in the string "abdabdbdacbaabcasd" (which the answer is yes). 4 | 5 | ## [[Knuth Morris Pratt]] 6 | 7 | If we have the needle string "abcxabcy" and haystack string "abcyabcxabcy" then our first search will be putting the needle at position 0 as we see the search fails at 'x'. However we note that we do not need to set the needle at position 1 because we have already done the search for the prefix "abc". Thus we can search starting by setting the needle at the next 'a'. 8 | 9 | KMP uses this type of optimization for pattern matching by precomputing a table for the needle string. 10 | 11 | ## [[Rabin Karp]] 12 | 13 | ## [[Finite State Automata]] 14 | 15 | ## [[Boyer Moore]] 16 | 17 | -------------------------------------------------------------------------------- /data/Permutation_Sort.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | Permutation sort is a sort that keeps permuting the array until it is sorted. It is the slowest sort that will guarantee that the array will be sorted. 4 | 5 | ## Implementation 6 | 7 | We keep finding the next permutation until the array is sorted. 8 | 9 | ### Code 10 | 11 | [[[[ 12 | void permuteSort(int[] arr){ 13 | while(!sorted(arr)){ 14 | permute(arr); 15 | } 16 | } 17 | ]]]] -------------------------------------------------------------------------------- /data/Priority_Queue.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | *Prerequisites*: [[Queue]], [[Heap]] 4 | 5 | A priority queue is a queue that takes elements which have the highest priority first. This is either the maximum or minimum property for all elements. 6 | 7 | Consider a waiting list for lung transplants. The patients are given a score when they are placed on the waiting list based on whether they smoke, risk factors, age, expected time left, etc. When a lung is available, the patient with the highest score will receive the lung first. During this time, it is possible more patients could be added to the queue. The behaviour is similar to a queue but instead of the first person getting in the queue getting a lung first, the person with the highest score will get it. This means that if Sam, who has a score of 60, joins the queue after Bob, who has a score of 40, Sam will get the lung first even though Bob was in the queue before him. 8 | 9 | A **priority queue** is an abstract data structure with two operations: push and pop. Push adds an element into the priority queue and pop removes the highest or lowest element. 10 | 11 | A priority queue is usually implemented as a heap because it is the most efficient implementation. 12 | 13 | ## Implementations 14 | 15 | Implementation | Push | Pop 16 | -----------|---------|-- 17 | [[Heap]] | O(log n) | O(log n) 18 | 19 | ## Exercises 20 | 21 | 1. Given a list of N numbers, find the M largest numbers. (Note you can do better than O(N log N)). 22 | 2. Given N lists of N numbers, find the N largest numbers. -------------------------------------------------------------------------------- /data/Searches.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | Searches are used to find solutions to problems and there are many ways to search for a solution. Here are some generic searches that can be applied to many different problems. 4 | 5 | ## [[Binary Search]] 6 | 7 | Binary search is a type of search that is able to find an object in a sorted list in O(log n). In binary search we first start at the middle element and we keep trying to halve the problem until we find the element we need. 8 | 9 | {{binarysearch.png}} 10 | 11 | ## [[Ternary Search]] 12 | 13 | Ternary search is a type of search that finds the maximum value of a increasing or decreasing function by breaking it into 3 parts. 14 | 15 | {{ternarysearch.png}} 16 | 17 | {{ternarysearch2.png}} 18 | 19 | {{ternarysearch3.png}} 20 | 21 | {{ternarysearch7.png}} 22 | 23 | ## [[Depth First Search]] 24 | 25 | Depth first search or DFS is a method of search that goes as far as possible before backtracking. DFS is implemented using a [[stack|Stack]] and most of the time it uses an function stack for recursion. 26 | 27 | {{dfs-preorder.png}} 28 | 29 | 30 | ## [[Breadth First Search]] 31 | 32 | Breadth first search or BFS is a method of search that takes the closest things first then the farthest. BFS is implemented with a [[queue|Queue]]. 33 | 34 | {{bfs.png}} 35 | 36 | ## [[Flood Fill]] 37 | 38 | Flood fill is a search that fills a grid. It can be implemented with either DFS or BFS. We first start at some starting position and then we expand in the directions that we can (eg: up, left, down, right). 39 | 40 | {{floodfill.png}} 41 | 42 | ## [[Backtracking]] 43 | Backtracking is a search that enumerates every single possible solution by using partial solutions. 44 | 45 | {{enumerate-sets.png}} 46 | -------------------------------------------------------------------------------- /data/Selection_Sort.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | Selection sort works by finding the smallest element in the array and swapping it with the first element. Then it finds the second smallest element and swaps it with the second element and it does this until the array is sorted. 4 | 5 | ## Implementation 6 | 7 | We keep picking the smallest element and swapping it with the current position until the array is sorted. 8 | 9 | {{selection_sort.png}} 10 | 11 | ### Code 12 | 13 | [[[[ 14 | public static void selectionSort(int array[]) { 15 | // Iterates through the array selecting the smallest elements 16 | for (int i = 0; i < array.length - 1; i++) { 17 | int minIndex = i; 18 | 19 | for (int j = i + 1; j < array.length; j++) { 20 | // Find the index of the smallest element from i to n. 21 | if (array[j] < array[minIndex]) { 22 | minIndex = j; 23 | } 24 | // Swap the smallest element with the element at i. 25 | int temp = array[i]; 26 | array[i] = array[minIndex]; 27 | array[minIndex] = temp; 28 | } 29 | } 30 | } 31 | 32 | ]]]] -------------------------------------------------------------------------------- /data/Sets.txt: -------------------------------------------------------------------------------- 1 | ##Introduction 2 | 3 | Sets are abstract data structures which are able to store and keep track of unique values. 4 | 5 | Imagine you have a grocery list that you use to keep tracking of things you need to buy. You want to make sure there are no duplicate items in the list, you can add items to the list and that you can remove items from your list. This structure is similar to what a set does. 6 | 7 | Sets have three operations: insertion, deletion and a membership test. Insertion places an element into the set, deletion removes an element from the set and a **membership** test is checking whether an element exists within the set. 8 | 9 | ## Implementations 10 | 11 | Type | Membership | Insertion | Deletion 12 | -|- 13 | [[Hash Set]] | O(1) | O(1) | O(1) 14 | [[Tree Set]] | O(log n) | O(log n) | O(log n) 15 | 16 | ## Exercises 17 | 18 | 1. Given a list of words, determine how many of them are anagrams of each other. An anagram is a word that can have its letters scrambled into another word. 19 | * For example, silent and listen are anagrams but banana and orange are not. 20 | 2. Given the friend lists of two people, find the number of mutual friends. 21 | 3. Given an array of numbers, find the number of pairs of numbers that sum to 0. 22 | 4. Given an array of numbers, find the number of tuples of size 4 that add to A. 23 | * For example in the list (10,5,-1, 3, 4, -6) the tuple of size 4 (-1,3,4-6) adds to 0. -------------------------------------------------------------------------------- /data/Shortest_Path.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | *Prerequisites*: [[Graph Theory]] 4 | 5 | The shortest path is defined as a path from one node to another while trying to minimize a certain property (least number of nodes, smallest total weight). However, shortest paths may have negative weights which leads to cycles. 6 | 7 | ## Implementations 8 | 9 | | Algorithm | Time | Detect cycles? 10 | |----------|----|------|-----|---------- 11 | |[[Floyd Warshall]] | O(N^^3^^) | Yes 12 | |[[Bellman Ford]] | O(N^^2^^) | Yes 13 | |[[Dijkstra's]] | O(N log N) | No 14 | 15 | * [[Floyd Warshall]] computes the shortest path between all pairs of nodes. 16 | * [[Bellman Ford]] computes the shortest path between one node to every other node. 17 | * [[Dijkstra's]] computes the shortest path between two nodes. -------------------------------------------------------------------------------- /data/Spanning_Tree.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | A spanning tree of a graph is a connected tree that spans all the nodes of the graph. 4 | 5 | A [[minimum spanning tree|Minimum Spanning Tree]] is the spanning tree that requires the minimum of some property such as total weight or total edges. 6 | 7 | Spanning tree algorithms are essential in networking to ensure no loops occur when sending data through a network. 8 | 9 | 10 | | Algorithm | Desc | Time | Space 11 | |- 12 | |[[Prim's]] | Using greedy method | O(n log n) | O(n^^2^^) 13 | |[[Kruskal]] | Using connected components| O(n log n) | O(n^^2^^) -------------------------------------------------------------------------------- /data/Stack.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | A **stack** is an abstract data type with the property that it can remove and insert elements following a FILO (First In Last Out) structure. The first element to be inserted must be the last element to be removed and the last element to be inserted must be the first element to be removed. Sometimes, removal is called "pop" and insertion is called "push". 4 | 5 | Imagine a stack of plates at a buffet, the plates are taken from the top and are also replaced from the top. The first plate to go in will be the last plate to come out. The last plate to go in will be the first to come out. This structure is what a stack is. 6 | 7 | Example of push: 8 | 9 | {{stack.png}} 10 | 11 | Example of pop: 12 | 13 | {{stack2.png}} 14 | 15 | Stacks are used to keep track of function calls in memory. Whenever a function is called, it is placed on the memory stack with its variables, and when it is returning a value, it is popped off the stack. 16 | 17 | A stack is usually implemented as a [[vector|Vector]]. 18 | 19 | ## Implementations 20 | 21 | | Implementation | Pop | Push 22 | |-----------|-----|----- 23 | | [[Vector]] | O(1) | O(1) 24 | 25 | ## Exercises 26 | 27 | 1. Given a string of brackets of either () or [], determine if the bracket syntax is legal (every opening bracket has a closing bracket from left to right). 28 | 29 | Legal syntax: 30 | * ( [ ( ) [ ] ] ) 31 | * ( ) ( ) [ ] ( ) ( ) 32 | 33 | Illegal syntax: 34 | * ( ( ) ] 35 | * ( ) [ ( ] ) 36 | -------------------------------------------------------------------------------- /data/Strings.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | String problems are more important than ever before with the enormous amount of text and information that is now available. For example, if we search for keywords on Google out of the millions of articles, how can we do it in such a way that the retrieval is relevant, accurate and efficient? If we misspell the word "shooting" as "sohoting" how can we come up with a list of autocorrected words? 4 | 5 | ## [[Pattern Matching]] 6 | 7 | When we press ctrl+f to search for a word on a page which may contain tens of thousands of words, how can we do it quickly? More formally: if we have two strings A and B, how can we search for instances of A inside B in the quickest way? 8 | 9 | ## String Distance 10 | 11 | Given two strings A and B, how can we tell how similar the strings are? 12 | 13 | [[Levenshtein Distance]] 14 | 15 | [[Hamming Distance]] 16 | 17 | ## Exercises 18 | 19 | 1. Given a string, count the number of palindromes greater than 1 character contained in it. E.g. abacca has 3: aba, cc, acca. 20 | 2. Given a sentence, reverse the order of the sentence without using additional memory. For example: There are three blue cows reversed is cows blue three are There -------------------------------------------------------------------------------- /data/Topics.txt: -------------------------------------------------------------------------------- 1 | # [[Data Structures]] 2 | # [[Sorting]] 3 | # [[Geometry]] 4 | # [[Graph Theory]] 5 | # [[Number Theory]] 6 | # [[Pattern Matching]] -------------------------------------------------------------------------------- /data/Topological_Sorting.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | Prerequisites: [[Graph Theory]], [[Depth First Search]] 4 | 5 | A topological sort or topological order of a directed graph is an order in which every node comes after its ancestors. 6 | 7 | {{topsort.png}} 8 | 9 | For example topological orders could be: 10 | 11 | * (A, B, C, D, E, F, G) 12 | * (B, A, D, C, F, E, G) 13 | * (B, A, D, G, F, C, E) 14 | 15 | But (B, A, C, F, D, E, G) is not a topological ordering because D is an ancestor of F and it comes after F. 16 | 17 | ## Implementation 18 | 19 | Topological sort can implemented in O(n) time using DFS for a directed acyclic graph (a digraph with no cycles). How it works: 20 | 21 | 1. Start with an empty top order. 22 | 2. Pick any unmarked node. 23 | 3. Get the DFS preordering from that node for unvisited nodes. 24 | 4. Add the DFS to the head of the current order. 25 | 5. Mark every node that has been visited. 26 | 27 | {{topsort.png}} 28 | 29 | Example: 30 | 31 | * Pick C 32 | * DFS preorder from C is (C,E) 33 | * Add DFS preorder to head [C,E] 34 | * Pick F 35 | * DFS preorder from F is (F) 36 | * Add DFS preorder from F to head [F,C,E] 37 | * Pick B 38 | * DFS preorder from B is (B,D,G) 39 | * Add DFS preorder from B to head [B,D,G,F,C,E] 40 | * Pick A 41 | * DFS preorder from A is (A) 42 | * Add DFS preorder from A to head [A,B,D,G,F,C,E] 43 | * Done, all nodes visited 44 | 45 | A DFS order from a node is guaranteed to be a topological order. Since we add everything to the head of the order, a child of a node cannot appear before it. -------------------------------------------------------------------------------- /data/Tree.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | A tree is a special graph with no cycles. It has the special property that there will be only one path from one node to another node. 4 | 5 | {{treegraph.png}} 6 | 7 | A **subtree** is a child tree of a tree. 8 | 9 | Note that trees have two meanings in computer science. It can either refer to a [[tree data structure|Trees]] or it can refer to a tree in graph theory. -------------------------------------------------------------------------------- /data/Tree_Map.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | *Prerequisites*: [[Maps]], [[Binary Search Tree]] 4 | 5 | A tree map is a map which stores the values in a [[binary search tree|Binary Search Tree]]. To store elements in a tree map, they must be able to be sorted by a property. To insert an element, it is added to the binary tree. To delete an element, it is removed from the binary tree. To check for membership, we do a binary search for the element in the binary tree. 6 | 7 | The advantage of tree maps is that they are maps maintained in a sorted order. 8 | 9 | {{bst.png}} 10 | 11 | | Operation | Membership | Insertion | Deletion 12 | |- 13 | | Time Complexity | O(log n) | O(log n) | O(log n) 14 | 15 | Tree Maps are implemented using [[binary search trees|Binary Search Tree]]. Since the implementation of a tree map is very similar to the implementation of a tree set, it will left as an exercise. 16 | 17 | ## Exercise 18 | 19 | 1. Implement a Tree Map using the code of [[Binary Search Tree]] and [[Hash Map]] as guides. -------------------------------------------------------------------------------- /data/Tree_Set.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | *Prerequeisites*: [[Sets]], [[Binary Search Tree]] 4 | 5 | [[Source on Github||GITHUB_PATH/TreeSet.java]] 6 | 7 | A tree set is a set which stores the values in a [[binary search tree|Binary Search Tree]]. To store elements in a tree set, they must be able to be sorted by a property. To insert an element, it is added to the binary tree. To delete an element, it is removed from the binary tree. To check for membership, we do a binary search for the element in the binary tree. 8 | 9 | The advantage of tree sets is that they are maintained in a sorted order. 10 | 11 | Tree Sets are implemented using [[binary search trees|Binary Search Tree]]. 12 | 13 | {{bst.png}} 14 | 15 | ## Implementations 16 | 17 | | Operation | Membership | Insertion | Deletion 18 | |- 19 | | [[Binary Search Tree]] | O(log n) | O(log n) | O(log n) 20 | 21 | ## Exercises 22 | 23 | 1. Given a list of names, output all the unique names in alphabetical order. -------------------------------------------------------------------------------- /data/Trees.txt: -------------------------------------------------------------------------------- 1 | ## Introduction 2 | 3 | Trees are data structures that follow a hierarchy, each node has exactly one or zero parents and each node has children. Trees are recursive structures meaning that each child of a tree is also a tree. A tree within another tree is called a **subtree**. 4 | 5 | A **child** is a node that is below another node. 6 | 7 | A **parent** is a node that is above another node. 8 | 9 | The element at the top of the tree with no parents is called a **root**. The node at the bottom of the tree with no children is called a **leaf**. 10 | 11 | Each node can hold different kinds of information depending on the tree. A node can hold the children it has, the parent it has, a key associated with the node and a value associated with the node. 12 | 13 | {{tree.png}} 14 | 15 | * A is the root of the tree and E,F,G,H are leaves. 16 | * The parent of E is B. 17 | * C,F,G is a subtree of the original tree. 18 | 19 | ## [[Binary Tree]] 20 | 21 | A binary tree is a tree where every node has at max two children. 22 | 23 | {{binarytree.png}} -------------------------------------------------------------------------------- /data/cheat_sheet.txt: -------------------------------------------------------------------------------- 1 | ### [[Sorting]] 2 | 3 | Name | Runtime 4 | -|- 5 | [[Bubble Sort]] | O(n^^2^^) 6 | [[Selection Sort]] | O(n^^2^^) 7 | [[Insertion Sort]] | O(n^^2^^) 8 | [[Heap Sort]] | O(n log n) 9 | [[Merge Sort]] | O(n log n) 10 | [[Quick Sort]] | O(n log n) 11 | 12 | ### [[Vector]] 13 | 14 | Operation | Get | Push | Pop | Insert | Remove 15 | -----------|---------|-- 16 | Time Complexity | O(1) | O(1) | O(1) | O(n) | O(n) 17 | 18 | ### [[Linked List]] 19 | 20 | | Operation | Get | Push | Pop | Delete At | Insert At 21 | |-----------|---------|------------|--------- 22 | | Time Complexity | O(n) | O(1) | O(1) | O(1) | O(1) 23 | 24 | ### [[Hash Set]] 25 | 26 | | Operation | Membership | Insertion | Deletion 27 | |- 28 | | Time Complexity | O(1) | O(1) | O(1) 29 | 30 | ### [[Binary Search Tree]] 31 | 32 | | Operation | Membership | Insertion | Deletion 33 | |- 34 | | Time Complexity | O(log n) | O(log n) | O(log n) 35 | 36 | ### [[Heap]] 37 | 38 | Operation | Resize | Push | Pop | Heapify 39 | -----------|---------|-- 40 | Time Complexity | O(n)| O(log n) | O(log n) | O(n) 41 | 42 | ### [[Shortest Path]] 43 | 44 | | Algorithm | Time | Cycles? 45 | |----------|----|------|-----|---------- 46 | |[[Floyd Warshall]] | O(n^^3^^) | Yes 47 | |[[Bellman Ford]] | O(n^^2^^) | Yes 48 | |[[Dijkstra's]] | O(n log n) | No -------------------------------------------------------------------------------- /data/todo.txt: -------------------------------------------------------------------------------- 1 | ## [[Graph Theory]] 2 | 3 | Touch up connected components 4 | Add more explaination to Bellman Ford and Floyd Warshall 5 | 6 | ### [[Advanced Graph Theory]] 7 | Ford fulkerson 8 | 9 | ## Binary search trees 10 | 2-3 trees 11 | redblack tree 12 | avl tree 13 | bk tree 14 | 15 | ## [[Pattern Matching]] 16 | everything 17 | 18 | ## [[Geometry]] 19 | Line sweeping 20 | 21 | ### [[Advanced Geometry]] 22 | Grids -> grid, 2d tree, quadtree, bk trees 23 | 24 | -------------------------------------------------------------------------------- /public_html/TheComputerScienceHandbook.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/TheComputerScienceHandbook.pdf -------------------------------------------------------------------------------- /public_html/img/favicon.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/favicon.png -------------------------------------------------------------------------------- /public_html/img/icon-algorithms-hover.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/icon-algorithms-hover.png -------------------------------------------------------------------------------- /public_html/img/icon-algorithms.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/icon-algorithms.png -------------------------------------------------------------------------------- /public_html/img/icon-guys-hover.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/icon-guys-hover.png -------------------------------------------------------------------------------- /public_html/img/icon-guys.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/icon-guys.png -------------------------------------------------------------------------------- /public_html/img/icon-website-hover.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/icon-website-hover.png -------------------------------------------------------------------------------- /public_html/img/icon-website.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/icon-website.png -------------------------------------------------------------------------------- /public_html/img/icon_algorithms.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/icon_algorithms.png -------------------------------------------------------------------------------- /public_html/img/icon_guys.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/icon_guys.png -------------------------------------------------------------------------------- /public_html/img/icon_website.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/icon_website.png -------------------------------------------------------------------------------- /public_html/img/link.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/link.png -------------------------------------------------------------------------------- /public_html/img/link_large.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/link_large.png -------------------------------------------------------------------------------- /public_html/img/logo.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/logo.png -------------------------------------------------------------------------------- /public_html/img/logo.psd: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/logo.psd -------------------------------------------------------------------------------- /public_html/img/logo_hover.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/logo_hover.png -------------------------------------------------------------------------------- /public_html/img/nav-icon.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/nav-icon.png -------------------------------------------------------------------------------- /public_html/img/raw/adt.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/adt.png -------------------------------------------------------------------------------- /public_html/img/raw/array.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/array.png -------------------------------------------------------------------------------- /public_html/img/raw/array2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/array2.png -------------------------------------------------------------------------------- /public_html/img/raw/array3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/array3.png -------------------------------------------------------------------------------- /public_html/img/raw/backtracking.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/backtracking.png -------------------------------------------------------------------------------- /public_html/img/raw/basic.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/basic.png -------------------------------------------------------------------------------- /public_html/img/raw/bellmanford.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bellmanford.png -------------------------------------------------------------------------------- /public_html/img/raw/bellmanford2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bellmanford2.png -------------------------------------------------------------------------------- /public_html/img/raw/bellmanford3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bellmanford3.png -------------------------------------------------------------------------------- /public_html/img/raw/bellmanford4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bellmanford4.png -------------------------------------------------------------------------------- /public_html/img/raw/bellmanford5.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bellmanford5.png -------------------------------------------------------------------------------- /public_html/img/raw/bfs.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bfs.png -------------------------------------------------------------------------------- /public_html/img/raw/binarysearch.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/binarysearch.png -------------------------------------------------------------------------------- /public_html/img/raw/binarytree.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/binarytree.png -------------------------------------------------------------------------------- /public_html/img/raw/bottle.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bottle.png -------------------------------------------------------------------------------- /public_html/img/raw/bst-rem-case1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bst-rem-case1.png -------------------------------------------------------------------------------- /public_html/img/raw/bst-rem-case11.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bst-rem-case11.png -------------------------------------------------------------------------------- /public_html/img/raw/bst-rem-case12.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bst-rem-case12.png -------------------------------------------------------------------------------- /public_html/img/raw/bst-rem-case2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bst-rem-case2.png -------------------------------------------------------------------------------- /public_html/img/raw/bst-rem-case21.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bst-rem-case21.png -------------------------------------------------------------------------------- /public_html/img/raw/bst-rem-case22.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bst-rem-case22.png -------------------------------------------------------------------------------- /public_html/img/raw/bst-rem-case3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bst-rem-case3.png -------------------------------------------------------------------------------- /public_html/img/raw/bst-rem-case31.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bst-rem-case31.png -------------------------------------------------------------------------------- /public_html/img/raw/bst-rem-case32.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bst-rem-case32.png -------------------------------------------------------------------------------- /public_html/img/raw/bst-rem-case33.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bst-rem-case33.png -------------------------------------------------------------------------------- /public_html/img/raw/bst-rem-case34.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bst-rem-case34.png -------------------------------------------------------------------------------- /public_html/img/raw/bst-rem.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bst-rem.png -------------------------------------------------------------------------------- /public_html/img/raw/bst.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bst.png -------------------------------------------------------------------------------- /public_html/img/raw/bstcompare.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bstcompare.png -------------------------------------------------------------------------------- /public_html/img/raw/bstcontains.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bstcontains.png -------------------------------------------------------------------------------- /public_html/img/raw/bstcontains2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bstcontains2.png -------------------------------------------------------------------------------- /public_html/img/raw/bstcontains3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bstcontains3.png -------------------------------------------------------------------------------- /public_html/img/raw/bstcontains4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bstcontains4.png -------------------------------------------------------------------------------- /public_html/img/raw/bstinsert.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bstinsert.png -------------------------------------------------------------------------------- /public_html/img/raw/bstinsert2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bstinsert2.png -------------------------------------------------------------------------------- /public_html/img/raw/bstinsert3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bstinsert3.png -------------------------------------------------------------------------------- /public_html/img/raw/bstinsert4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bstinsert4.png -------------------------------------------------------------------------------- /public_html/img/raw/bubble_sort.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bubble_sort.png -------------------------------------------------------------------------------- /public_html/img/raw/bucket.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bucket.png -------------------------------------------------------------------------------- /public_html/img/raw/bucket2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bucket2.png -------------------------------------------------------------------------------- /public_html/img/raw/bucket3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bucket3.png -------------------------------------------------------------------------------- /public_html/img/raw/bucket4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/bucket4.png -------------------------------------------------------------------------------- /public_html/img/raw/centergraph.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/centergraph.png -------------------------------------------------------------------------------- /public_html/img/raw/connectedcomponents.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/connectedcomponents.png -------------------------------------------------------------------------------- /public_html/img/raw/connectedcomponents2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/connectedcomponents2.png -------------------------------------------------------------------------------- /public_html/img/raw/connectedcomponents3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/connectedcomponents3.png -------------------------------------------------------------------------------- /public_html/img/raw/connectedcomponents4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/connectedcomponents4.png -------------------------------------------------------------------------------- /public_html/img/raw/connectedcomponents5.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/connectedcomponents5.png -------------------------------------------------------------------------------- /public_html/img/raw/connectedcomponents6.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/connectedcomponents6.png -------------------------------------------------------------------------------- /public_html/img/raw/connectedcomponents7.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/connectedcomponents7.png -------------------------------------------------------------------------------- /public_html/img/raw/connectedcomponents8.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/connectedcomponents8.png -------------------------------------------------------------------------------- /public_html/img/raw/controlstruct.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/controlstruct.png -------------------------------------------------------------------------------- /public_html/img/raw/convexhull.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/convexhull.png -------------------------------------------------------------------------------- /public_html/img/raw/convexhull2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/convexhull2.png -------------------------------------------------------------------------------- /public_html/img/raw/couplematch.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/couplematch.png -------------------------------------------------------------------------------- /public_html/img/raw/couplematch2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/couplematch2.png -------------------------------------------------------------------------------- /public_html/img/raw/cycle.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/cycle.png -------------------------------------------------------------------------------- /public_html/img/raw/cycle2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/cycle2.png -------------------------------------------------------------------------------- /public_html/img/raw/dfs-postorder.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/dfs-postorder.png -------------------------------------------------------------------------------- /public_html/img/raw/dfs-preorder.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/dfs-preorder.png -------------------------------------------------------------------------------- /public_html/img/raw/dfs.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/dfs.png -------------------------------------------------------------------------------- /public_html/img/raw/digraph.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/digraph.png -------------------------------------------------------------------------------- /public_html/img/raw/directedcycle.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/directedcycle.png -------------------------------------------------------------------------------- /public_html/img/raw/djikstra.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/djikstra.png -------------------------------------------------------------------------------- /public_html/img/raw/djikstra1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/djikstra1.png -------------------------------------------------------------------------------- /public_html/img/raw/djikstra2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/djikstra2.png -------------------------------------------------------------------------------- /public_html/img/raw/djikstra3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/djikstra3.png -------------------------------------------------------------------------------- /public_html/img/raw/djikstra4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/djikstra4.png -------------------------------------------------------------------------------- /public_html/img/raw/djikstra5.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/djikstra5.png -------------------------------------------------------------------------------- /public_html/img/raw/djikstra6.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/djikstra6.png -------------------------------------------------------------------------------- /public_html/img/raw/doublelinkedlist.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/doublelinkedlist.png -------------------------------------------------------------------------------- /public_html/img/raw/enumerate-sets.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/enumerate-sets.png -------------------------------------------------------------------------------- /public_html/img/raw/floodfill.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/floodfill.png -------------------------------------------------------------------------------- /public_html/img/raw/floydwarshall.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/floydwarshall.png -------------------------------------------------------------------------------- /public_html/img/raw/floydwarshall1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/floydwarshall1.png -------------------------------------------------------------------------------- /public_html/img/raw/gasproblem.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/gasproblem.png -------------------------------------------------------------------------------- /public_html/img/raw/gasproblem1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/gasproblem1.png -------------------------------------------------------------------------------- /public_html/img/raw/gasproblem2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/gasproblem2.png -------------------------------------------------------------------------------- /public_html/img/raw/gasproblem3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/gasproblem3.png -------------------------------------------------------------------------------- /public_html/img/raw/gasproblem4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/gasproblem4.png -------------------------------------------------------------------------------- /public_html/img/raw/gasproblem5.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/gasproblem5.png -------------------------------------------------------------------------------- /public_html/img/raw/gasproblem6.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/gasproblem6.png -------------------------------------------------------------------------------- /public_html/img/raw/gasproblem7.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/gasproblem7.png -------------------------------------------------------------------------------- /public_html/img/raw/gasproblem8.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/gasproblem8.png -------------------------------------------------------------------------------- /public_html/img/raw/graph.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/graph.png -------------------------------------------------------------------------------- /public_html/img/raw/hanoi.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/hanoi.png -------------------------------------------------------------------------------- /public_html/img/raw/hanoi2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/hanoi2.png -------------------------------------------------------------------------------- /public_html/img/raw/hanoi3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/hanoi3.png -------------------------------------------------------------------------------- /public_html/img/raw/hanoi4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/hanoi4.png -------------------------------------------------------------------------------- /public_html/img/raw/hanoi5.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/hanoi5.png -------------------------------------------------------------------------------- /public_html/img/raw/hanoi6.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/hanoi6.png -------------------------------------------------------------------------------- /public_html/img/raw/hashcode.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/hashcode.png -------------------------------------------------------------------------------- /public_html/img/raw/hashset.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/hashset.png -------------------------------------------------------------------------------- /public_html/img/raw/hashsetcontains.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/hashsetcontains.png -------------------------------------------------------------------------------- /public_html/img/raw/hashsetcontains2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/hashsetcontains2.png -------------------------------------------------------------------------------- /public_html/img/raw/hashsetcontains3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/hashsetcontains3.png -------------------------------------------------------------------------------- /public_html/img/raw/hashsetinsert.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/hashsetinsert.png -------------------------------------------------------------------------------- /public_html/img/raw/hashsetrem.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/hashsetrem.png -------------------------------------------------------------------------------- /public_html/img/raw/hashsetrem2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/hashsetrem2.png -------------------------------------------------------------------------------- /public_html/img/raw/hashsetrem3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/hashsetrem3.png -------------------------------------------------------------------------------- /public_html/img/raw/insertion_sort.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/insertion_sort.png -------------------------------------------------------------------------------- /public_html/img/raw/intervalschedule.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/intervalschedule.png -------------------------------------------------------------------------------- /public_html/img/raw/intervalschedule2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/intervalschedule2.png -------------------------------------------------------------------------------- /public_html/img/raw/intervalschedule3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/intervalschedule3.png -------------------------------------------------------------------------------- /public_html/img/raw/intervalschedule4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/intervalschedule4.png -------------------------------------------------------------------------------- /public_html/img/raw/kruskal.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/kruskal.png -------------------------------------------------------------------------------- /public_html/img/raw/kruskal2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/kruskal2.png -------------------------------------------------------------------------------- /public_html/img/raw/kruskal3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/kruskal3.png -------------------------------------------------------------------------------- /public_html/img/raw/kruskal4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/kruskal4.png -------------------------------------------------------------------------------- /public_html/img/raw/kruskal5.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/kruskal5.png -------------------------------------------------------------------------------- /public_html/img/raw/kruskal6.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/kruskal6.png -------------------------------------------------------------------------------- /public_html/img/raw/kruskal7.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/kruskal7.png -------------------------------------------------------------------------------- /public_html/img/raw/linked_list_converge.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/linked_list_converge.png -------------------------------------------------------------------------------- /public_html/img/raw/linkedlist.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/linkedlist.png -------------------------------------------------------------------------------- /public_html/img/raw/linkedlist2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/linkedlist2.png -------------------------------------------------------------------------------- /public_html/img/raw/linkedlist3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/linkedlist3.png -------------------------------------------------------------------------------- /public_html/img/raw/linkedlist4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/linkedlist4.png -------------------------------------------------------------------------------- /public_html/img/raw/linkedlistget.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/linkedlistget.png -------------------------------------------------------------------------------- /public_html/img/raw/linkedlistget2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/linkedlistget2.png -------------------------------------------------------------------------------- /public_html/img/raw/linkedlistget3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/linkedlistget3.png -------------------------------------------------------------------------------- /public_html/img/raw/linkedlistinsert.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/linkedlistinsert.png -------------------------------------------------------------------------------- /public_html/img/raw/linkedlistinsert2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/linkedlistinsert2.png -------------------------------------------------------------------------------- /public_html/img/raw/linkedlistpop.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/linkedlistpop.png -------------------------------------------------------------------------------- /public_html/img/raw/linkedlistpop2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/linkedlistpop2.png -------------------------------------------------------------------------------- /public_html/img/raw/linkedlistpush.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/linkedlistpush.png -------------------------------------------------------------------------------- /public_html/img/raw/linkedlistpush1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/linkedlistpush1.png -------------------------------------------------------------------------------- /public_html/img/raw/linkedlistpush2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/linkedlistpush2.png -------------------------------------------------------------------------------- /public_html/img/raw/linkedlistpush3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/linkedlistpush3.png -------------------------------------------------------------------------------- /public_html/img/raw/linkedlistrem.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/linkedlistrem.png -------------------------------------------------------------------------------- /public_html/img/raw/linkedlistrem2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/linkedlistrem2.png -------------------------------------------------------------------------------- /public_html/img/raw/maxheap.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/maxheap.png -------------------------------------------------------------------------------- /public_html/img/raw/maxheap2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/maxheap2.png -------------------------------------------------------------------------------- /public_html/img/raw/maxheappop.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/maxheappop.png -------------------------------------------------------------------------------- /public_html/img/raw/maxheappop1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/maxheappop1.png -------------------------------------------------------------------------------- /public_html/img/raw/maxheappop2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/maxheappop2.png -------------------------------------------------------------------------------- /public_html/img/raw/maxheappop3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/maxheappop3.png -------------------------------------------------------------------------------- /public_html/img/raw/maxheappush.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/maxheappush.png -------------------------------------------------------------------------------- /public_html/img/raw/maxheappush2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/maxheappush2.png -------------------------------------------------------------------------------- /public_html/img/raw/maxheappush3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/maxheappush3.png -------------------------------------------------------------------------------- /public_html/img/raw/mergesort.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/mergesort.png -------------------------------------------------------------------------------- /public_html/img/raw/nqueen.gif: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/nqueen.gif -------------------------------------------------------------------------------- /public_html/img/raw/nqueen.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/nqueen.jpg -------------------------------------------------------------------------------- /public_html/img/raw/nqueen.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/nqueen.png -------------------------------------------------------------------------------- /public_html/img/raw/nqueen1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/nqueen1.png -------------------------------------------------------------------------------- /public_html/img/raw/nqueen2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/nqueen2.png -------------------------------------------------------------------------------- /public_html/img/raw/nqueen3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/nqueen3.png -------------------------------------------------------------------------------- /public_html/img/raw/pqueue.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/pqueue.png -------------------------------------------------------------------------------- /public_html/img/raw/pqueuepop.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/pqueuepop.png -------------------------------------------------------------------------------- /public_html/img/raw/pqueuepush.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/pqueuepush.png -------------------------------------------------------------------------------- /public_html/img/raw/prim.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/prim.png -------------------------------------------------------------------------------- /public_html/img/raw/prim1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/prim1.png -------------------------------------------------------------------------------- /public_html/img/raw/prim2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/prim2.png -------------------------------------------------------------------------------- /public_html/img/raw/prim3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/prim3.png -------------------------------------------------------------------------------- /public_html/img/raw/prim4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/prim4.png -------------------------------------------------------------------------------- /public_html/img/raw/prim5.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/prim5.png -------------------------------------------------------------------------------- /public_html/img/raw/prim6.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/prim6.png -------------------------------------------------------------------------------- /public_html/img/raw/prim7.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/prim7.png -------------------------------------------------------------------------------- /public_html/img/raw/queue.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/queue.png -------------------------------------------------------------------------------- /public_html/img/raw/queue2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/queue2.png -------------------------------------------------------------------------------- /public_html/img/raw/quicksort.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/quicksort.png -------------------------------------------------------------------------------- /public_html/img/raw/recursion_grid.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/recursion_grid.png -------------------------------------------------------------------------------- /public_html/img/raw/recursion_grid2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/recursion_grid2.png -------------------------------------------------------------------------------- /public_html/img/raw/selection_sort.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/selection_sort.png -------------------------------------------------------------------------------- /public_html/img/raw/spanningtree.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/spanningtree.png -------------------------------------------------------------------------------- /public_html/img/raw/stack.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/stack.png -------------------------------------------------------------------------------- /public_html/img/raw/stack2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/stack2.png -------------------------------------------------------------------------------- /public_html/img/raw/strongconnected.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/strongconnected.png -------------------------------------------------------------------------------- /public_html/img/raw/ternarycase1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/ternarycase1.png -------------------------------------------------------------------------------- /public_html/img/raw/ternarycase11.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/ternarycase11.png -------------------------------------------------------------------------------- /public_html/img/raw/ternarycase12.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/ternarycase12.png -------------------------------------------------------------------------------- /public_html/img/raw/ternarycase2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/ternarycase2.png -------------------------------------------------------------------------------- /public_html/img/raw/ternarycase21.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/ternarycase21.png -------------------------------------------------------------------------------- /public_html/img/raw/ternarycase22.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/ternarycase22.png -------------------------------------------------------------------------------- /public_html/img/raw/ternarysearch.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/ternarysearch.png -------------------------------------------------------------------------------- /public_html/img/raw/ternarysearch2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/ternarysearch2.png -------------------------------------------------------------------------------- /public_html/img/raw/ternarysearch3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/ternarysearch3.png -------------------------------------------------------------------------------- /public_html/img/raw/ternarysearch4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/ternarysearch4.png -------------------------------------------------------------------------------- /public_html/img/raw/ternarysearch5.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/ternarysearch5.png -------------------------------------------------------------------------------- /public_html/img/raw/ternarysearch6.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/ternarysearch6.png -------------------------------------------------------------------------------- /public_html/img/raw/ternarysearch7.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/ternarysearch7.png -------------------------------------------------------------------------------- /public_html/img/raw/topsort.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/topsort.png -------------------------------------------------------------------------------- /public_html/img/raw/tree.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/tree.png -------------------------------------------------------------------------------- /public_html/img/raw/treegraph.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/treegraph.png -------------------------------------------------------------------------------- /public_html/img/raw/treeroot.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/treeroot.png -------------------------------------------------------------------------------- /public_html/img/raw/vector.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/vector.png -------------------------------------------------------------------------------- /public_html/img/raw/vector2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/vector2.png -------------------------------------------------------------------------------- /public_html/img/raw/vector3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/vector3.png -------------------------------------------------------------------------------- /public_html/img/raw/vector4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/vector4.png -------------------------------------------------------------------------------- /public_html/img/raw/vectorget.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/vectorget.png -------------------------------------------------------------------------------- /public_html/img/raw/vectorinsert.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/vectorinsert.png -------------------------------------------------------------------------------- /public_html/img/raw/vectorinsert2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/raw/vectorinsert2.png -------------------------------------------------------------------------------- /public_html/img/squared_metal.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/squared_metal.png -------------------------------------------------------------------------------- /public_html/img/uploads/adt.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/adt.png -------------------------------------------------------------------------------- /public_html/img/uploads/array.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/array.png -------------------------------------------------------------------------------- /public_html/img/uploads/array2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/array2.png -------------------------------------------------------------------------------- /public_html/img/uploads/array3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/array3.png -------------------------------------------------------------------------------- /public_html/img/uploads/backtracking.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/backtracking.png -------------------------------------------------------------------------------- /public_html/img/uploads/basic.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/basic.png -------------------------------------------------------------------------------- /public_html/img/uploads/bellmanford.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bellmanford.png -------------------------------------------------------------------------------- /public_html/img/uploads/bellmanford2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bellmanford2.png -------------------------------------------------------------------------------- /public_html/img/uploads/bellmanford3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bellmanford3.png -------------------------------------------------------------------------------- /public_html/img/uploads/bellmanford4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bellmanford4.png -------------------------------------------------------------------------------- /public_html/img/uploads/bellmanford5.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bellmanford5.png -------------------------------------------------------------------------------- /public_html/img/uploads/bfs.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bfs.png -------------------------------------------------------------------------------- /public_html/img/uploads/binarysearch.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/binarysearch.png -------------------------------------------------------------------------------- /public_html/img/uploads/binarytree.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/binarytree.png -------------------------------------------------------------------------------- /public_html/img/uploads/bottle.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bottle.png -------------------------------------------------------------------------------- /public_html/img/uploads/bst-rem-case1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bst-rem-case1.png -------------------------------------------------------------------------------- /public_html/img/uploads/bst-rem-case11.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bst-rem-case11.png -------------------------------------------------------------------------------- /public_html/img/uploads/bst-rem-case12.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bst-rem-case12.png -------------------------------------------------------------------------------- /public_html/img/uploads/bst-rem-case2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bst-rem-case2.png -------------------------------------------------------------------------------- /public_html/img/uploads/bst-rem-case21.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bst-rem-case21.png -------------------------------------------------------------------------------- /public_html/img/uploads/bst-rem-case22.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bst-rem-case22.png -------------------------------------------------------------------------------- /public_html/img/uploads/bst-rem-case3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bst-rem-case3.png -------------------------------------------------------------------------------- /public_html/img/uploads/bst-rem-case31.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bst-rem-case31.png -------------------------------------------------------------------------------- /public_html/img/uploads/bst-rem-case32.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bst-rem-case32.png -------------------------------------------------------------------------------- /public_html/img/uploads/bst-rem-case33.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bst-rem-case33.png -------------------------------------------------------------------------------- /public_html/img/uploads/bst-rem-case34.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bst-rem-case34.png -------------------------------------------------------------------------------- /public_html/img/uploads/bst-rem.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bst-rem.png -------------------------------------------------------------------------------- /public_html/img/uploads/bst.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bst.png -------------------------------------------------------------------------------- /public_html/img/uploads/bstcompare.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bstcompare.png -------------------------------------------------------------------------------- /public_html/img/uploads/bstcontains.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bstcontains.png -------------------------------------------------------------------------------- /public_html/img/uploads/bstcontains2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bstcontains2.png -------------------------------------------------------------------------------- /public_html/img/uploads/bstcontains3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bstcontains3.png -------------------------------------------------------------------------------- /public_html/img/uploads/bstcontains4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bstcontains4.png -------------------------------------------------------------------------------- /public_html/img/uploads/bstinsert.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bstinsert.png -------------------------------------------------------------------------------- /public_html/img/uploads/bstinsert2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bstinsert2.png -------------------------------------------------------------------------------- /public_html/img/uploads/bstinsert3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bstinsert3.png -------------------------------------------------------------------------------- /public_html/img/uploads/bstinsert4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bstinsert4.png -------------------------------------------------------------------------------- /public_html/img/uploads/bubble_sort.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bubble_sort.png -------------------------------------------------------------------------------- /public_html/img/uploads/bucket.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bucket.png -------------------------------------------------------------------------------- /public_html/img/uploads/bucket2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bucket2.png -------------------------------------------------------------------------------- /public_html/img/uploads/bucket3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bucket3.png -------------------------------------------------------------------------------- /public_html/img/uploads/bucket4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/bucket4.png -------------------------------------------------------------------------------- /public_html/img/uploads/centergraph.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/centergraph.png -------------------------------------------------------------------------------- /public_html/img/uploads/connectedcomponents.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/connectedcomponents.png -------------------------------------------------------------------------------- /public_html/img/uploads/connectedcomponents2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/connectedcomponents2.png -------------------------------------------------------------------------------- /public_html/img/uploads/connectedcomponents3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/connectedcomponents3.png -------------------------------------------------------------------------------- /public_html/img/uploads/connectedcomponents4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/connectedcomponents4.png -------------------------------------------------------------------------------- /public_html/img/uploads/connectedcomponents5.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/connectedcomponents5.png -------------------------------------------------------------------------------- /public_html/img/uploads/connectedcomponents6.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/connectedcomponents6.png -------------------------------------------------------------------------------- /public_html/img/uploads/connectedcomponents7.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/connectedcomponents7.png -------------------------------------------------------------------------------- /public_html/img/uploads/connectedcomponents8.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/connectedcomponents8.png -------------------------------------------------------------------------------- /public_html/img/uploads/controlstruct.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/controlstruct.png -------------------------------------------------------------------------------- /public_html/img/uploads/convexhull.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/convexhull.png -------------------------------------------------------------------------------- /public_html/img/uploads/convexhull2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/convexhull2.png -------------------------------------------------------------------------------- /public_html/img/uploads/couplematch.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/couplematch.png -------------------------------------------------------------------------------- /public_html/img/uploads/couplematch2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/couplematch2.png -------------------------------------------------------------------------------- /public_html/img/uploads/cycle.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/cycle.png -------------------------------------------------------------------------------- /public_html/img/uploads/cycle2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/cycle2.png -------------------------------------------------------------------------------- /public_html/img/uploads/dfs-postorder.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/dfs-postorder.png -------------------------------------------------------------------------------- /public_html/img/uploads/dfs-preorder.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/dfs-preorder.png -------------------------------------------------------------------------------- /public_html/img/uploads/dfs.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/dfs.png -------------------------------------------------------------------------------- /public_html/img/uploads/digraph.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/digraph.png -------------------------------------------------------------------------------- /public_html/img/uploads/djikstra.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/djikstra.png -------------------------------------------------------------------------------- /public_html/img/uploads/djikstra1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/djikstra1.png -------------------------------------------------------------------------------- /public_html/img/uploads/djikstra2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/djikstra2.png -------------------------------------------------------------------------------- /public_html/img/uploads/djikstra3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/djikstra3.png -------------------------------------------------------------------------------- /public_html/img/uploads/djikstra4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/djikstra4.png -------------------------------------------------------------------------------- /public_html/img/uploads/djikstra5.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/djikstra5.png -------------------------------------------------------------------------------- /public_html/img/uploads/djikstra6.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/djikstra6.png -------------------------------------------------------------------------------- /public_html/img/uploads/doublelinkedlist.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/doublelinkedlist.png -------------------------------------------------------------------------------- /public_html/img/uploads/enumerate-sets.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/enumerate-sets.png -------------------------------------------------------------------------------- /public_html/img/uploads/floodfill.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/floodfill.png -------------------------------------------------------------------------------- /public_html/img/uploads/floydwarshall.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/floydwarshall.png -------------------------------------------------------------------------------- /public_html/img/uploads/floydwarshall1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/floydwarshall1.png -------------------------------------------------------------------------------- /public_html/img/uploads/gasproblem.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/gasproblem.png -------------------------------------------------------------------------------- /public_html/img/uploads/gasproblem1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/gasproblem1.png -------------------------------------------------------------------------------- /public_html/img/uploads/gasproblem2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/gasproblem2.png -------------------------------------------------------------------------------- /public_html/img/uploads/gasproblem3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/gasproblem3.png -------------------------------------------------------------------------------- /public_html/img/uploads/gasproblem4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/gasproblem4.png -------------------------------------------------------------------------------- /public_html/img/uploads/gasproblem5.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/gasproblem5.png -------------------------------------------------------------------------------- /public_html/img/uploads/gasproblem6.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/gasproblem6.png -------------------------------------------------------------------------------- /public_html/img/uploads/gasproblem7.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/gasproblem7.png -------------------------------------------------------------------------------- /public_html/img/uploads/gasproblem8.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/gasproblem8.png -------------------------------------------------------------------------------- /public_html/img/uploads/graph.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/graph.png -------------------------------------------------------------------------------- /public_html/img/uploads/hanoi.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/hanoi.png -------------------------------------------------------------------------------- /public_html/img/uploads/hanoi2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/hanoi2.png -------------------------------------------------------------------------------- /public_html/img/uploads/hanoi3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/hanoi3.png -------------------------------------------------------------------------------- /public_html/img/uploads/hanoi4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/hanoi4.png -------------------------------------------------------------------------------- /public_html/img/uploads/hanoi5.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/hanoi5.png -------------------------------------------------------------------------------- /public_html/img/uploads/hanoi6.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/hanoi6.png -------------------------------------------------------------------------------- /public_html/img/uploads/hashcode.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/hashcode.png -------------------------------------------------------------------------------- /public_html/img/uploads/hashset.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/hashset.png -------------------------------------------------------------------------------- /public_html/img/uploads/hashsetcontains.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/hashsetcontains.png -------------------------------------------------------------------------------- /public_html/img/uploads/hashsetcontains2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/hashsetcontains2.png -------------------------------------------------------------------------------- /public_html/img/uploads/hashsetcontains3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/hashsetcontains3.png -------------------------------------------------------------------------------- /public_html/img/uploads/hashsetinsert.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/hashsetinsert.png -------------------------------------------------------------------------------- /public_html/img/uploads/hashsetrem.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/hashsetrem.png -------------------------------------------------------------------------------- /public_html/img/uploads/hashsetrem2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/hashsetrem2.png -------------------------------------------------------------------------------- /public_html/img/uploads/hashsetrem3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/hashsetrem3.png -------------------------------------------------------------------------------- /public_html/img/uploads/insertion_sort.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/insertion_sort.png -------------------------------------------------------------------------------- /public_html/img/uploads/intervalschedule.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/intervalschedule.png -------------------------------------------------------------------------------- /public_html/img/uploads/intervalschedule2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/intervalschedule2.png -------------------------------------------------------------------------------- /public_html/img/uploads/intervalschedule3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/intervalschedule3.png -------------------------------------------------------------------------------- /public_html/img/uploads/intervalschedule4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/intervalschedule4.png -------------------------------------------------------------------------------- /public_html/img/uploads/kruskal.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/kruskal.png -------------------------------------------------------------------------------- /public_html/img/uploads/kruskal2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/kruskal2.png -------------------------------------------------------------------------------- /public_html/img/uploads/kruskal3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/kruskal3.png -------------------------------------------------------------------------------- /public_html/img/uploads/kruskal4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/kruskal4.png -------------------------------------------------------------------------------- /public_html/img/uploads/kruskal5.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/kruskal5.png -------------------------------------------------------------------------------- /public_html/img/uploads/kruskal6.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/kruskal6.png -------------------------------------------------------------------------------- /public_html/img/uploads/kruskal7.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/kruskal7.png -------------------------------------------------------------------------------- /public_html/img/uploads/linkedlist.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/linkedlist.png -------------------------------------------------------------------------------- /public_html/img/uploads/linkedlist2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/linkedlist2.png -------------------------------------------------------------------------------- /public_html/img/uploads/linkedlist3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/linkedlist3.png -------------------------------------------------------------------------------- /public_html/img/uploads/linkedlist4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/linkedlist4.png -------------------------------------------------------------------------------- /public_html/img/uploads/linkedlistconverge.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/linkedlistconverge.png -------------------------------------------------------------------------------- /public_html/img/uploads/linkedlistget.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/linkedlistget.png -------------------------------------------------------------------------------- /public_html/img/uploads/linkedlistget2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/linkedlistget2.png -------------------------------------------------------------------------------- /public_html/img/uploads/linkedlistget3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/linkedlistget3.png -------------------------------------------------------------------------------- /public_html/img/uploads/linkedlistinsert.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/linkedlistinsert.png -------------------------------------------------------------------------------- /public_html/img/uploads/linkedlistinsert2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/linkedlistinsert2.png -------------------------------------------------------------------------------- /public_html/img/uploads/linkedlistpop.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/linkedlistpop.png -------------------------------------------------------------------------------- /public_html/img/uploads/linkedlistpop2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/linkedlistpop2.png -------------------------------------------------------------------------------- /public_html/img/uploads/linkedlistpush.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/linkedlistpush.png -------------------------------------------------------------------------------- /public_html/img/uploads/linkedlistpush1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/linkedlistpush1.png -------------------------------------------------------------------------------- /public_html/img/uploads/linkedlistpush2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/linkedlistpush2.png -------------------------------------------------------------------------------- /public_html/img/uploads/linkedlistpush3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/linkedlistpush3.png -------------------------------------------------------------------------------- /public_html/img/uploads/linkedlistrem.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/linkedlistrem.png -------------------------------------------------------------------------------- /public_html/img/uploads/linkedlistrem2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/linkedlistrem2.png -------------------------------------------------------------------------------- /public_html/img/uploads/maxheap.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/maxheap.png -------------------------------------------------------------------------------- /public_html/img/uploads/maxheap2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/maxheap2.png -------------------------------------------------------------------------------- /public_html/img/uploads/maxheappop.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/maxheappop.png -------------------------------------------------------------------------------- /public_html/img/uploads/maxheappop1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/maxheappop1.png -------------------------------------------------------------------------------- /public_html/img/uploads/maxheappop2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/maxheappop2.png -------------------------------------------------------------------------------- /public_html/img/uploads/maxheappop3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/maxheappop3.png -------------------------------------------------------------------------------- /public_html/img/uploads/maxheappush.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/maxheappush.png -------------------------------------------------------------------------------- /public_html/img/uploads/maxheappush2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/maxheappush2.png -------------------------------------------------------------------------------- /public_html/img/uploads/maxheappush3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/maxheappush3.png -------------------------------------------------------------------------------- /public_html/img/uploads/mergesort.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/mergesort.png -------------------------------------------------------------------------------- /public_html/img/uploads/nqueen.gif: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/nqueen.gif -------------------------------------------------------------------------------- /public_html/img/uploads/nqueen.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/nqueen.jpg -------------------------------------------------------------------------------- /public_html/img/uploads/nqueen.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/nqueen.png -------------------------------------------------------------------------------- /public_html/img/uploads/nqueen1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/nqueen1.png -------------------------------------------------------------------------------- /public_html/img/uploads/nqueen2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/nqueen2.png -------------------------------------------------------------------------------- /public_html/img/uploads/nqueen3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/nqueen3.png -------------------------------------------------------------------------------- /public_html/img/uploads/pqueue.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/pqueue.png -------------------------------------------------------------------------------- /public_html/img/uploads/pqueuepop.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/pqueuepop.png -------------------------------------------------------------------------------- /public_html/img/uploads/pqueuepush.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/pqueuepush.png -------------------------------------------------------------------------------- /public_html/img/uploads/prim.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/prim.png -------------------------------------------------------------------------------- /public_html/img/uploads/prim1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/prim1.png -------------------------------------------------------------------------------- /public_html/img/uploads/prim2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/prim2.png -------------------------------------------------------------------------------- /public_html/img/uploads/prim3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/prim3.png -------------------------------------------------------------------------------- /public_html/img/uploads/prim4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/prim4.png -------------------------------------------------------------------------------- /public_html/img/uploads/prim5.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/prim5.png -------------------------------------------------------------------------------- /public_html/img/uploads/prim6.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/prim6.png -------------------------------------------------------------------------------- /public_html/img/uploads/prim7.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/prim7.png -------------------------------------------------------------------------------- /public_html/img/uploads/queue.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/queue.png -------------------------------------------------------------------------------- /public_html/img/uploads/queue2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/queue2.png -------------------------------------------------------------------------------- /public_html/img/uploads/quicksort.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/quicksort.png -------------------------------------------------------------------------------- /public_html/img/uploads/recursion_grid.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/recursion_grid.png -------------------------------------------------------------------------------- /public_html/img/uploads/recursion_grid2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/recursion_grid2.png -------------------------------------------------------------------------------- /public_html/img/uploads/selection_sort.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/selection_sort.png -------------------------------------------------------------------------------- /public_html/img/uploads/spanningtree.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/spanningtree.png -------------------------------------------------------------------------------- /public_html/img/uploads/stack.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/stack.png -------------------------------------------------------------------------------- /public_html/img/uploads/stack2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/stack2.png -------------------------------------------------------------------------------- /public_html/img/uploads/strongconnected.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/strongconnected.png -------------------------------------------------------------------------------- /public_html/img/uploads/ternarycase1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/ternarycase1.png -------------------------------------------------------------------------------- /public_html/img/uploads/ternarycase11.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/ternarycase11.png -------------------------------------------------------------------------------- /public_html/img/uploads/ternarycase12.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/ternarycase12.png -------------------------------------------------------------------------------- /public_html/img/uploads/ternarycase2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/ternarycase2.png -------------------------------------------------------------------------------- /public_html/img/uploads/ternarycase21.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/ternarycase21.png -------------------------------------------------------------------------------- /public_html/img/uploads/ternarycase22.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/ternarycase22.png -------------------------------------------------------------------------------- /public_html/img/uploads/ternarysearch.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/ternarysearch.png -------------------------------------------------------------------------------- /public_html/img/uploads/ternarysearch2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/ternarysearch2.png -------------------------------------------------------------------------------- /public_html/img/uploads/ternarysearch3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/ternarysearch3.png -------------------------------------------------------------------------------- /public_html/img/uploads/ternarysearch4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/ternarysearch4.png -------------------------------------------------------------------------------- /public_html/img/uploads/ternarysearch5.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/ternarysearch5.png -------------------------------------------------------------------------------- /public_html/img/uploads/ternarysearch6.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/ternarysearch6.png -------------------------------------------------------------------------------- /public_html/img/uploads/ternarysearch7.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/ternarysearch7.png -------------------------------------------------------------------------------- /public_html/img/uploads/topsort.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/topsort.png -------------------------------------------------------------------------------- /public_html/img/uploads/tree.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/tree.png -------------------------------------------------------------------------------- /public_html/img/uploads/treegraph.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/treegraph.png -------------------------------------------------------------------------------- /public_html/img/uploads/treeroot.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/treeroot.png -------------------------------------------------------------------------------- /public_html/img/uploads/vector.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/vector.png -------------------------------------------------------------------------------- /public_html/img/uploads/vector2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/vector2.png -------------------------------------------------------------------------------- /public_html/img/uploads/vector3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/vector3.png -------------------------------------------------------------------------------- /public_html/img/uploads/vector4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/vector4.png -------------------------------------------------------------------------------- /public_html/img/uploads/vectorget.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/vectorget.png -------------------------------------------------------------------------------- /public_html/img/uploads/vectorinsert.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/vectorinsert.png -------------------------------------------------------------------------------- /public_html/img/uploads/vectorinsert2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ayoungprogrammer/CSHandbook/6c2669389dc3c550b95ecfc0f6ef484fbf47bda6/public_html/img/uploads/vectorinsert2.png -------------------------------------------------------------------------------- /public_html/js/responsive_nav.js: -------------------------------------------------------------------------------- 1 | $(document).ready(function() { 2 | var pull = $('#pull'); 3 | menu = $('nav ul'); 4 | menuHeight = menu.height(); 5 | 6 | $('nav>ul>li:first-child>a').on('click', function(e){ 7 | e.preventDefault(); 8 | }); 9 | if ($(window).width() < 700){ 10 | menu.hide(); 11 | } 12 | $(pull).on('click', function(e) { 13 | 14 | //console.log(menu.css("height")); 15 | if (menu.css("display")=="none"){ 16 | menu.slideDown(); 17 | 18 | } 19 | else{ 20 | menu.slideUp(); 21 | 22 | } 23 | }); 24 | $(window).resize(function(){ 25 | var w = $(window).width(); 26 | if(w > 320 && menu.is(':hidden')) { 27 | menu.removeAttr('style'); 28 | } 29 | if(w < 700) { 30 | menu.slideUp(0); 31 | } 32 | 33 | if(w < 700){ 34 | $('.vertadbox').hide(); 35 | }else { 36 | if($('.vertadbox').is(':hidden')){ 37 | $('.vertadbox').show(); 38 | } 39 | } 40 | }); 41 | }); -------------------------------------------------------------------------------- /public_html/js/responsive_table.js: -------------------------------------------------------------------------------- 1 | function resizeTable (){ 2 | var windowWidth = $(window).width(); 3 | var table = $('section table'); 4 | if (windowWidth<700){ 5 | if (!table.parent().is('div')){ 6 | $('section table').wrap('
'); 7 | } 8 | var tableWidth = $(window).width() - 70; 9 | //console.log(tableWidth); 10 | $('section div').css('width', tableWidth); 11 | } else { 12 | if (!table.parent().is('div')){ 13 | //$('section table').unwrap('
'); 14 | } 15 | } 16 | } 17 | (function(){ 18 | resizeTable(); 19 | })(); 20 | $(window).resize(function(){ 21 | resizeTable(); 22 | }); -------------------------------------------------------------------------------- /public_html/stylesheets/reset.css: -------------------------------------------------------------------------------- 1 | /* Eric Meyer's Reset CSS v2.0 - http://cssreset.com */ 2 | h1,h2,h3,h4,h5,h6{font-size:100%;font:inherit;} -------------------------------------------------------------------------------- /public_html/vendor/prettify/desert.css: -------------------------------------------------------------------------------- 1 | /* desert scheme ported from vim to google prettify */ 2 | pre.prettyprint { display: block; background-color: #333 } 3 | pre .nocode { background-color: none; color: #000 } 4 | pre .str { color: #ffa0a0 } /* string - pink */ 5 | pre .kwd { color: #f0e68c; font-weight: bold } 6 | pre .com { color: #87ceeb } /* comment - skyblue */ 7 | pre .typ { color: #98fb98 } /* type - lightgreen */ 8 | pre .lit { color: #cd5c5c } /* literal - darkred */ 9 | pre .pun { color: #fff } /* punctuation */ 10 | pre .pln { color: #fff } /* plaintext */ 11 | pre .tag { color: #f0e68c; font-weight: bold } /* html/xml tag - lightyellow */ 12 | pre .atn { color: #bdb76b; font-weight: bold } /* attribute name - khaki */ 13 | pre .atv { color: #ffa0a0 } /* attribute value - pink */ 14 | pre .dec { color: #98fb98 } /* decimal - lightgreen */ 15 | 16 | /* Specify class=linenums on a pre to get line numbering */ 17 | ol.linenums { margin-top: 0; margin-bottom: 0; color: #AEAEAE } /* IE indents via margin-left */ 18 | li.L0,li.L1,li.L2,li.L3,li.L5,li.L6,li.L7,li.L8 {} 19 | /* Alternate shading for lines */ 20 | li.L1,li.L3,li.L5,li.L7,li.L9 { } 21 | 22 | @media print { 23 | pre.prettyprint { background-color: none } 24 | pre .str, code .str { color: #060 } 25 | pre .kwd, code .kwd { color: #006; font-weight: bold } 26 | pre .com, code .com { color: #600; font-style: italic } 27 | pre .typ, code .typ { color: #404; font-weight: bold } 28 | pre .lit, code .lit { color: #044 } 29 | pre .pun, code .pun { color: #440 } 30 | pre .pln, code .pln { color: #000 } 31 | pre .tag, code .tag { color: #006; font-weight: bold } 32 | pre .atn, code .atn { color: #404 } 33 | pre .atv, code .atv { color: #060 } 34 | } -------------------------------------------------------------------------------- /public_html/vendor/prettify/lang-apollo.js: -------------------------------------------------------------------------------- 1 | PR.registerLangHandler(PR.createSimpleLexer([["com",/^#[^\n\r]*/,null,"#"],["pln",/^[\t\n\r \xa0]+/,null,"\t\n\r \u00a0"],["str",/^"(?:[^"\\]|\\[\S\s])*(?:"|$)/,null,'"']],[["kwd",/^(?:ADS|AD|AUG|BZF|BZMF|CAE|CAF|CA|CCS|COM|CS|DAS|DCA|DCOM|DCS|DDOUBL|DIM|DOUBLE|DTCB|DTCF|DV|DXCH|EDRUPT|EXTEND|INCR|INDEX|NDX|INHINT|LXCH|MASK|MSK|MP|MSU|NOOP|OVSK|QXCH|RAND|READ|RELINT|RESUME|RETURN|ROR|RXOR|SQUARE|SU|TCR|TCAA|OVSK|TCF|TC|TS|WAND|WOR|WRITE|XCH|XLQ|XXALQ|ZL|ZQ|ADD|ADZ|SUB|SUZ|MPY|MPR|MPZ|DVP|COM|ABS|CLA|CLZ|LDQ|STO|STQ|ALS|LLS|LRS|TRA|TSQ|TMI|TOV|AXT|TIX|DLY|INP|OUT)\s/, 2 | null],["typ",/^(?:-?GENADR|=MINUS|2BCADR|VN|BOF|MM|-?2CADR|-?[1-6]DNADR|ADRES|BBCON|[ES]?BANK=?|BLOCK|BNKSUM|E?CADR|COUNT\*?|2?DEC\*?|-?DNCHAN|-?DNPTR|EQUALS|ERASE|MEMORY|2?OCT|REMADR|SETLOC|SUBRO|ORG|BSS|BES|SYN|EQU|DEFINE|END)\s/,null],["lit",/^'(?:-*(?:\w|\\[!-~])(?:[\w-]*|\\[!-~])[!=?]?)?/],["pln",/^-*(?:[!-z]|\\[!-~])(?:[\w-]*|\\[!-~])[!=?]?/],["pun",/^[^\w\t\n\r "'-);\\\xa0]+/]]),["apollo","agc","aea"]); 3 | -------------------------------------------------------------------------------- /public_html/vendor/prettify/lang-basic.js: -------------------------------------------------------------------------------- 1 | var a=null; 2 | PR.registerLangHandler(PR.createSimpleLexer([["str",/^"(?:[^\n\r"\\]|\\.)*(?:"|$)/,a,'"'],["pln",/^\s+/,a," \r\n\t\u00a0"]],[["com",/^REM[^\n\r]*/,a],["kwd",/^\b(?:AND|CLOSE|CLR|CMD|CONT|DATA|DEF ?FN|DIM|END|FOR|GET|GOSUB|GOTO|IF|INPUT|LET|LIST|LOAD|NEW|NEXT|NOT|ON|OPEN|OR|POKE|PRINT|READ|RESTORE|RETURN|RUN|SAVE|STEP|STOP|SYS|THEN|TO|VERIFY|WAIT)\b/,a],["pln",/^[a-z][^\W_]?(?:\$|%)?/i,a],["lit",/^(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?/i,a,"0123456789"],["pun", 3 | /^.[^\s\w"$%.]*/,a]]),["basic","cbm"]); 4 | -------------------------------------------------------------------------------- /public_html/vendor/prettify/lang-clj.js: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2011 Google Inc. 3 | 4 | Licensed under the Apache License, Version 2.0 (the "License"); 5 | you may not use this file except in compliance with the License. 6 | You may obtain a copy of the License at 7 | 8 | http://www.apache.org/licenses/LICENSE-2.0 9 | 10 | Unless required by applicable law or agreed to in writing, software 11 | distributed under the License is distributed on an "AS IS" BASIS, 12 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 13 | See the License for the specific language governing permissions and 14 | limitations under the License. 15 | */ 16 | var a=null; 17 | PR.registerLangHandler(PR.createSimpleLexer([["opn",/^[([{]+/,a,"([{"],["clo",/^[)\]}]+/,a,")]}"],["com",/^;[^\n\r]*/,a,";"],["pln",/^[\t\n\r \xa0]+/,a,"\t\n\r \u00a0"],["str",/^"(?:[^"\\]|\\[\S\s])*(?:"|$)/,a,'"']],[["kwd",/^(?:def|if|do|let|quote|var|fn|loop|recur|throw|try|monitor-enter|monitor-exit|defmacro|defn|defn-|macroexpand|macroexpand-1|for|doseq|dosync|dotimes|and|or|when|not|assert|doto|proxy|defstruct|first|rest|cons|defprotocol|deftype|defrecord|reify|defmulti|defmethod|meta|with-meta|ns|in-ns|create-ns|import|intern|refer|alias|namespace|resolve|ref|deref|refset|new|set!|memfn|to-array|into-array|aset|gen-class|reduce|map|filter|find|nil?|empty?|hash-map|hash-set|vec|vector|seq|flatten|reverse|assoc|dissoc|list|list?|disj|get|union|difference|intersection|extend|extend-type|extend-protocol|prn)\b/,a], 18 | ["typ",/^:[\dA-Za-z-]+/]]),["clj"]); 19 | -------------------------------------------------------------------------------- /public_html/vendor/prettify/lang-css.js: -------------------------------------------------------------------------------- 1 | PR.registerLangHandler(PR.createSimpleLexer([["pln",/^[\t\n\f\r ]+/,null," \t\r\n\u000c"]],[["str",/^"(?:[^\n\f\r"\\]|\\(?:\r\n?|\n|\f)|\\[\S\s])*"/,null],["str",/^'(?:[^\n\f\r'\\]|\\(?:\r\n?|\n|\f)|\\[\S\s])*'/,null],["lang-css-str",/^url\(([^"')]+)\)/i],["kwd",/^(?:url|rgb|!important|@import|@page|@media|@charset|inherit)(?=[^\w-]|$)/i,null],["lang-css-kw",/^(-?(?:[_a-z]|\\[\da-f]+ ?)(?:[\w-]|\\\\[\da-f]+ ?)*)\s*:/i],["com",/^\/\*[^*]*\*+(?:[^*/][^*]*\*+)*\//], 2 | ["com",/^(?:<\!--|--\>)/],["lit",/^(?:\d+|\d*\.\d+)(?:%|[a-z]+)?/i],["lit",/^#[\da-f]{3,6}\b/i],["pln",/^-?(?:[_a-z]|\\[\da-f]+ ?)(?:[\w-]|\\\\[\da-f]+ ?)*/i],["pun",/^[^\s\w"']+/]]),["css"]);PR.registerLangHandler(PR.createSimpleLexer([],[["kwd",/^-?(?:[_a-z]|\\[\da-f]+ ?)(?:[\w-]|\\\\[\da-f]+ ?)*/i]]),["css-kw"]);PR.registerLangHandler(PR.createSimpleLexer([],[["str",/^[^"')]+/]]),["css-str"]); 3 | -------------------------------------------------------------------------------- /public_html/vendor/prettify/lang-dart.js: -------------------------------------------------------------------------------- 1 | PR.registerLangHandler(PR.createSimpleLexer([["pln",/^[\t\n\r \xa0]+/,null,"\t\n\r \u00a0"]],[["com",/^#!.*/],["kwd",/^\b(?:import|library|part of|part|as|show|hide)\b/i],["com",/^\/\/.*/],["com",/^\/\*[^*]*\*+(?:[^*/][^*]*\*+)*\//],["kwd",/^\b(?:class|interface)\b/i],["kwd",/^\b(?:assert|break|case|catch|continue|default|do|else|finally|for|if|in|is|new|return|super|switch|this|throw|try|while)\b/i],["kwd",/^\b(?:abstract|const|extends|factory|final|get|implements|native|operator|set|static|typedef|var)\b/i], 2 | ["typ",/^\b(?:bool|double|dynamic|int|num|object|string|void)\b/i],["kwd",/^\b(?:false|null|true)\b/i],["str",/^r?'''[\S\s]*?[^\\]'''/],["str",/^r?"""[\S\s]*?[^\\]"""/],["str",/^r?'('|[^\n\f\r]*?[^\\]')/],["str",/^r?"("|[^\n\f\r]*?[^\\]")/],["pln",/^[$_a-z]\w*/i],["pun",/^[!%&*+/:<-?^|~-]/],["lit",/^\b0x[\da-f]+/i],["lit",/^\b\d+(?:\.\d*)?(?:e[+-]?\d+)?/i],["lit",/^\b\.\d+(?:e[+-]?\d+)?/i],["pun",/^[(),.;[\]{}]/]]), 3 | ["dart"]); 4 | -------------------------------------------------------------------------------- /public_html/vendor/prettify/lang-erlang.js: -------------------------------------------------------------------------------- 1 | PR.registerLangHandler(PR.createSimpleLexer([["pln",/^[\t-\r ]+/,null,"\t\n\u000b\u000c\r "],["str",/^"(?:[^\n\f\r"\\]|\\[\S\s])*(?:"|$)/,null,'"'],["lit",/^[a-z]\w*/],["lit",/^'(?:[^\n\f\r'\\]|\\[^&])+'?/,null,"'"],["lit",/^\?[^\t\n ({]+/,null,"?"],["lit",/^(?:0o[0-7]+|0x[\da-f]+|\d+(?:\.\d+)?(?:e[+-]?\d+)?)/i,null,"0123456789"]],[["com",/^%[^\n]*/],["kwd",/^(?:module|attributes|do|let|in|letrec|apply|call|primop|case|of|end|when|fun|try|catch|receive|after|char|integer|float,atom,string,var)\b/], 2 | ["kwd",/^-[_a-z]+/],["typ",/^[A-Z_]\w*/],["pun",/^[,.;]/]]),["erlang","erl"]); 3 | -------------------------------------------------------------------------------- /public_html/vendor/prettify/lang-go.js: -------------------------------------------------------------------------------- 1 | PR.registerLangHandler(PR.createSimpleLexer([["pln",/^[\t\n\r \xa0]+/,null,"\t\n\r \u00a0"],["pln",/^(?:"(?:[^"\\]|\\[\S\s])*(?:"|$)|'(?:[^'\\]|\\[\S\s])+(?:'|$)|`[^`]*(?:`|$))/,null,"\"'"]],[["com",/^(?:\/\/[^\n\r]*|\/\*[\S\s]*?\*\/)/],["pln",/^(?:[^"'/`]|\/(?![*/]))+/]]),["go"]); 2 | -------------------------------------------------------------------------------- /public_html/vendor/prettify/lang-hs.js: -------------------------------------------------------------------------------- 1 | PR.registerLangHandler(PR.createSimpleLexer([["pln",/^[\t-\r ]+/,null,"\t\n\u000b\u000c\r "],["str",/^"(?:[^\n\f\r"\\]|\\[\S\s])*(?:"|$)/,null,'"'],["str",/^'(?:[^\n\f\r'\\]|\\[^&])'?/,null,"'"],["lit",/^(?:0o[0-7]+|0x[\da-f]+|\d+(?:\.\d+)?(?:e[+-]?\d+)?)/i,null,"0123456789"]],[["com",/^(?:--+[^\n\f\r]*|{-(?:[^-]|-+[^}-])*-})/],["kwd",/^(?:case|class|data|default|deriving|do|else|if|import|in|infix|infixl|infixr|instance|let|module|newtype|of|then|type|where|_)(?=[^\d'A-Za-z]|$)/, 2 | null],["pln",/^(?:[A-Z][\w']*\.)*[A-Za-z][\w']*/],["pun",/^[^\d\t-\r "'A-Za-z]+/]]),["hs"]); 3 | -------------------------------------------------------------------------------- /public_html/vendor/prettify/lang-lisp.js: -------------------------------------------------------------------------------- 1 | var a=null; 2 | PR.registerLangHandler(PR.createSimpleLexer([["opn",/^\(+/,a,"("],["clo",/^\)+/,a,")"],["com",/^;[^\n\r]*/,a,";"],["pln",/^[\t\n\r \xa0]+/,a,"\t\n\r \u00a0"],["str",/^"(?:[^"\\]|\\[\S\s])*(?:"|$)/,a,'"']],[["kwd",/^(?:block|c[ad]+r|catch|con[ds]|def(?:ine|un)|do|eq|eql|equal|equalp|eval-when|flet|format|go|if|labels|lambda|let|load-time-value|locally|macrolet|multiple-value-call|nil|progn|progv|quote|require|return-from|setq|symbol-macrolet|t|tagbody|the|throw|unwind)\b/,a], 3 | ["lit",/^[+-]?(?:[#0]x[\da-f]+|\d+\/\d+|(?:\.\d+|\d+(?:\.\d*)?)(?:[de][+-]?\d+)?)/i],["lit",/^'(?:-*(?:\w|\\[!-~])(?:[\w-]*|\\[!-~])[!=?]?)?/],["pln",/^-*(?:[_a-z]|\\[!-~])(?:[\w-]*|\\[!-~])[!=?]?/i],["pun",/^[^\w\t\n\r "'-);\\\xa0]+/]]),["cl","el","lisp","lsp","scm","ss","rkt"]); 4 | -------------------------------------------------------------------------------- /public_html/vendor/prettify/lang-llvm.js: -------------------------------------------------------------------------------- 1 | PR.registerLangHandler(PR.createSimpleLexer([["pln",/^[\t\n\r \xa0]+/,null,"\t\n\r \u00a0"],["str",/^!?"(?:[^"\\]|\\[\S\s])*(?:"|$)/,null,'"'],["com",/^;[^\n\r]*/,null,";"]],[["pln",/^[!%@](?:[$\-.A-Z_a-z][\w$\-.]*|\d+)/],["kwd",/^[^\W\d]\w*/,null],["lit",/^\d+\.\d+/],["lit",/^(?:\d+|0[Xx][\dA-Fa-f]+)/],["pun",/^[(-*,:<->[\]{}]|\.\.\.$/]]),["llvm","ll"]); 2 | -------------------------------------------------------------------------------- /public_html/vendor/prettify/lang-lua.js: -------------------------------------------------------------------------------- 1 | PR.registerLangHandler(PR.createSimpleLexer([["pln",/^[\t\n\r \xa0]+/,null,"\t\n\r \u00a0"],["str",/^(?:"(?:[^"\\]|\\[\S\s])*(?:"|$)|'(?:[^'\\]|\\[\S\s])*(?:'|$))/,null,"\"'"]],[["com",/^--(?:\[(=*)\[[\S\s]*?(?:]\1]|$)|[^\n\r]*)/],["str",/^\[(=*)\[[\S\s]*?(?:]\1]|$)/],["kwd",/^(?:and|break|do|else|elseif|end|false|for|function|if|in|local|nil|not|or|repeat|return|then|true|until|while)\b/,null],["lit",/^[+-]?(?:0x[\da-f]+|(?:\.\d+|\d+(?:\.\d*)?)(?:e[+-]?\d+)?)/i], 2 | ["pln",/^[_a-z]\w*/i],["pun",/^[^\w\t\n\r \xa0][^\w\t\n\r "'+=\xa0-]*/]]),["lua"]); 3 | -------------------------------------------------------------------------------- /public_html/vendor/prettify/lang-ml.js: -------------------------------------------------------------------------------- 1 | PR.registerLangHandler(PR.createSimpleLexer([["pln",/^[\t\n\r \xa0]+/,null,"\t\n\r \u00a0"],["com",/^#(?:if[\t\n\r \xa0]+(?:[$_a-z][\w']*|``[^\t\n\r`]*(?:``|$))|else|endif|light)/i,null,"#"],["str",/^(?:"(?:[^"\\]|\\[\S\s])*(?:"|$)|'(?:[^'\\]|\\[\S\s])(?:'|$))/,null,"\"'"]],[["com",/^(?:\/\/[^\n\r]*|\(\*[\S\s]*?\*\))/],["kwd",/^(?:abstract|and|as|assert|begin|class|default|delegate|do|done|downcast|downto|elif|else|end|exception|extern|false|finally|for|fun|function|if|in|inherit|inline|interface|internal|lazy|let|match|member|module|mutable|namespace|new|null|of|open|or|override|private|public|rec|return|static|struct|then|to|true|try|type|upcast|use|val|void|when|while|with|yield|asr|land|lor|lsl|lsr|lxor|mod|sig|atomic|break|checked|component|const|constraint|constructor|continue|eager|event|external|fixed|functor|global|include|method|mixin|object|parallel|process|protected|pure|sealed|trait|virtual|volatile)\b/], 2 | ["lit",/^[+-]?(?:0x[\da-f]+|(?:\.\d+|\d+(?:\.\d*)?)(?:e[+-]?\d+)?)/i],["pln",/^(?:[_a-z][\w']*[!#?]?|``[^\t\n\r`]*(?:``|$))/i],["pun",/^[^\w\t\n\r "'\xa0]+/]]),["fs","ml"]); 3 | -------------------------------------------------------------------------------- /public_html/vendor/prettify/lang-mumps.js: -------------------------------------------------------------------------------- 1 | PR.registerLangHandler(PR.createSimpleLexer([["pln",/^[\t\n\r \xa0]+/,null,"\t\n\r \u00a0"],["str",/^"(?:[^"]|\\.)*"/,null,'"']],[["com",/^;[^\n\r]*/,null,";"],["dec",/^\$(?:d|device|ec|ecode|es|estack|et|etrap|h|horolog|i|io|j|job|k|key|p|principal|q|quit|st|stack|s|storage|sy|system|t|test|tl|tlevel|tr|trestart|x|y|z[a-z]*|a|ascii|c|char|d|data|e|extract|f|find|fn|fnumber|g|get|j|justify|l|length|na|name|o|order|p|piece|ql|qlength|qs|qsubscript|q|query|r|random|re|reverse|s|select|st|stack|t|text|tr|translate|nan)\b/i, 2 | null],["kwd",/^(?:[^$]b|break|c|close|d|do|e|else|f|for|g|goto|h|halt|h|hang|i|if|j|job|k|kill|l|lock|m|merge|n|new|o|open|q|quit|r|read|s|set|tc|tcommit|tre|trestart|tro|trollback|ts|tstart|u|use|v|view|w|write|x|xecute)\b/i,null],["lit",/^[+-]?(?:\.\d+|\d+(?:\.\d*)?)(?:e[+-]?\d+)?/i],["pln",/^[a-z][^\W_]*/i],["pun",/^[^\w\t\n\r"$%;^\xa0]|_/]]),["mumps"]); 3 | -------------------------------------------------------------------------------- /public_html/vendor/prettify/lang-n.js: -------------------------------------------------------------------------------- 1 | var a=null; 2 | PR.registerLangHandler(PR.createSimpleLexer([["str",/^(?:'(?:[^\n\r'\\]|\\.)*'|"(?:[^\n\r"\\]|\\.)*(?:"|$))/,a,'"'],["com",/^#(?:(?:define|elif|else|endif|error|ifdef|include|ifndef|line|pragma|undef|warning)\b|[^\n\r]*)/,a,"#"],["pln",/^\s+/,a," \r\n\t\u00a0"]],[["str",/^@"(?:[^"]|"")*(?:"|$)/,a],["str",/^<#[^#>]*(?:#>|$)/,a],["str",/^<(?:(?:(?:\.\.\/)*|\/?)(?:[\w-]+(?:\/[\w-]+)+)?[\w-]+\.h|[a-z]\w*)>/,a],["com",/^\/\/[^\n\r]*/,a],["com",/^\/\*[\S\s]*?(?:\*\/|$)/, 3 | a],["kwd",/^(?:abstract|and|as|base|catch|class|def|delegate|enum|event|extern|false|finally|fun|implements|interface|internal|is|macro|match|matches|module|mutable|namespace|new|null|out|override|params|partial|private|protected|public|ref|sealed|static|struct|syntax|this|throw|true|try|type|typeof|using|variant|virtual|volatile|when|where|with|assert|assert2|async|break|checked|continue|do|else|ensures|for|foreach|if|late|lock|new|nolate|otherwise|regexp|repeat|requires|return|surroundwith|unchecked|unless|using|while|yield)\b/, 4 | a],["typ",/^(?:array|bool|byte|char|decimal|double|float|int|list|long|object|sbyte|short|string|ulong|uint|ufloat|ulong|ushort|void)\b/,a],["lit",/^@[$_a-z][\w$@]*/i,a],["typ",/^@[A-Z]+[a-z][\w$@]*/,a],["pln",/^'?[$_a-z][\w$@]*/i,a],["lit",/^(?:0x[\da-f]+|(?:\d(?:_\d+)*\d*(?:\.\d*)?|\.\d\+)(?:e[+-]?\d+)?)[a-z]*/i,a,"0123456789"],["pun",/^.[^\s\w"-$'./@`]*/,a]]),["n","nemerle"]); 5 | -------------------------------------------------------------------------------- /public_html/vendor/prettify/lang-pascal.js: -------------------------------------------------------------------------------- 1 | var a=null; 2 | PR.registerLangHandler(PR.createSimpleLexer([["str",/^'(?:[^\n\r'\\]|\\.)*(?:'|$)/,a,"'"],["pln",/^\s+/,a," \r\n\t\u00a0"]],[["com",/^\(\*[\S\s]*?(?:\*\)|$)|^{[\S\s]*?(?:}|$)/,a],["kwd",/^(?:absolute|and|array|asm|assembler|begin|case|const|constructor|destructor|div|do|downto|else|end|external|for|forward|function|goto|if|implementation|in|inline|interface|interrupt|label|mod|not|object|of|or|packed|procedure|program|record|repeat|set|shl|shr|then|to|type|unit|until|uses|var|virtual|while|with|xor)\b/i,a], 3 | ["lit",/^(?:true|false|self|nil)/i,a],["pln",/^[a-z][^\W_]*/i,a],["lit",/^(?:\$[\da-f]+|(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?)/i,a,"0123456789"],["pun",/^.[^\s\w$'./@]*/,a]]),["pascal"]); 4 | -------------------------------------------------------------------------------- /public_html/vendor/prettify/lang-proto.js: -------------------------------------------------------------------------------- 1 | PR.registerLangHandler(PR.sourceDecorator({keywords:"bytes,default,double,enum,extend,extensions,false,group,import,max,message,option,optional,package,repeated,required,returns,rpc,service,syntax,to,true",types:/^(bool|(double|s?fixed|[su]?int)(32|64)|float|string)\b/,cStyleComments:!0}),["proto"]); 2 | -------------------------------------------------------------------------------- /public_html/vendor/prettify/lang-r.js: -------------------------------------------------------------------------------- 1 | PR.registerLangHandler(PR.createSimpleLexer([["pln",/^[\t\n\r \xa0]+/,null,"\t\n\r \u00a0"],["str",/^"(?:[^"\\]|\\[\S\s])*(?:"|$)/,null,'"'],["str",/^'(?:[^'\\]|\\[\S\s])*(?:'|$)/,null,"'"]],[["com",/^#.*/],["kwd",/^(?:if|else|for|while|repeat|in|next|break|return|switch|function)(?![\w.])/],["lit",/^0[Xx][\dA-Fa-f]+([Pp]\d+)?[Li]?/],["lit",/^[+-]?(\d+(\.\d+)?|\.\d+)([Ee][+-]?\d+)?[Li]?/],["lit",/^(?:NULL|NA(?:_(?:integer|real|complex|character)_)?|Inf|TRUE|FALSE|NaN|\.\.(?:\.|\d+))(?![\w.])/], 2 | ["pun",/^(?:<>?|-|==|<=|>=|<|>|&&?|!=|\|\|?|[!*+/^]|%.*?%|[$=@~]|:{1,3}|[(),;?[\]{}])/],["pln",/^(?:[A-Za-z]+[\w.]*|\.[^\W\d][\w.]*)(?![\w.])/],["str",/^`.+`/]]),["r","s","R","S","Splus"]); 3 | -------------------------------------------------------------------------------- /public_html/vendor/prettify/lang-rd.js: -------------------------------------------------------------------------------- 1 | PR.registerLangHandler(PR.createSimpleLexer([["pln",/^[\t\n\r \xa0]+/,null,"\t\n\r \u00a0"],["com",/^%[^\n\r]*/,null,"%"]],[["lit",/^\\(?:cr|l?dots|R|tab)\b/],["kwd",/^\\[@-Za-z]+/],["kwd",/^#(?:ifn?def|endif)/],["pln",/^\\[{}]/],["pun",/^[()[\]{}]+/]]),["Rd","rd"]); 2 | -------------------------------------------------------------------------------- /public_html/vendor/prettify/lang-scala.js: -------------------------------------------------------------------------------- 1 | PR.registerLangHandler(PR.createSimpleLexer([["pln",/^[\t\n\r \xa0]+/,null,"\t\n\r \u00a0"],["str",/^"(?:""(?:""?(?!")|[^"\\]|\\.)*"{0,3}|(?:[^\n\r"\\]|\\.)*"?)/,null,'"'],["lit",/^`(?:[^\n\r\\`]|\\.)*`?/,null,"`"],["pun",/^[!#%&(--:-@[-^{-~]+/,null,"!#%&()*+,-:;<=>?@[\\]^{|}~"]],[["str",/^'(?:[^\n\r'\\]|\\(?:'|[^\n\r']+))'/],["lit",/^'[$A-Z_a-z][\w$]*(?![\w$'])/],["kwd",/^(?:abstract|case|catch|class|def|do|else|extends|final|finally|for|forSome|if|implicit|import|lazy|match|new|object|override|package|private|protected|requires|return|sealed|super|throw|trait|try|type|val|var|while|with|yield)\b/], 2 | ["lit",/^(?:true|false|null|this)\b/],["lit",/^(?:0(?:[0-7]+|x[\da-f]+)l?|(?:0|[1-9]\d*)(?:(?:\.\d+)?(?:e[+-]?\d+)?f?|l?)|\\.\d+(?:e[+-]?\d+)?f?)/i],["typ",/^[$_]*[A-Z][\d$A-Z_]*[a-z][\w$]*/],["pln",/^[$A-Z_a-z][\w$]*/],["com",/^\/(?:\/.*|\*(?:\/|\**[^*/])*(?:\*+\/?)?)/],["pun",/^(?:\.+|\/)/]]),["scala"]); 3 | -------------------------------------------------------------------------------- /public_html/vendor/prettify/lang-sql.js: -------------------------------------------------------------------------------- 1 | PR.registerLangHandler(PR.createSimpleLexer([["pln",/^[\t\n\r \xa0]+/,null,"\t\n\r \u00a0"],["str",/^(?:"(?:[^"\\]|\\.)*"|'(?:[^'\\]|\\.)*')/,null,"\"'"]],[["com",/^(?:--[^\n\r]*|\/\*[\S\s]*?(?:\*\/|$))/],["kwd",/^(?:add|all|alter|and|any|apply|as|asc|authorization|backup|begin|between|break|browse|bulk|by|cascade|case|check|checkpoint|close|clustered|coalesce|collate|column|commit|compute|connect|constraint|contains|containstable|continue|convert|create|cross|current|current_date|current_time|current_timestamp|current_user|cursor|database|dbcc|deallocate|declare|default|delete|deny|desc|disk|distinct|distributed|double|drop|dummy|dump|else|end|errlvl|escape|except|exec|execute|exists|exit|fetch|file|fillfactor|following|for|foreign|freetext|freetexttable|from|full|function|goto|grant|group|having|holdlock|identity|identitycol|identity_insert|if|in|index|inner|insert|intersect|into|is|join|key|kill|left|like|lineno|load|match|matched|merge|natural|national|nocheck|nonclustered|nocycle|not|null|nullif|of|off|offsets|on|open|opendatasource|openquery|openrowset|openxml|option|or|order|outer|over|partition|percent|pivot|plan|preceding|precision|primary|print|proc|procedure|public|raiserror|read|readtext|reconfigure|references|replication|restore|restrict|return|revoke|right|rollback|rowcount|rowguidcol|rows?|rule|save|schema|select|session_user|set|setuser|shutdown|some|start|statistics|system_user|table|textsize|then|to|top|tran|transaction|trigger|truncate|tsequal|unbounded|union|unique|unpivot|update|updatetext|use|user|using|values|varying|view|waitfor|when|where|while|with|within|writetext|xml)(?=[^\w-]|$)/i, 2 | null],["lit",/^[+-]?(?:0x[\da-f]+|(?:\.\d+|\d+(?:\.\d*)?)(?:e[+-]?\d+)?)/i],["pln",/^[_a-z][\w-]*/i],["pun",/^[^\w\t\n\r "'\xa0][^\w\t\n\r "'+\xa0-]*/]]),["sql"]); 3 | -------------------------------------------------------------------------------- /public_html/vendor/prettify/lang-tcl.js: -------------------------------------------------------------------------------- 1 | var a=null; 2 | PR.registerLangHandler(PR.createSimpleLexer([["opn",/^{+/,a,"{"],["clo",/^}+/,a,"}"],["com",/^#[^\n\r]*/,a,"#"],["pln",/^[\t\n\r \xa0]+/,a,"\t\n\r \u00a0"],["str",/^"(?:[^"\\]|\\[\S\s])*(?:"|$)/,a,'"']],[["kwd",/^(?:after|append|apply|array|break|case|catch|continue|error|eval|exec|exit|expr|for|foreach|if|incr|info|proc|return|set|switch|trace|uplevel|upvar|while)\b/,a],["lit",/^[+-]?(?:[#0]x[\da-f]+|\d+\/\d+|(?:\.\d+|\d+(?:\.\d*)?)(?:[de][+-]?\d+)?)/i],["lit", 3 | /^'(?:-*(?:\w|\\[!-~])(?:[\w-]*|\\[!-~])[!=?]?)?/],["pln",/^-*(?:[_a-z]|\\[!-~])(?:[\w-]*|\\[!-~])[!=?]?/i],["pun",/^[^\w\t\n\r "'-);\\\xa0]+/]]),["tcl"]); 4 | -------------------------------------------------------------------------------- /public_html/vendor/prettify/lang-tex.js: -------------------------------------------------------------------------------- 1 | PR.registerLangHandler(PR.createSimpleLexer([["pln",/^[\t\n\r \xa0]+/,null,"\t\n\r \u00a0"],["com",/^%[^\n\r]*/,null,"%"]],[["kwd",/^\\[@-Za-z]+/],["kwd",/^\\./],["typ",/^[$&]/],["lit",/[+-]?(?:\.\d+|\d+(?:\.\d*)?)(cm|em|ex|in|pc|pt|bp|mm)/i],["pun",/^[()=[\]{}]+/]]),["latex","tex"]); 2 | -------------------------------------------------------------------------------- /public_html/vendor/prettify/lang-vb.js: -------------------------------------------------------------------------------- 1 | PR.registerLangHandler(PR.createSimpleLexer([["pln",/^[\t\n\r \xa0\u2028\u2029]+/,null,"\t\n\r \u00a0\u2028\u2029"],["str",/^(?:["\u201c\u201d](?:[^"\u201c\u201d]|["\u201c\u201d]{2})(?:["\u201c\u201d]c|$)|["\u201c\u201d](?:[^"\u201c\u201d]|["\u201c\u201d]{2})*(?:["\u201c\u201d]|$))/i,null,'"\u201c\u201d'],["com",/^['\u2018\u2019](?:_(?:\r\n?|[^\r]?)|[^\n\r_\u2028\u2029])*/,null,"'\u2018\u2019"]],[["kwd",/^(?:addhandler|addressof|alias|and|andalso|ansi|as|assembly|auto|boolean|byref|byte|byval|call|case|catch|cbool|cbyte|cchar|cdate|cdbl|cdec|char|cint|class|clng|cobj|const|cshort|csng|cstr|ctype|date|decimal|declare|default|delegate|dim|directcast|do|double|each|else|elseif|end|endif|enum|erase|error|event|exit|finally|for|friend|function|get|gettype|gosub|goto|handles|if|implements|imports|in|inherits|integer|interface|is|let|lib|like|long|loop|me|mod|module|mustinherit|mustoverride|mybase|myclass|namespace|new|next|not|notinheritable|notoverridable|object|on|option|optional|or|orelse|overloads|overridable|overrides|paramarray|preserve|private|property|protected|public|raiseevent|readonly|redim|removehandler|resume|return|select|set|shadows|shared|short|single|static|step|stop|string|structure|sub|synclock|then|throw|to|try|typeof|unicode|until|variant|wend|when|while|with|withevents|writeonly|xor|endif|gosub|let|variant|wend)\b/i, 2 | null],["com",/^rem\b.*/i],["lit",/^(?:true\b|false\b|nothing\b|\d+(?:e[+-]?\d+[dfr]?|[dfilrs])?|(?:&h[\da-f]+|&o[0-7]+)[ils]?|\d*\.\d+(?:e[+-]?\d+)?[dfr]?|#\s+(?:\d+[/-]\d+[/-]\d+(?:\s+\d+:\d+(?::\d+)?(\s*(?:am|pm))?)?|\d+:\d+(?::\d+)?(\s*(?:am|pm))?)\s+#)/i],["pln",/^(?:(?:[a-z]|_\w)\w*(?:\[[!#%&@]+])?|\[(?:[a-z]|_\w)\w*])/i],["pun",/^[^\w\t\n\r "'[\]\xa0\u2018\u2019\u201c\u201d\u2028\u2029]+/],["pun",/^(?:\[|])/]]),["vb","vbs"]); 3 | -------------------------------------------------------------------------------- /public_html/vendor/prettify/lang-vhdl.js: -------------------------------------------------------------------------------- 1 | PR.registerLangHandler(PR.createSimpleLexer([["pln",/^[\t\n\r \xa0]+/,null,"\t\n\r \u00a0"]],[["str",/^(?:[box]?"(?:[^"]|"")*"|'.')/i],["com",/^--[^\n\r]*/],["kwd",/^(?:abs|access|after|alias|all|and|architecture|array|assert|attribute|begin|block|body|buffer|bus|case|component|configuration|constant|disconnect|downto|else|elsif|end|entity|exit|file|for|function|generate|generic|group|guarded|if|impure|in|inertial|inout|is|label|library|linkage|literal|loop|map|mod|nand|new|next|nor|not|null|of|on|open|or|others|out|package|port|postponed|procedure|process|pure|range|record|register|reject|rem|report|return|rol|ror|select|severity|shared|signal|sla|sll|sra|srl|subtype|then|to|transport|type|unaffected|units|until|use|variable|wait|when|while|with|xnor|xor)(?=[^\w-]|$)/i, 2 | null],["typ",/^(?:bit|bit_vector|character|boolean|integer|real|time|string|severity_level|positive|natural|signed|unsigned|line|text|std_u?logic(?:_vector)?)(?=[^\w-]|$)/i,null],["typ",/^'(?:active|ascending|base|delayed|driving|driving_value|event|high|image|instance_name|last_active|last_event|last_value|left|leftof|length|low|path_name|pos|pred|quiet|range|reverse_range|right|rightof|simple_name|stable|succ|transaction|val|value)(?=[^\w-]|$)/i,null],["lit",/^\d+(?:_\d+)*(?:#[\w.\\]+#(?:[+-]?\d+(?:_\d+)*)?|(?:\.\d+(?:_\d+)*)?(?:e[+-]?\d+(?:_\d+)*)?)/i], 3 | ["pln",/^(?:[a-z]\w*|\\[^\\]*\\)/i],["pun",/^[^\w\t\n\r "'\xa0][^\w\t\n\r "'\xa0-]*/]]),["vhdl","vhd"]); 4 | -------------------------------------------------------------------------------- /public_html/vendor/prettify/lang-wiki.js: -------------------------------------------------------------------------------- 1 | PR.registerLangHandler(PR.createSimpleLexer([["pln",/^[\d\t a-gi-z\xa0]+/,null,"\t \u00a0abcdefgijklmnopqrstuvwxyz0123456789"],["pun",/^[*=[\]^~]+/,null,"=*~^[]"]],[["lang-wiki.meta",/(?:^^|\r\n?|\n)(#[a-z]+)\b/],["lit",/^[A-Z][a-z][\da-z]+[A-Z][a-z][^\W_]+\b/],["lang-",/^{{{([\S\s]+?)}}}/],["lang-",/^`([^\n\r`]+)`/],["str",/^https?:\/\/[^\s#/?]*(?:\/[^\s#?]*)?(?:\?[^\s#]*)?(?:#\S*)?/i],["pln",/^(?:\r\n|[\S\s])[^\n\r#*=A-[^`h{~]*/]]),["wiki"]); 2 | PR.registerLangHandler(PR.createSimpleLexer([["kwd",/^#[a-z]+/i,null,"#"]],[]),["wiki.meta"]); 3 | -------------------------------------------------------------------------------- /public_html/vendor/prettify/lang-yaml.js: -------------------------------------------------------------------------------- 1 | var a=null; 2 | PR.registerLangHandler(PR.createSimpleLexer([["pun",/^[:>?|]+/,a,":|>?"],["dec",/^%(?:YAML|TAG)[^\n\r#]+/,a,"%"],["typ",/^&\S+/,a,"&"],["typ",/^!\S*/,a,"!"],["str",/^"(?:[^"\\]|\\.)*(?:"|$)/,a,'"'],["str",/^'(?:[^']|'')*(?:'|$)/,a,"'"],["com",/^#[^\n\r]*/,a,"#"],["pln",/^\s+/,a," \t\r\n"]],[["dec",/^(?:---|\.\.\.)(?:[\n\r]|$)/],["pun",/^-/],["kwd",/^\w+:[\n\r ]/],["pln",/^\w+/]]),["yaml","yml"]); 3 | -------------------------------------------------------------------------------- /public_html/vendor/prettify/prettify.css: -------------------------------------------------------------------------------- 1 | .pln{color:#000}@media screen{.str{color:#080}.kwd{color:#008}.com{color:#800}.typ{color:#606}.lit{color:#066}.pun,.opn,.clo{color:#660}.tag{color:#008}.atn{color:#606}.atv{color:#080}.dec,.var{color:#606}.fun{color:red}}@media print,projection{.str{color:#060}.kwd{color:#006;font-weight:bold}.com{color:#600;font-style:italic}.typ{color:#404;font-weight:bold}.lit{color:#044}.pun,.opn,.clo{color:#440}.tag{color:#006;font-weight:bold}.atn{color:#404}.atv{color:#060}}pre.prettyprint{padding:2px;border:1px solid #888}ol.linenums{margin-top:0;margin-bottom:0}li.L0,li.L1,li.L2,li.L3,li.L5,li.L6,li.L7,li.L8{}li.L1,li.L3,li.L5,li.L7,li.L9{background:#eee} -------------------------------------------------------------------------------- /public_html/vendor/typeahead/typeahead.css: -------------------------------------------------------------------------------- 1 | span.twitter-typeahead .tt-dropdown-menu { 2 | position: absolute; 3 | top: 100%; 4 | left: 0; 5 | z-index: 1000; 6 | display: none; 7 | float: left; 8 | min-width: 160px; 9 | padding: 5px 0; 10 | margin: 2px 0 0; 11 | list-style: none; 12 | font-size: 14px; 13 | text-align: left; 14 | background-color: #ffffff; 15 | border: 1px solid #cccccc; 16 | border: 1px solid rgba(0, 0, 0, 0.15); 17 | border-radius: 4px; 18 | -webkit-box-shadow: 0 6px 12px rgba(0, 0, 0, 0.175); 19 | box-shadow: 0 6px 12px rgba(0, 0, 0, 0.175); 20 | background-clip: padding-box; 21 | } 22 | span.twitter-typeahead .tt-suggestion > p { 23 | display: block; 24 | padding: 3px 20px; 25 | clear: both; 26 | font-weight: normal; 27 | line-height: 1.42857143; 28 | color: #333333; 29 | white-space: nowrap; 30 | } 31 | span.twitter-typeahead .tt-suggestion > p:hover, 32 | span.twitter-typeahead .tt-suggestion > p:focus { 33 | color: #ffffff; 34 | text-decoration: none; 35 | outline: 0; 36 | background-color: #428bca; 37 | } 38 | span.twitter-typeahead .tt-suggestion.tt-cursor { 39 | color: #ffffff; 40 | background-color: #428bca; 41 | } 42 | span.twitter-typeahead { 43 | width: 100%; 44 | } 45 | .input-group span.twitter-typeahead { 46 | display: block !important; 47 | } 48 | .input-group span.twitter-typeahead .tt-dropdown-menu { 49 | top: 32px !important; 50 | } 51 | .input-group.input-group-lg span.twitter-typeahead .tt-dropdown-menu { 52 | top: 44px !important; 53 | } 54 | .input-group.input-group-sm span.twitter-typeahead .tt-dropdown-menu { 55 | top: 28px !important; 56 | } 57 | -------------------------------------------------------------------------------- /scripts/breadcrumbs.php: -------------------------------------------------------------------------------- 1 | article_exists($article)){ 28 | $content = $db->get_article($article); 29 | 30 | preg_match_all('/\[\[([A-Za-z\_\s\'\-]+?)\]\]/',$content,$matches); 31 | 32 | foreach($matches[1] as $link){ 33 | 34 | $new_link = str_replace(" ","_",$link); 35 | 36 | if(!array_key_exists($new_link,$map)){ 37 | 38 | $queue[$end] = $queue[$head].'/'.$link; 39 | $map[$new_link] = $queue[$end]; 40 | $end++; 41 | } 42 | } 43 | 44 | preg_match_all('/\[\[([A-Za-z\_\s\']+?)\|([A-Za-z\_\s\']+?)\]\]/',$content,$matches); 45 | 46 | foreach($matches[2] as $link){ 47 | 48 | $new_link = str_replace(" ","_",$link); 49 | 50 | if(!array_key_exists($new_link,$map)){ 51 | 52 | $queue[$end] = $queue[$head].'/'.$link; 53 | $map[$new_link] = $queue[$end]; 54 | $end++; 55 | } 56 | } 57 | } 58 | $head++; 59 | } 60 | print_r($map); 61 | file_put_contents('../data/breadcrumbs.txt',json_encode($map)); 62 | return $map; 63 | } 64 | 65 | bfsLinks(); 66 | ?> -------------------------------------------------------------------------------- /scripts/checkCode.php: -------------------------------------------------------------------------------- 1 | $path){ 18 | 19 | if(!$db->article_exists($page)){ 20 | continue; 21 | } 22 | 23 | $contents = $db->get_article($page); 24 | $contents = parse($contents); 25 | 26 | $matches = []; 27 | 28 | $str = preg_match( 29 | '/(.*?)<\/pre>/s', 30 | $contents, 31 | $matches 32 | ); 33 | 34 | if($matches){ 35 | preg_match('/\)\{/',$matches[0],$brackets); 36 | if($brackets){ 37 | print($page."\n"); 38 | } 39 | preg_match('/\t/', $matches[0], $tabs); 40 | if($tabs){ 41 | print($page."\n"); 42 | } 43 | } 44 | 45 | } 46 | 47 | 48 | -------------------------------------------------------------------------------- /scripts/createDB.php: -------------------------------------------------------------------------------- 1 | connect_errno) { 15 | echo "Failed to connect to MySQL: (" . $mysqli->connect_errno . ") " . $mysqli->connect_error; 16 | } 17 | 18 | if(!$mysqli->select_db($db)){ 19 | $mysqli->query("Create database if not exists algorithms"); 20 | echo "DB does not exists, creating...\n"; 21 | }else { 22 | echo "DB exists\n"; 23 | } 24 | $mysqli->select_db($db); 25 | 26 | $res = $mysqli->query("SHOW TABLES like db"); 27 | 28 | $mysqli->query("CREATE TABLE articles ( 29 | id varchar(100) NOT NULL PRIMARY KEY, 30 | content varchar(65000) NOT NULL 31 | )"); 32 | 33 | -------------------------------------------------------------------------------- /scripts/enumExer.php: -------------------------------------------------------------------------------- 1 | $path){ 18 | 19 | if(!$db->article_exists($page)){ 20 | continue; 21 | } 22 | 23 | $contents = $db->get_article($page); 24 | $contents = parse($contents); 25 | 26 | $res = preg_match('/

Exercises<\/h2>(.*)<\/section>/is',$contents,$matches); 27 | 28 | if($res){ 29 | $output = $output.$matches[1]; 30 | } 31 | 32 | } 33 | 34 | print($output); 35 | 36 | -------------------------------------------------------------------------------- /scripts/migrateData.php: -------------------------------------------------------------------------------- 1 | isDot() && $fileinfo->getExtension()=='txt'){ 25 | $title = $fileinfo->getBasename('.txt'); 26 | $content = file_get_contents($data_dir.$fileinfo->getBasename()); 27 | $content = $content; 28 | echo $fileinfo->getBasename('.txt')."\n"; 29 | 30 | $db->save_article($title,$content); 31 | } 32 | } 33 | 34 | 35 | ?> -------------------------------------------------------------------------------- /scripts/resizeImg.php: -------------------------------------------------------------------------------- 1 | isDot())continue; 13 | 14 | $name = $fileinfo->getFilename(); 15 | 16 | $src = $data_dir.$name; 17 | $output = $output_dir.$name; 18 | 19 | if($fileinfo->getExtension()=='png'){ 20 | echo "Converting: ".$name."\n"; 21 | $command = sprintf("convert %s -filter Catrom -density 3000000 %s", $src, $output); 22 | shell_exec($command); 23 | } else{ 24 | echo "Copying: ".$name."\n"; 25 | $command = sprintf("cp %s %s", $src, $output); 26 | shell_exec($command); 27 | } 28 | } 29 | -------------------------------------------------------------------------------- /scripts/saveData.php: -------------------------------------------------------------------------------- 1 | dump_db('../data/'); 9 | 10 | 11 | 12 | 13 | 14 | ?> -------------------------------------------------------------------------------- /templates/edit.html.php: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 |
8 | 9 | 15 | 16 |
17 | 18 |
19 | 20 | 21 |
22 | 23 | 24 | 25 |
26 |
27 | -------------------------------------------------------------------------------- /templates/indexHeader.php: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | The Computer Science Handbook - Reference for Data Structures and Algorithms 6 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 | 30 | 31 | 32 | 33 | 34 | -------------------------------------------------------------------------------- /templates/listHeader.php: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | <?php echo $title ?> - The Computer Science Handbook 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 | -------------------------------------------------------------------------------- /templates/nav.php: -------------------------------------------------------------------------------- 1 |
2 | 34 |
--------------------------------------------------------------------------------