Adding MIT licence to project
Editing README file of the project
A little rewriting of README file
Adding implemention for priority queue

Classes:
BinaryHeap<T>
PriorityQueue<T>
PriorityQueueEmptyException
InvalidItemComparisonForHeapException

Interfaces:
IBinaryHeap<T>
IPriorityQueue<T>
Fixing bugs for binary heaps and adding test

Adding several tests for binary heap including minimum heapsort and maximum heapsort.
Doing some code refactoring and addressing minor bugs in binary heap class
Fixing bugs in PriorityQueue class and adding test for it

Test:
Queue construction
Enqueue
Peek

Fixed bug in peek method implementation
Removing ConsoleTest project from SmartNet

It is based in the lot of overheads added just for a quick testing of features.
Instead, I decide to keep a separate Console application (non-related to this repo) for do it that
Merge branch 'master' into dev
Removing ConsoleTest project from this branch
Merge branch 'dev' into algorithms
Removing ConsoleTest project for this branch
Merge branch 'dev' into utilities
Adding test for BinaryHeap class and fixing minor bugs

Test for methods:
HeapIncreaseKey
HeapDecreaseKey

Test for constructors:
- Empty constructor
- Constructor with IComparer<T> as parameter

Bugs:
- In swaping elements in both HeapDecreaseKey and HeapIncreaseKey
- In parent method when calculating position
Dependency Injection for IBinaryHeap in PriorityQueue constructor

Also added test for the new 4 constructors allowing this behavior

Constructors:
- PriorityQueue(IBinaryHeap<T> heap)
- PriorityQueue(IBinaryHeap<T> heap, int capacity)
- PriorityQueue(IBinaryHeap<T> heap, IEnumerable<T> items)
- PriorityQueue(IBinaryHeap<T> heap, params T[] items)
Improving clear method and testing clear and peek methods in PriorityQueue

Improvement:
Deleting call to list.Clear(), everything what is necessary is to set Count = 0

Tests:
- ClearEmptyQueue
- ClearNonEmptyQueue
- PeekIsGreater
Renaming Exceptions and adding some checking in Dequeue methods

Exceptions:
- DequeueNonPositiveQuantityException
- InvalidItemComparisonHeapException
- NullElementEnqueueException
- QuantityNotStoredQueueException
Solving issues with exception handling in IEnumerable Dequeue

Solution:
Split IEnumerable<T> Dequeue(int count) method in:
- IEnumerable<T> Dequeue(int count):
Still the public interface, but now only handles argument checking and throwing proper exceptions.
- IEnumerable<T> InnerDequeue(int count) -> private:
This is the one that actually yields the IEnumerable
Adding tests for dequeue and peek methods

Checking if the extracted element is the greater of the queue and if after dequeue the element at first in the queue is the greater
Merge branch 'utilities' into dev
Merge branch 'dev' into algorithms