Merge branch 'master' of https://github.com/justcoding121/Advanced-Al…

…gorithms

docs/api/Advanced.Algorithms.DataStructures.Foundation.OrderedDictionary-2.html

@@ -521,7 +521,7 @@ <h5 class="returns">Returns</h5>
 
   <a id="Advanced_Algorithms_DataStructures_Foundation_OrderedDictionary_2_Min_" data-uid="Advanced.Algorithms.DataStructures.Foundation.OrderedDictionary`2.Min*"></a>
   <h4 id="Advanced_Algorithms_DataStructures_Foundation_OrderedDictionary_2_Min" data-uid="Advanced.Algorithms.DataStructures.Foundation.OrderedDictionary`2.Min">Min()</h4>
-  <div class="markdown level1 summary"><p>Time complexity: O(1).</p>
+  <div class="markdown level1 summary"><p>Time complexity: O(log(n)).</p>
 </div>
   <div class="markdown level1 conceptual"></div>
   <h5 class="decalaration">Declaration</h5>

docs/api/Advanced.Algorithms.DataStructures.Foundation.OrderedHashSet-1.html

@@ -469,7 +469,7 @@ <h5 class="returns">Returns</h5>
 
   <a id="Advanced_Algorithms_DataStructures_Foundation_OrderedHashSet_1_Max_" data-uid="Advanced.Algorithms.DataStructures.Foundation.OrderedHashSet`1.Max*"></a>
   <h4 id="Advanced_Algorithms_DataStructures_Foundation_OrderedHashSet_1_Max" data-uid="Advanced.Algorithms.DataStructures.Foundation.OrderedHashSet`1.Max">Max()</h4>
-  <div class="markdown level1 summary"><p>Time complexity: O(1).</p>
+  <div class="markdown level1 summary"><p>Time complexity: O(log(n)).</p>
 </div>
   <div class="markdown level1 conceptual"></div>
   <h5 class="decalaration">Declaration</h5>
@@ -495,7 +495,7 @@ <h5 class="returns">Returns</h5>
 
   <a id="Advanced_Algorithms_DataStructures_Foundation_OrderedHashSet_1_Min_" data-uid="Advanced.Algorithms.DataStructures.Foundation.OrderedHashSet`1.Min*"></a>
   <h4 id="Advanced_Algorithms_DataStructures_Foundation_OrderedHashSet_1_Min" data-uid="Advanced.Algorithms.DataStructures.Foundation.OrderedHashSet`1.Min">Min()</h4>
-  <div class="markdown level1 summary"><p>Time complexity: O(1).</p>
+  <div class="markdown level1 summary"><p>Time complexity: O(log(n)).</p>
 </div>
   <div class="markdown level1 conceptual"></div>
   <h5 class="decalaration">Declaration</h5>

docs/index.json

@@ -187,12 +187,12 @@
   "api/Advanced.Algorithms.DataStructures.Foundation.OrderedDictionary-2.html": {
     "href": "api/Advanced.Algorithms.DataStructures.Foundation.OrderedDictionary-2.html",
     "title": "Class OrderedDictionary<K, V> | Advanced Algorithms",
-    "keywords": "Class OrderedDictionary<K, V> A sorted Dictionary implementation using balanced binary search tree. IEnumerable will enumerate in sorted order. This may be better than regular Dictionary implementation which can give o(K) in worst case (but O(1) amortized when collisions K is avoided). Inheritance Object OrderedDictionary<K, V> Namespace : Advanced.Algorithms.DataStructures.Foundation Assembly : Advanced.Algorithms.dll Syntax public class OrderedDictionary<K, V> : IEnumerable<KeyValuePair<K, V>> where K : IComparable Type Parameters Name Description K The key datatype. V The value datatype. Constructors OrderedDictionary() Declaration public OrderedDictionary() OrderedDictionary(IEnumerable<KeyValuePair<K, V>>) Initialize the dictionary with given key value pairs sorted by key. Time complexity: log(n). Declaration public OrderedDictionary(IEnumerable<KeyValuePair<K, V>> sortedKeyValuePairs) Parameters Type Name Description IEnumerable < KeyValuePair <K, V>> sortedKeyValuePairs Properties Count Declaration public int Count { get; } Property Value Type Description Int32 Item[K] Get/set value for given key. Time complexity: O(log(n)). Declaration public V this[K key] { get; set; } Parameters Type Name Description K key Property Value Type Description V Methods Add(K, V) Add a new value for given key. Time complexity: O(log(n)). Returns the position (index) of the key in sorted order of this OrderedDictionary. Declaration public int Add(K key, V value) Parameters Type Name Description K key V value Returns Type Description Int32 AsEnumerableDesc() Descending enumerable. Declaration public IEnumerable<KeyValuePair<K, V>> AsEnumerableDesc() Returns Type Description IEnumerable < KeyValuePair <K, V>> ContainsKey(K) Does this dictionary contains the given key. Time complexity: O(log(n)). Declaration public bool ContainsKey(K key) Parameters Type Name Description K key The key to check. Returns Type Description Boolean True if this dictionary contains the given key. ElementAt(Int32) Time complexity: O(log(n)) Declaration public KeyValuePair<K, V> ElementAt(int index) Parameters Type Name Description Int32 index Returns Type Description KeyValuePair <K, V> GetEnumerator() Declaration public IEnumerator<KeyValuePair<K, V>> GetEnumerator() Returns Type Description IEnumerator < KeyValuePair <K, V>> GetEnumeratorDesc() Declaration public IEnumerator<KeyValuePair<K, V>> GetEnumeratorDesc() Returns Type Description IEnumerator < KeyValuePair <K, V>> IndexOf(K) Time complexity: O(log(n)) Declaration public int IndexOf(K key) Parameters Type Name Description K key Returns Type Description Int32 Max() Time complexity: O(1). Declaration public KeyValuePair<K, V> Max() Returns Type Description KeyValuePair <K, V> Min() Time complexity: O(1). Declaration public KeyValuePair<K, V> Min() Returns Type Description KeyValuePair <K, V> NextHigher(K) Return the next higher key-value pair after given key in this dictionary. Time complexity: O(log(n)). Declaration public KeyValuePair<K, V> NextHigher(K key) Parameters Type Name Description K key Returns Type Description KeyValuePair <K, V> Null if the given key does'nt exist or next key does'nt exist. NextLower(K) Return the next lower key-value pair before given key in this dictionary. Time complexity: O(log(n)). Declaration public KeyValuePair<K, V> NextLower(K key) Parameters Type Name Description K key Returns Type Description KeyValuePair <K, V> Null if the given key does'nt exist or previous key does'nt exist. Remove(K) Remove the given key if it exists. Time complexity: O(log(n)). Returns the position (index) of the removed key if removed. Otherwise returns -1. Declaration public int Remove(K key) Parameters Type Name Description K key Returns Type Description Int32 RemoveAt(Int32) Remove the element at given index. Time complexity: O(log(n)). Declaration public KeyValuePair<K, V> RemoveAt(int index) Parameters Type Name Description Int32 index Returns Type Description KeyValuePair <K, V>"
+    "keywords": "Class OrderedDictionary<K, V> A sorted Dictionary implementation using balanced binary search tree. IEnumerable will enumerate in sorted order. This may be better than regular Dictionary implementation which can give o(K) in worst case (but O(1) amortized when collisions K is avoided). Inheritance Object OrderedDictionary<K, V> Namespace : Advanced.Algorithms.DataStructures.Foundation Assembly : Advanced.Algorithms.dll Syntax public class OrderedDictionary<K, V> : IEnumerable<KeyValuePair<K, V>> where K : IComparable Type Parameters Name Description K The key datatype. V The value datatype. Constructors OrderedDictionary() Declaration public OrderedDictionary() OrderedDictionary(IEnumerable<KeyValuePair<K, V>>) Initialize the dictionary with given key value pairs sorted by key. Time complexity: log(n). Declaration public OrderedDictionary(IEnumerable<KeyValuePair<K, V>> sortedKeyValuePairs) Parameters Type Name Description IEnumerable < KeyValuePair <K, V>> sortedKeyValuePairs Properties Count Declaration public int Count { get; } Property Value Type Description Int32 Item[K] Get/set value for given key. Time complexity: O(log(n)). Declaration public V this[K key] { get; set; } Parameters Type Name Description K key Property Value Type Description V Methods Add(K, V) Add a new value for given key. Time complexity: O(log(n)). Returns the position (index) of the key in sorted order of this OrderedDictionary. Declaration public int Add(K key, V value) Parameters Type Name Description K key V value Returns Type Description Int32 AsEnumerableDesc() Descending enumerable. Declaration public IEnumerable<KeyValuePair<K, V>> AsEnumerableDesc() Returns Type Description IEnumerable < KeyValuePair <K, V>> ContainsKey(K) Does this dictionary contains the given key. Time complexity: O(log(n)). Declaration public bool ContainsKey(K key) Parameters Type Name Description K key The key to check. Returns Type Description Boolean True if this dictionary contains the given key. ElementAt(Int32) Time complexity: O(log(n)) Declaration public KeyValuePair<K, V> ElementAt(int index) Parameters Type Name Description Int32 index Returns Type Description KeyValuePair <K, V> GetEnumerator() Declaration public IEnumerator<KeyValuePair<K, V>> GetEnumerator() Returns Type Description IEnumerator < KeyValuePair <K, V>> GetEnumeratorDesc() Declaration public IEnumerator<KeyValuePair<K, V>> GetEnumeratorDesc() Returns Type Description IEnumerator < KeyValuePair <K, V>> IndexOf(K) Time complexity: O(log(n)) Declaration public int IndexOf(K key) Parameters Type Name Description K key Returns Type Description Int32 Max() Time complexity: O(1). Declaration public KeyValuePair<K, V> Max() Returns Type Description KeyValuePair <K, V> Min() Time complexity: O(log(n)). Declaration public KeyValuePair<K, V> Min() Returns Type Description KeyValuePair <K, V> NextHigher(K) Return the next higher key-value pair after given key in this dictionary. Time complexity: O(log(n)). Declaration public KeyValuePair<K, V> NextHigher(K key) Parameters Type Name Description K key Returns Type Description KeyValuePair <K, V> Null if the given key does'nt exist or next key does'nt exist. NextLower(K) Return the next lower key-value pair before given key in this dictionary. Time complexity: O(log(n)). Declaration public KeyValuePair<K, V> NextLower(K key) Parameters Type Name Description K key Returns Type Description KeyValuePair <K, V> Null if the given key does'nt exist or previous key does'nt exist. Remove(K) Remove the given key if it exists. Time complexity: O(log(n)). Returns the position (index) of the removed key if removed. Otherwise returns -1. Declaration public int Remove(K key) Parameters Type Name Description K key Returns Type Description Int32 RemoveAt(Int32) Remove the element at given index. Time complexity: O(log(n)). Declaration public KeyValuePair<K, V> RemoveAt(int index) Parameters Type Name Description Int32 index Returns Type Description KeyValuePair <K, V>"
   },
   "api/Advanced.Algorithms.DataStructures.Foundation.OrderedHashSet-1.html": {
     "href": "api/Advanced.Algorithms.DataStructures.Foundation.OrderedHashSet-1.html",
     "title": "Class OrderedHashSet<T> | Advanced Algorithms",
-    "keywords": "Class OrderedHashSet<T> A sorted HashSet implementation using balanced binary search tree. IEnumerable will enumerate in sorted order. This may be better than regular HashSet implementation which can give o(K) in worst case (but O(1) amortized when collisions K is avoided). Inheritance Object OrderedHashSet<T> Namespace : Advanced.Algorithms.DataStructures.Foundation Assembly : Advanced.Algorithms.dll Syntax public class OrderedHashSet<T> : IEnumerable<T> where T : IComparable Type Parameters Name Description T The value datatype. Constructors OrderedHashSet() Declaration public OrderedHashSet() OrderedHashSet(IEnumerable<T>) Initialize the sorted hashset with given sorted key collection. Time complexity: log(n). Declaration public OrderedHashSet(IEnumerable<T> sortedKeys) Parameters Type Name Description IEnumerable <T> sortedKeys Properties Count Declaration public int Count { get; } Property Value Type Description Int32 Item[Int32] Time complexity: O(log(n)) Declaration public T this[int index] { get; } Parameters Type Name Description Int32 index Property Value Type Description T Methods Add(T) Add a new key. Time complexity: O(log(n)). Returns the position (index) of the key in sorted order of this OrderedHashSet. Declaration public void Add(T key) Parameters Type Name Description T key AsEnumerableDesc() Descending enumerable. Declaration public IEnumerable<T> AsEnumerableDesc() Returns Type Description IEnumerable <T> Contains(T) Does this hash table contains the given value. Time complexity: O(log(n)). Declaration public bool Contains(T value) Parameters Type Name Description T value The value to check. Returns Type Description Boolean True if this hashset contains the given value. ElementAt(Int32) Time complexity: O(log(n)) Declaration public T ElementAt(int index) Parameters Type Name Description Int32 index Returns Type Description T GetEnumerator() Declaration public IEnumerator<T> GetEnumerator() Returns Type Description IEnumerator <T> GetEnumeratorDesc() Declaration public IEnumerator<T> GetEnumeratorDesc() Returns Type Description IEnumerator <T> IndexOf(T) Time complexity: O(log(n)) Declaration public int IndexOf(T key) Parameters Type Name Description T key Returns Type Description Int32 Max() Time complexity: O(1). Declaration public T Max() Returns Type Description T Min() Time complexity: O(1). Declaration public T Min() Returns Type Description T NextHigher(T) Return the next higher value after given value in this hashset. Time complexity: O(log(n)). Declaration public T NextHigher(T value) Parameters Type Name Description T value Returns Type Description T Null if the given value does'nt exist or next value does'nt exist. NextLower(T) Return the next lower value before given value in this HashSet. Time complexity: O(log(n)). Declaration public T NextLower(T value) Parameters Type Name Description T value Returns Type Description T Null if the given value does'nt exist or previous value does'nt exist. Remove(T) Remove the given key if present. Time complexity: O(log(n)). Returns the position (index) of the removed key if removed. Otherwise returns -1. Declaration public int Remove(T key) Parameters Type Name Description T key Returns Type Description Int32 RemoveAt(Int32) Remove the element at given index. Time complexity: O(log(n)). Declaration public T RemoveAt(int index) Parameters Type Name Description Int32 index Returns Type Description T"
+    "keywords": "Class OrderedHashSet<T> A sorted HashSet implementation using balanced binary search tree. IEnumerable will enumerate in sorted order. This may be better than regular HashSet implementation which can give o(K) in worst case (but O(1) amortized when collisions K is avoided). Inheritance Object OrderedHashSet<T> Namespace : Advanced.Algorithms.DataStructures.Foundation Assembly : Advanced.Algorithms.dll Syntax public class OrderedHashSet<T> : IEnumerable<T> where T : IComparable Type Parameters Name Description T The value datatype. Constructors OrderedHashSet() Declaration public OrderedHashSet() OrderedHashSet(IEnumerable<T>) Initialize the sorted hashset with given sorted key collection. Time complexity: log(n). Declaration public OrderedHashSet(IEnumerable<T> sortedKeys) Parameters Type Name Description IEnumerable <T> sortedKeys Properties Count Declaration public int Count { get; } Property Value Type Description Int32 Item[Int32] Time complexity: O(log(n)) Declaration public T this[int index] { get; } Parameters Type Name Description Int32 index Property Value Type Description T Methods Add(T) Add a new key. Time complexity: O(log(n)). Returns the position (index) of the key in sorted order of this OrderedHashSet. Declaration public void Add(T key) Parameters Type Name Description T key AsEnumerableDesc() Descending enumerable. Declaration public IEnumerable<T> AsEnumerableDesc() Returns Type Description IEnumerable <T> Contains(T) Does this hash table contains the given value. Time complexity: O(log(n)). Declaration public bool Contains(T value) Parameters Type Name Description T value The value to check. Returns Type Description Boolean True if this hashset contains the given value. ElementAt(Int32) Time complexity: O(log(n)) Declaration public T ElementAt(int index) Parameters Type Name Description Int32 index Returns Type Description T GetEnumerator() Declaration public IEnumerator<T> GetEnumerator() Returns Type Description IEnumerator <T> GetEnumeratorDesc() Declaration public IEnumerator<T> GetEnumeratorDesc() Returns Type Description IEnumerator <T> IndexOf(T) Time complexity: O(log(n)) Declaration public int IndexOf(T key) Parameters Type Name Description T key Returns Type Description Int32 Max() Time complexity: O(log(n)). Declaration public T Max() Returns Type Description T Min() Time complexity: O(log(n)). Declaration public T Min() Returns Type Description T NextHigher(T) Return the next higher value after given value in this hashset. Time complexity: O(log(n)). Declaration public T NextHigher(T value) Parameters Type Name Description T value Returns Type Description T Null if the given value does'nt exist or next value does'nt exist. NextLower(T) Return the next lower value before given value in this HashSet. Time complexity: O(log(n)). Declaration public T NextLower(T value) Parameters Type Name Description T value Returns Type Description T Null if the given value does'nt exist or previous value does'nt exist. Remove(T) Remove the given key if present. Time complexity: O(log(n)). Returns the position (index) of the removed key if removed. Otherwise returns -1. Declaration public int Remove(T key) Parameters Type Name Description T key Returns Type Description Int32 RemoveAt(Int32) Remove the element at given index. Time complexity: O(log(n)). Declaration public T RemoveAt(int index) Parameters Type Name Description Int32 index Returns Type Description T"
   },
   "api/Advanced.Algorithms.DataStructures.Foundation.Queue-1.html": {
     "href": "api/Advanced.Algorithms.DataStructures.Foundation.Queue-1.html",