User:Kevin Reid/E tasks: Difference between revisions

Content added Content deleted
(updates)
(gather the omits together, sort list of sorts, add heapsort)
Line 1: Line 1:
This is [[User:Kevin Reid|Kevin Reid]]'s classification of [[tasks not implemented in E]], or just poorly done in E, by what kind of problem they are, or what kind of library/language work should come first.
This is [[User:Kevin Reid|Kevin Reid]]'s classification of [[tasks not implemented in E]], or just poorly done in E, by what kind of problem they are, or what kind of library/language work should come first.


As of 00:03, 11 July 2009. When updating this list, consult [http://rosettacode.org/w/index.php?title=Template:Unimp_body_E&action=history the diffs] since then for what to add/remove.
As of 12:04, 17 July 2009. When updating this list, consult [http://rosettacode.org/w/index.php?title=Template:Unimp_body_E&action=history the diffs] since then for what to add/remove.


<div style="-webkit-column-count: 3">
<div style="-webkit-column-count: 3">
Line 23: Line 23:


===Algorithmic===
===Algorithmic===
* [[Cocktail Sort]]
* [[Selection sort]]
* [[Shell sort]]
* [[Heapsort]]
* [[Closest pair problem]]
* [[Closest pair problem]]
* [[Cocktail Sort]]
* [[Knapsack Problem]]
* [[Knapsack Problem]]
* [[Long Multiplication]]
* [[Long Multiplication]]
Line 30: Line 33:
* [[Maximum subsequence]]
* [[Maximum subsequence]]
* [[Non Continuous Subsequences]]
* [[Non Continuous Subsequences]]
* [[Selection sort]]
* [[Shell sort]]
* [[Point in polygon (ray casting algorithm)]]
* [[Point in polygon (ray casting algorithm)]]
* [[Topological (dependency) sort]]
* [[Topological (dependency) sort]]
Line 40: Line 41:


==Concurrency==
==Concurrency==
* [[Rendezvous]] (Hard to define what this ''means'' in E. Intervat perhaps? Is currently marked omit.)


==Funky control flow==
==Funky control flow==
Line 99: Line 99:
==Argue with==
==Argue with==
* [[Determine if Only One Instance is Running]]
* [[Determine if Only One Instance is Running]]

==Contortions==
* [[Evens Sum To Even]]


==Needs a ... to be done well==
==Needs a ... to be done well==
Line 204: Line 201:
==Special cases==
==Special cases==
* [[Measure relative performance of sorting algorithms implementations]] -- waiting on sorts, Query Performance
* [[Measure relative performance of sorting algorithms implementations]] -- waiting on sorts, Query Performance

==Notable omits==
* [[Evens Sum To Even]] wants a 'proof'
* [[Rendezvous]] (Hard to define what this ''means'' in E. Intervat perhaps? Is currently marked omit.)


==To review==
==To review==