--- !ditz.rubyforge.org,2008-03-06/issue 
title: improve Array sorting algorithm
desc: |-
  Fast path for an array object with an array part, as this is the most important case.
  
  Implementing a C recursion limit or guaranteeing an O(log n) recursion depth.
  Currently worst case is O(n).  Although random pivots mean that it is not trivial
  to craft inputs to cause the worst case, it is still possible because the pivot
  randomization is not cryptographic strength.
  
  A sort algorithm with an O(log n) worst case would be more preferable than qsort
  workarounds.
type: :task
component: duk
release: 
reporter: sva <sami.vaarala@poplatek.fi>
status: :unstarted
disposition: 
creation_time: 2013-03-25 09:32:20.972490 Z
references: []

id: b14694b04da936b82e7742b4d713782b123c09e2
log_events: 
- - 2013-03-25 09:32:21.276458 Z
  - sva <sami.vaarala@poplatek.fi>
  - created
  - ""