OpenEuphoria

Re: Euphoria's identity/philosophy -- Where is the focus?

• Posted by _tom (admin) Nov 06, 2014
• 2748 views

include std/sort.e 
 
sequence testdata = 
{ {1,1}, 
  {2,1}, 
  {2,2}, 
  {1,2}, 
  {3,1}, 
  {2,3}, 
  {2,4}, 
  {1,3}, 
  {2,5}, 
  {3,2} } 
 
? sort(testdata) 
/* 

{ 
  {1,1}, 
  {1,2}, 
  {1,3}, 
  {2,1}, 
  {2,2}, 
  {2,3}, 
  {2,4}, 
  {2,5}, 
  {3,1}, 
  {3,2} 
} 
*/ 

The simple answer is that "often" it does not matter if the sort is stable.

The "real" answer is we need your help. Every rant does help but arguments with source-code speak louder.

It is only logical that there should be a choice of sorting algorithms.

I just learned of the Timsort algorithm which is used in Python and Java. This is a stable sort with a hybrid algorithm. It takes about 1300 lines of C code.

Looking forward to seeing your solution.

_tom