C-Sharp-Algorithms

C-Sharp-Algorithms copied to clipboard

Inefficient merge soft

3

``` int midIndex = collection.Count / 2; var leftCollection = collection.GetRange(startIndex, midIndex); var rightCollection = collection.GetRange(midIndex, (endIndex - midIndex) + 1); leftCollection = InternalMergeSort(leftCollection, 0, leftCollection.Count - 1, comparer); rightCollection...

davidich

MaxHeap bad algorithm.

2

# steps to reproduce Write a loop, from 1 to 80000, each time add a random int to the max heap. In theory it takes very little time(NlogN, N=80000,

crucialize

IsAnagram logic needs to be fixed

1

I think the IsAnagram() method doesn't work as expected. For example, it would fail for the below string combinations ("abc","bbb") or ("acdf", "bcde"). I think a simple LINQ implementation would...

harsh-athalye

looks not any bitmap in this repo. plan for RoaringBitmap support ?

sgf

https://chrispenner.ca/posts/intro-to-finger-trees

aalhour

Implement the Finger Trees data structure. Reference: [http://www.staff.city.ac.uk/~ross/papers/FingerTree.html](http://www.staff.city.ac.uk/~ross/papers/FingerTree.html).

aalhour

Implement the [R-Tree](https://en.wikipedia.org/wiki/R-tree) Data Structure.

aalhour

Implement the [B+ Tree](https://en.wikipedia.org/wiki/B%2B_tree) Data Structure.

aalhour

Implement the B\* Tree Data Structure.

aalhour

Implement the [Hilbert R-Tree](https://en.wikipedia.org/wiki/Hilbert_R-tree) Data Structure.

aalhour