User contributions for Savoundg

3 June 2018

• 22:0422:04, 3 June 2018 diff hist +96 Depth-First Search No edit summary Tag: Visual edit
• 21:5921:59, 3 June 2018 diff hist +87 Quicksort No edit summary Tag: Visual edit
• 19:0319:03, 3 June 2018 diff hist +281 N Splay Tree Created page with "Red-Black Tree is a self-optimizing Binary Search Tree where frequently-accessed nodes move to the root. This data structure is useful for implementing caches and garbage col..." current Tag: Visual edit
• 18:5518:55, 3 June 2018 diff hist +1,096 N AVL Tree Created page with "An AVL Tree is self-balancing height-balanced Binary Search Tree. AVL stands for the inventors of this tree: '''A'''delson-'''V'''elskii and '''L'''andis. Search, insertion a..." current Tag: Visual edit
• 18:5418:54, 3 June 2018 diff hist +22 Red-Black Tree No edit summary current Tag: Visual edit
• 18:4218:42, 3 June 2018 diff hist +1,131 N Red-Black Tree Created page with "Red-Black Tree is a self-balancing Binary Search Tree. Red-Black Tree approximately balances itself on insert and deletion operations to guarantee O(log n) search. Insertion..." Tag: Visual edit
• 18:2118:21, 3 June 2018 diff hist +70 Main Page No edit summary Tag: Visual edit
• 17:4817:48, 3 June 2018 diff hist +32 Main Page No edit summary Tag: Visual edit
• 07:3607:36, 3 June 2018 diff hist +523 N Hash Table Created page with "An hash table is a key-value data structure. From the key, we derive a hash code and from a hash code an index that points to the value. When two value has the same hash cod..." Tag: Visual edit
• 07:2907:29, 3 June 2018 diff hist +4 Main Page No edit summary Tag: Visual edit
• 07:2707:27, 3 June 2018 diff hist +471 N Heap sort Created page with "Heap sort algorithm builds the max. heap using the elements to be sorted. In max. heap, any sub-tree root node is bigger than its children node. The algorithm swaps the root..." current Tag: Visual edit
• 07:2107:21, 3 June 2018 diff hist +91 Insertion sort No edit summary Tag: Visual edit
• 07:2007:20, 3 June 2018 diff hist +11 Insertion sort No edit summary
• 07:2007:20, 3 June 2018 diff hist +695 Insertion sort No edit summary Tag: Visual edit
• 07:1307:13, 3 June 2018 diff hist +79 N Insertion sort Created page with "Insertion sort is a in-place sorting algorithm that goes one element at a time." Tag: Visual edit
• 07:1207:12, 3 June 2018 diff hist +193 Tries No edit summary Tag: Visual edit
• 07:0407:04, 3 June 2018 diff hist +159 N Tries Created page with "Tries is used to store words in a tree. From the root to the leaves, it forms a word. Each node should contain a flag that indicates if it is a complete word." Tag: Visual edit
• 07:0207:02, 3 June 2018 diff hist +4 Main Page No edit summary Tag: Visual edit
• 07:0107:01, 3 June 2018 diff hist +77 Heap No edit summary Tag: Visual edit
• 07:0007:00, 3 June 2018 diff hist +4 Main Page No edit summary Tag: Visual edit
• 06:5706:57, 3 June 2018 diff hist −2 Heap No edit summary Tag: Visual edit
• 06:5406:54, 3 June 2018 diff hist +225 Sorting algorithms No edit summary Tag: Visual edit
• 06:5006:50, 3 June 2018 diff hist +29 Binary Search Tree No edit summary Tag: Visual edit
• 06:4906:49, 3 June 2018 diff hist +719 N Heap Created page with "A Heap is a binary tree. It has two forms: min. Heap and max. Heap. In a min. Heap, the root of any sub-tree is smaller than its children. The deeper we go into the children,..." Tag: Visual edit
• 06:2606:26, 3 June 2018 diff hist +4 Main Page No edit summary Tag: Visual edit
• 06:2506:25, 3 June 2018 diff hist +1 Tree No edit summary Tag: Visual edit
• 06:2506:25, 3 June 2018 diff hist −1 Tree No edit summary Tag: Visual edit
• 06:2406:24, 3 June 2018 diff hist 0 Graph No edit summary Tag: Visual edit
• 06:2406:24, 3 June 2018 diff hist +17 Graph No edit summary Tag: Visual edit
• 06:2406:24, 3 June 2018 diff hist +91 Tree No edit summary Tag: Visual edit
• 06:2306:23, 3 June 2018 diff hist +755 N Binary Search Tree Created page with "A Binary Search Tree is a binary tree with a specific ordering property: for any sub-tree, the left nodes is less that the root node and the right nodes is bigger to the root..." Tag: Visual edit
• 06:1406:14, 3 June 2018 diff hist +2 Tree No edit summary Tag: Visual edit
• 06:1306:13, 3 June 2018 diff hist +50 Tree No edit summary Tag: Visual edit
• 06:1206:12, 3 June 2018 diff hist +126 Breadth-First Search No edit summary Tag: Visual edit
• 06:1206:12, 3 June 2018 diff hist +78 N Tree Created page with "A Tree has (only one) root node and has child nodes. A leaf node has no child."
• 06:1106:11, 3 June 2018 diff hist +8 Main Page No edit summary Tag: Visual edit
• 05:4905:49, 3 June 2018 diff hist +278 Depth-First Search No edit summary Tag: Visual edit
• 05:3905:39, 3 June 2018 diff hist +194 N Breadth-First Search Created page with "The Breadth-First Search is an algorithm that finds if there is a path from one node to another. Unlike Depth-First Search, it looks for the neighbours node first before goin..." Tag: Visual edit
• 05:3905:39, 3 June 2018 diff hist +190 N Depth-First Search Created page with "The Depth-First Search is a recursive algorithm that finds if there is a path from one node to another. This algorithm searches for the node's children first before going to..." Tag: Visual edit
• 05:3305:33, 3 June 2018 diff hist +276 N Graph Created page with "A graph is a collection of nodes. Each node might point to another node. The edge can be directed or undirected. Typical questions we can ask about a graph: * Is there a pat..." Tag: Visual edit
• 05:3105:31, 3 June 2018 diff hist +3 Main Page No edit summary Tag: Visual edit
• 05:3005:30, 3 June 2018 diff hist +8 Main Page No edit summary Tag: Visual edit

1 June 2018

• 06:0706:07, 1 June 2018 diff hist +45 Quicksort No edit summary Tag: Visual edit
• 04:5604:56, 1 June 2018 diff hist +1,126 Quicksort No edit summary Tag: Visual edit
• 04:0904:09, 1 June 2018 diff hist +89 Quicksort No edit summary Tag: Visual edit

31 May 2018

• 17:4817:48, 31 May 2018 diff hist +453 N Systemd Created page with "Systemd always boot to reach the default.target defined at <code>/etc/systemd/system/default.target</code> default.target is a symbolic link to target unit. {| class="wikitab..." current Tag: Visual edit
• 17:2117:21, 31 May 2018 diff hist +13 Main Page No edit summary Tag: Visual edit

30 May 2018

• 17:0917:09, 30 May 2018 diff hist +283 Linux No edit summary current Tag: Visual edit
• 06:5206:52, 30 May 2018 diff hist +275 Merge sort No edit summary Tag: Visual edit

29 May 2018

• 00:0300:03, 29 May 2018 diff hist +92 Gpg No edit summary current Tag: Visual edit