Rosetta Code:Village Pump/Suggest a programming task: Difference between revisions
Content added Content deleted
(→Data organization and encoding: Floating-point literals) |
|||
| Line 154: | Line 154: | ||
Place new items here, if it's unclear where they belong. |
Place new items here, if it's unclear where they belong. |
||
* Breadth-first search (BFS). Given an n-ary tree, enumerate all the leaves of the tree in breadth-first, left-to-right order and collect them into a list. |
|||
* Particle Swarm Optimization (PSO) implementation. A test case would be something like finding the global minimum of the banana function using PSO. An optional addition to the task would be to implement the algorithm using concurrency/parallelization techniques. The task is inherently parallel. --[[User:Treefall|Treefall]] 23:32, 30 August 2010 (UTC) |
* Particle Swarm Optimization (PSO) implementation. A test case would be something like finding the global minimum of the banana function using PSO. An optional addition to the task would be to implement the algorithm using concurrency/parallelization techniques. The task is inherently parallel. --[[User:Treefall|Treefall]] 23:32, 30 August 2010 (UTC) |
||