heap-typed

<!DOCTYPE html><html class="default" lang="en"><head><meta charSet="utf-8"/><meta http-equiv="x-ua-compatible" content="IE=edge"/><title>heap-typed</title><meta name="description" content="Documentation for heap-typed"/><meta name="viewport" content="width=device-width, initial-scale=1"/><link rel="stylesheet" href="assets/style.css"/><link rel="stylesheet" href="assets/highlight.css"/><script defer src="assets/main.js"></script><script async src="assets/search.js" id="tsd-search-script"></script><script async src="assets/navigation.js" id="tsd-nav-script"></script></head><body><script>document.documentElement.dataset.theme = localStorage.getItem("tsd-theme") || "os"</script><header class="tsd-page-toolbar"> <div class="tsd-toolbar-contents container"> <div class="table-cell" id="tsd-search" data-base="."> <div class="field"><label for="tsd-search-field" class="tsd-widget tsd-toolbar-icon search no-caption"><svg width="16" height="16" viewBox="0 0 16 16" fill="none"><use href="#icon-search"></use></svg></label><input type="text" id="tsd-search-field" aria-label="Search"/></div> <div class="field"> <div id="tsd-toolbar-links"></div></div> <ul class="results"> <li class="state loading">Preparing search index...</li> <li class="state failure">The search index is not available</li></ul><a href="index.html" class="title">heap-typed</a></div> <div class="table-cell" id="tsd-widgets"><a href="#" class="tsd-widget tsd-toolbar-icon menu no-caption" data-toggle="menu" aria-label="Menu"><svg width="16" height="16" viewBox="0 0 16 16" fill="none"><use href="#icon-menu"></use></svg></a></div></div></header> <div class="container container-main"> <div class="col-content"> <div class="tsd-page-title"> <h2>heap-typed</h2></div> <div class="tsd-panel tsd-typography"><a id="md:what" class="tsd-anchor"></a><h1><a href="#md:what">What</a></h1><a id="md:brief" class="tsd-anchor"></a><h2><a href="#md:brief">Brief</a></h2>This is a standalone Heap data structure from the data-structure-typed collection. If you wish to access more data structures or advanced features, you can transition to directly installing the complete <a href="https://www.npmjs.com/package/data-structure-typed">data-structure-typed</a> package <a id="md:how" class="tsd-anchor"></a><h1><a href="#md:how">How</a></h1><a id="md:install" class="tsd-anchor"></a><h2><a href="#md:install">install</a></h2><a id="md:npm" class="tsd-anchor"></a><h3><a href="#md:npm">npm</a></h3><pre><code class="language-bash">npm i heap-typed --save </code><button>Copy</button></pre> <a id="md:yarn" class="tsd-anchor"></a><h3><a href="#md:yarn">yarn</a></h3><pre><code class="language-bash">yarn add heap-typed </code><button>Copy</button></pre> <a id="md:methods" class="tsd-anchor"></a><h3><a href="#md:methods">methods</a></h3>Min Heap <img src="https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/methods-8bit/min-heap.png?raw=true" alt=""> Max Heap <img src="https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/methods-8bit/max-heap.png?raw=true" alt=""> <a id="md:snippet" class="tsd-anchor"></a><h3><a href="#md:snippet">snippet</a></h3><a id="md:ts" class="tsd-anchor"></a><h4><a href="#md:ts">TS</a></h4><pre><code class="language-typescript"> import {MinHeap, MaxHeap} from 'data-structure-typed'; // /* or if you prefer */ import {MinHeap, MaxHeap} from 'heap-typed'; const minNumHeap = new MinHeap<number>(); minNumHeap.add(1).add(6).add(2).add(0).add(5).add(9); minNumHeap.has(1) // true minNumHeap.has(2) // true minNumHeap.poll() // 0 minNumHeap.poll() // 1 minNumHeap.peek() // 2 minNumHeap.has(1); // false minNumHeap.has(2); // true const arrFromHeap = minNumHeap.toArray(); arrFromHeap.length // 4 arrFromHeap[0] // 2 arrFromHeap[1] // 5 arrFromHeap[2] // 9 arrFromHeap[3] // 6 minNumHeap.sort() // [2, 5, 6, 9] const maxHeap = new MaxHeap<{ keyA: string }>(); const myObj1 = {keyA: 'a1'}, myObj6 = {keyA: 'a6'}, myObj5 = {keyA: 'a5'}, myObj2 = {keyA: 'a2'}, myObj0 = {keyA: 'a0'}, myObj9 = {keyA: 'a9'}; maxHeap.add(1, myObj1); maxHeap.has(myObj1) // true maxHeap.has(myObj9) // false maxHeap.add(6, myObj6); maxHeap.has(myObj6) // true maxHeap.add(5, myObj5); maxHeap.has(myObj5) // true maxHeap.add(2, myObj2); maxHeap.has(myObj2) // true maxHeap.has(myObj6) // true maxHeap.add(0, myObj0); maxHeap.has(myObj0) // true maxHeap.has(myObj9) // false maxHeap.add(9, myObj9); maxHeap.has(myObj9) // true const peek9 = maxHeap.peek(true); peek9 && peek9.val && peek9.val.keyA // 'a9' const heapToArr = maxHeap.toArray(true); heapToArr.map(item => item?.val?.keyA) // ['a9', 'a2', 'a6', 'a1', 'a0', 'a5'] const values = ['a9', 'a6', 'a5', 'a2', 'a1', 'a0']; let i = 0; while (maxHeap.size > 0) { const polled = maxHeap.poll(true); polled && polled.val && polled.val.keyA // values[i] i++; } </code><button>Copy</button></pre> <a id="md:js" class="tsd-anchor"></a><h4><a href="#md:js">JS</a></h4><pre><code class="language-javascript"> const {MinHeap, MaxHeap} = require('data-structure-typed'); // /* or if you prefer */ const {MinHeap, MaxHeap} = require('heap-typed'); const minNumHeap = new MinHeap(); minNumHeap.add(1).add(6).add(2).add(0).add(5).add(9); minNumHeap.has(1) // true minNumHeap.has(2) // true minNumHeap.poll() // 0 minNumHeap.poll() // 1 minNumHeap.peek() // 2 minNumHeap.has(1); // false minNumHeap.has(2); // true const arrFromHeap = minNumHeap.toArray(); arrFromHeap.length // 4 arrFromHeap[0] // 2 arrFromHeap[1] // 5 arrFromHeap[2] // 9 arrFromHeap[3] // 6 minNumHeap.sort() // [2, 5, 6, 9] const maxHeap = new MaxHeap(); const myObj1 = {keyA: 'a1'}, myObj6 = {keyA: 'a6'}, myObj5 = {keyA: 'a5'}, myObj2 = {keyA: 'a2'}, myObj0 = {keyA: 'a0'}, myObj9 = {keyA: 'a9'}; maxHeap.add(1, myObj1); maxHeap.has(myObj1) // true maxHeap.has(myObj9) // false maxHeap.add(6, myObj6); maxHeap.has(myObj6) // true maxHeap.add(5, myObj5); maxHeap.has(myObj5) // true maxHeap.add(2, myObj2); maxHeap.has(myObj2) // true maxHeap.has(myObj6) // true maxHeap.add(0, myObj0); maxHeap.has(myObj0) // true maxHeap.has(myObj9) // false maxHeap.add(9, myObj9); maxHeap.has(myObj9) // true const peek9 = maxHeap.peek(true); peek9 && peek9.val && peek9.val.keyA // 'a9' const heapToArr = maxHeap.toArray(true); heapToArr.map(item => item?.val?.keyA) // ['a9', 'a2', 'a6', 'a1', 'a0', 'a5'] const values = ['a9', 'a6', 'a5', 'a2', 'a1', 'a0']; let i = 0; while (maxHeap.size > 0) { const polled = maxHeap.poll(true); polled && polled.val && polled.val.keyA // values[i] i++; } </code><button>Copy</button></pre> <a id="md:api-docs-amp-examples" class="tsd-anchor"></a><h2><a href="#md:api-docs-amp-examples">API docs & Examples</a></h2><a href="https://data-structure-typed-docs.vercel.app">API Docs</a> <a href="https://data-structure-typed-examples.vercel.app">Live Examples</a> <a href="https://github.com/zrwusa/data-structure-typed-examples" target="_blank">Examples Repository</a> <a id="md:data-structures" class="tsd-anchor"></a><h2><a href="#md:data-structures">Data Structures</a></h2><table> <thead> <tr> <th>Data Structure</th> <th>Unit Test</th> <th>Performance Test</th> <th>API Documentation</th> <th>Implemented</th> </tr> </thead> <tbody> <tr> <td>Binary Tree</td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""/> </td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""/> </td> <td><a href="https://data-structure-typed-docs.vercel.app/classes/BinaryTree.html">Binary Tree</a></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> </tr> <tr> <td>Binary Search Tree (BST)</td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><a href="https://data-structure-typed-docs.vercel.app/classes/BST.html">BST</a></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> </tr> <tr> <td>AVL Tree</td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><a href="https://data-structure-typed-docs.vercel.app/classes/AVLTree.html">AVLTree</a></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> </tr> <tr> <td>Tree Multiset</td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><a href="https://data-structure-typed-docs.vercel.app/classes/TreeMultiset.html">TreeMultiset</a></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> </tr> <tr> <td>Segment Tree</td> <td></td> <td></td> <td><a href="https://data-structure-typed-docs.vercel.app/classes/SegmentTree.html">SegmentTree</a></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> </tr> <tr> <td>Binary Indexed Tree</td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td></td> <td><a href="https://data-structure-typed-docs.vercel.app/classes/BinaryIndexedTree.html">BinaryIndexedTree</a></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> </tr> <tr> <td>Graph</td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><a href="https://data-structure-typed-docs.vercel.app/classes/AbstractGraph.html">AbstractGraph</a></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> </tr> <tr> <td>Directed Graph</td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><a href="https://data-structure-typed-docs.vercel.app/classes/DirectedGraph.html">DirectedGraph</a></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> </tr> <tr> <td>Undirected Graph</td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><a href="https://data-structure-typed-docs.vercel.app/classes/UndirectedGraph.html">UndirectedGraph</a></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> </tr> <tr> <td>Linked List</td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><a href="https://data-structure-typed-docs.vercel.app/classes/SinglyLinkedList.html">SinglyLinkedList</a></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> </tr> <tr> <td>Singly Linked List</td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><a href="https://data-structure-typed-docs.vercel.app/classes/SinglyLinkedList.html">SinglyLinkedList</a></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> </tr> <tr> <td>Doubly Linked List</td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><a href="https://data-structure-typed-docs.vercel.app/classes/DoublyLinkedList.html">DoublyLinkedList</a></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> </tr> <tr> <td>Queue</td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><a href="https://data-structure-typed-docs.vercel.app/classes/Queue.html">Queue</a></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> </tr> <tr> <td>Object Deque</td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><a href="https://data-structure-typed-docs.vercel.app/classes/ObjectDeque.html">ObjectDeque</a></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> </tr> <tr> <td>Array Deque</td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><a href="https://data-structure-typed-docs.vercel.app/classes/ArrayDeque.html">ArrayDeque</a></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> </tr> <tr> <td>Stack</td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td></td> <td><a href="https://data-structure-typed-docs.vercel.app/classes/Stack.html">Stack</a></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> </tr> <tr> <td>Coordinate Set</td> <td></td> <td></td> <td><a href="https://data-structure-typed-docs.vercel.app/classes/CoordinateSet.html">CoordinateSet</a></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> </tr> <tr> <td>Coordinate Map</td> <td></td> <td></td> <td><a href="https://data-structure-typed-docs.vercel.app/classes/CoordinateMap.html">CoordinateMap</a></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> </tr> <tr> <td>Heap</td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><a href="https://data-structure-typed-docs.vercel.app/classes/Heap.html">Heap</a></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> </tr> <tr> <td>Priority Queue</td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><a href="https://data-structure-typed-docs.vercel.app/classes/PriorityQueue.html">PriorityQueue</a></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> </tr> <tr> <td>Max Priority Queue</td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><a href="https://data-structure-typed-docs.vercel.app/classes/MaxPriorityQueue.html">MaxPriorityQueue</a></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> </tr> <tr> <td>Min Priority Queue</td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td><a href="https://data-structure-typed-docs.vercel.app/classes/MinPriorityQueue.html">MinPriorityQueue</a></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> </tr> <tr> <td>Trie</td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> <td></td> <td><a href="https://data-structure-typed-docs.vercel.app/classes/Trie.html">Trie</a></td> <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td> </tr> </tbody> </table> <a id="md:why" class="tsd-anchor"></a><h1><a href="#md:why">Why</a></h1><a id="md:complexities" class="tsd-anchor"></a><h2><a href="#md:complexities">Complexities</a></h2><a id="md:performance-of-big-o" class="tsd-anchor"></a><h3><a href="#md:performance-of-big-o">performance of Big O</a></h3><table> <thead> <tr> <th>Big O Notation</th> <th>Type</th> <th>Computations for 10 elements</th> <th>Computations for 100 elements</th> <th>Computations for 1000 elements</th> </tr> </thead> <tbody> <tr> <td>O(1)</td> <td>Constant</td> <td>1</td> <td>1</td> <td>1</td> </tr> <tr> <td>O(log N)</td> <td>Logarithmic</td> <td>3</td> <td>6</td> <td>9</td> </tr> <tr> <td>O(N)</td> <td>Linear</td> <td>10</td> <td>100</td> <td>1000</td> </tr> <tr> <td>O(N log N)</td> <td>n log(n)</td> <td>30</td> <td>600</td> <td>9000</td> </tr> <tr> <td>O(N^2)</td> <td>Quadratic</td> <td>100</td> <td>10000</td> <td>1000000</td> </tr> <tr> <td>O(2^N)</td> <td>Exponential</td> <td>1024</td> <td>1.26e+29</td> <td>1.07e+301</td> </tr> <tr> <td>O(N!)</td> <td>Factorial</td> <td>3628800</td> <td>9.3e+157</td> <td>4.02e+2567</td> </tr> </tbody> </table> <a id="md:data-structure-complexity" class="tsd-anchor"></a><h3><a href="#md:data-structure-complexity">Data Structure Complexity</a></h3><table> <thead> <tr> <th>Data Structure</th> <th>Access</th> <th>Search</th> <th>Insertion</th> <th>Deletion</th> <th>Comments</th> </tr> </thead> <tbody> <tr> <td>Array</td> <td>1</td> <td>n</td> <td>n</td> <td>n</td> <td></td> </tr> <tr> <td>Stack</td> <td>n</td> <td>n</td> <td>1</td> <td>1</td> <td></td> </tr> <tr> <td>Queue</td> <td>n</td> <td>n</td> <td>1</td> <td>1</td> <td></td> </tr> <tr> <td>Linked List</td> <td>n</td> <td>n</td> <td>1</td> <td>n</td> <td></td> </tr> <tr> <td>Hash Table</td> <td>-</td> <td>n</td> <td>n</td> <td>n</td> <td>In case of perfect hash function costs would be O(1)</td> </tr> <tr> <td>Binary Search Tree</td> <td>n</td> <td>n</td> <td>n</td> <td>n</td> <td>In case of balanced tree costs would be O(log(n))</td> </tr> <tr> <td>B-Tree</td> <td>log(n)</td> <td>log(n)</td> <td>log(n)</td> <td>log(n)</td> <td></td> </tr> <tr> <td>Red-Black Tree</td> <td>log(n)</td> <td>log(n)</td> <td>log(n)</td> <td>log(n)</td> <td></td> </tr> <tr> <td>AVL Tree</td> <td>log(n)</td> <td>log(n)</td> <td>log(n)</td> <td>log(n)</td> <td></td> </tr> <tr> <td>Bloom Filter</td> <td>-</td> <td>1</td> <td>1</td> <td>-</td> <td>False positives are possible while searching</td> </tr> </tbody> </table> <a id="md:sorting-complexity" class="tsd-anchor"></a><h3><a href="#md:sorting-complexity">Sorting Complexity</a></h3><table> <thead> <tr> <th>Name</th> <th>Best</th> <th>Average</th> <th>Worst</th> <th>Memory</th> <th>Stable</th> <th>Comments</th> </tr> </thead> <tbody> <tr> <td>Bubble sort</td> <td>n</td> <td>n2</td> <td>n2</td> <td>1</td> <td>Yes</td> <td></td> </tr> <tr> <td>Insertion sort</td> <td>n</td> <td>n2</td> <td>n2</td> <td>1</td> <td>Yes</td> <td></td> </tr> <tr> <td>Selection sort</td> <td>n2</td> <td>n2</td> <td>n2</td> <td>1</td> <td>No</td> <td></td> </tr> <tr> <td>Heap sort</td> <td>n log(n)</td> <td>n log(n)</td> <td>n log(n)</td> <td>1</td> <td>No</td> <td></td> </tr> <tr> <td>Merge sort</td> <td>n log(n)</td> <td>n log(n)</td> <td>n log(n)</td> <td>n</td> <td>Yes</td> <td></td> </tr> <tr> <td>Quick sort</td> <td>n log(n)</td> <td>n log(n)</td> <td>n2</td> <td>log(n)</td> <td>No</td> <td>Quicksort is usually done in-place with O(log(n)) stack space</td> </tr> <tr> <td>Shell sort</td> <td>n log(n)</td> <td>depends on gap sequence</td> <td>n (log(n))2</td> <td>1</td> <td>No</td> <td></td> </tr> <tr> <td>Counting sort</td> <td>n + r</td> <td>n + r</td> <td>n + r</td> <td>n + r</td> <td>Yes</td> <td>r - biggest number in array</td> </tr> <tr> <td>Radix sort</td> <td>n * k</td> <td>n * k</td> <td>n * k</td> <td>n + k</td> <td>Yes</td> <td>k - length of longest key</td> </tr> </tbody> </table> <img src="https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/assets/overview-diagram-of-data-structures.png" alt="overview diagram"> <img src="https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/assets/complexities-diff.jpg" alt="complexities"> <img src="https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/assets/data-structure-complexities.jpg" alt="complexities of data structures"> </div></div> <div class="col-sidebar"> <div class="page-menu"> <div class="tsd-navigation settings"> <details class="tsd-index-accordion"><summary class="tsd-accordion-summary"> <h3><svg width="20" height="20" viewBox="0 0 24 24" fill="none"><use href="#icon-chevronDown"></use></svg>Settings</h3></summary> <div class="tsd-accordion-details"> <div class="tsd-filter-visibility"> <h4 class="uppercase">Member Visibility</h4><form> <ul id="tsd-filter-options"> <li class="tsd-filter-item"><label class="tsd-filter-input"><input type="checkbox" id="tsd-filter-protected" name="protected"/><svg width="32" height="32" viewBox="0 0 32 32" aria-hidden="true"><use href="#icon-checkbox"></use></svg>Protected</label></li> <li class="tsd-filter-item"><label class="tsd-filter-input"><input type="checkbox" id="tsd-filter-private" name="private"/><svg width="32" height="32" viewBox="0 0 32 32" aria-hidden="true"><use href="#icon-checkbox"></use></svg>Private</label></li> <li class="tsd-filter-item"><label class="tsd-filter-input"><input type="checkbox" id="tsd-filter-inherited" name="inherited" checked/><svg width="32" height="32" viewBox="0 0 32 32" aria-hidden="true"><use href="#icon-checkbox"></use></svg>Inherited</label></li> <li class="tsd-filter-item"><label class="tsd-filter-input"><input type="checkbox" id="tsd-filter-external" name="external"/><svg width="32" height="32" viewBox="0 0 32 32" aria-hidden="true"><use href="#icon-checkbox"></use></svg>External</label></li></ul></form></div> <div class="tsd-theme-toggle"> <h4 class="uppercase">Theme</h4><select id="tsd-theme"><option value="os">OS</option><option value="light">Light</option><option value="dark">Dark</option></select></div></div></details></div> <de