Task Description

Write an Implementation of Timsort in Winxed. The implementation needs to be accurate to the algorithm, but does not need to be optimized.

For help, see an example implementation of Quicksort in Rosella (A Winxed library project)

Benefits

Timsort is a relatively new and interesting sort routine which may have comparable or even superior performance to other algorithms such as Quicksort or Heap Sort, for certain types of inputs. Having an implementation available to study, optimize, and benchmark would be very beneficial for Parrot.

Requirements

1) Knowledge of, or ability to quickly learn Winxed (a language inspired by Java, C#, and JavaScript)

2) Ability to build and install Parrot