Anonymous user
User:Kevin Reid/E tasks: Difference between revisions
gather the omits together, sort list of sorts, add heapsort
(updates) |
(gather the omits together, sort list of sorts, add heapsort) |
||
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.
As of
<div style="-webkit-column-count: 3">
Line 23:
===Algorithmic===
* [[Cocktail Sort]]▼
* [[Selection sort]]▼
* [[Shell sort]]▼
* [[Heapsort]]
* [[Closest pair problem]]
▲* [[Cocktail Sort]]
* [[Knapsack Problem]]
* [[Long Multiplication]]
Line 30 ⟶ 33:
* [[Maximum subsequence]]
* [[Non Continuous Subsequences]]
▲* [[Selection sort]]
▲* [[Shell sort]]
* [[Point in polygon (ray casting algorithm)]]
* [[Topological (dependency) sort]]
Line 40 ⟶ 41:
==Concurrency==
* [[Rendezvous]] (Hard to define what this ''means'' in E. Intervat perhaps? Is currently marked omit.)▼
==Funky control flow==
Line 99:
==Argue with==
* [[Determine if Only One Instance is Running]]
* [[Evens Sum To Even]]▼
==Needs a ... to be done well==
Line 204 ⟶ 201:
==Special cases==
* [[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==
| |||