Mohammad Jafari

Add Tim Sort

1

I implemented the Tim Sort. I tried to keep it in the same fashion as other sorting algorithms as much as possible. I even used the source code of insertion...

There was a tiny problem with the condition. when the index is equal to the length of the list we must append it to the tail not when it's equal...

We implemented an API for resizing the hashtable in case of need. Clearly, the new capacity being greater than the current size of the hashtable is necessary to hold. There...

it would be nice to have PreOrder, InOrder, and PostOrder traversal methods that return nodes in the desired order in an array or slice. I guess my friend and I...

I looked into the code and actually, there is a tiny problem with it. There is an iteration in the Delete function which keeps traversing the tree until it finds...