Rosetta Code:Village Pump/Suggest a programming task: Difference between revisions

Line 72:
* Simple command line client for [[wp:Extensible Messaging and Presence Protocol|XMPP]] (Extensible Messaging and Presence Protocol) .
 
=== Data organizationstructures and encodingalgorithms ===
* [[Sorting_algorithms/Heapsort|Heapsort]] and maybe some other sorts from [[wp:Algorithm implementation/Sorting|Wikipedia's list of sorting algorithms]]
:: I might be interested in [[wp:Introsort]] and [[wp:Timsort]], as both are reported to be highly efficient sorts. However, they're also not the best-described sorting algorithms (e.g., no actual algorithm on the WP pages) so I'm not in a hurry to actually take them on. –[[User:Dkf|Donal Fellows]] 09:15, 2 September 2010 (UTC)
Line 90:
* [[wp:Hash table]]: It's an extremely common data structure in practice, as it has very nice performance, so it would be good to have at least one task on it (as part of the Data Structures trail). –[[User:Dkf|Donal Fellows]] 09:36, 20 January 2011 (UTC)
:: Hmm; there's [[Associative array]] (and its associated tasks). Not quite as obvious as I hoped for. Maybe we need some more tasks in this area. –[[User:Dkf|Donal Fellows]] 09:26, 21 January 2011 (UTC)
 
==== Graph algorithms ====
* [[wp:Dijkstra's algorithm|Dijkstra's algorithm]]: single-source shortest-paths problem —''[[User:Ruud Koot|Ruud]]'' 22:37, 10 March 2011 (UTC)
* [[wp:Floyd–Warshall algorithm|Floyd–Warshall algorithm]]: all-pairs shortest-paths problem —''[[User:Ruud Koot|Ruud]]'' 22:37, 10 March 2011 (UTC)
* [[wp:Ford–Fulkerson algorithm|Ford–Fulkerson algorithm]] ([[wp:Edmonds–Karp|Edmonds–Karp]] variant): maximum-flow problem —''[[User:Ruud Koot|Ruud]]'' 22:37, 10 March 2011 (UTC)
* Minimum mean-weight cycle cancelling algorithm: minimum-cost maximum-flow problem —''[[User:Ruud Koot|Ruud]]'' 22:37, 10 March 2011 (UTC)
 
===System calls===
Anonymous user