Merge branch 'master' of https://github.com/mikkul/PriorityQueue

Author: mikkul

README.md

@@ -5,6 +5,7 @@ Priority queue implementations in C#
 ## Table of contents
 
 * [Features](#features)
+* [Instalation](#instalation)
 * [Example usage](#example-usage)
 * [Implementation comparison](#implementation-comparison)
 * [Time complexity](#time-complexity)
@@ -16,6 +17,10 @@ Priority queue implementations in C#
 * Two default implementations of the priority queue data structure
 * Easy way to create your own implementation by implementing the `IPriorityQueue` interface
 
+## Instalation
+
+Use the [Nuget package](https://www.nuget.org/packages/PriorityQueues/) or download the source code
+
 ## Example usage
 
 First we'll define a sample class that which will be used in our queue.
@@ -58,7 +63,7 @@ There are two deafult implementations: `BinaryHeapPriorityQueue` and `MappedBina
 |Enqueue|O(log n)|O(log n)|
 |Dequeue|O(log n)|O(log n)|
 |IsEmpty|O(1)|O(1)|
-|Remove|O(n)|O(1)|
+|Remove|O(log n)|O(log n)|
 |Contains|O(n)|O(1)|
 |Clear|O(n)|O(n)|