User:ShinTakezou/Notes: Difference between revisions
Content added Content deleted
(euler method needing sols in langs I know) |
|||
(One intermediate revision by the same user not shown) | |||
Line 1: | Line 1: | ||
== Add solution(s) to / take a look at == |
== Add solution(s) to / take a look at == |
||
* [[Loop over multiple arrays simultaneously]] |
* [[Loop over multiple arrays simultaneously]] (++octave) |
||
* [[Gray code]] |
* [[Gray code]] |
||
* [[K-means%2B%2B clustering]] |
* [[K-means%2B%2B clustering]] |
||
Line 32: | Line 32: | ||
* [[XML/XPath]] |
* [[XML/XPath]] |
||
* [[Constrained random points on a circle]] |
* [[Constrained random points on a circle]] |
||
* [[FFT]] |
|||
* [[Euler method]] |
Latest revision as of 19:29, 19 June 2011
Add solution(s) to / take a look at
- Loop over multiple arrays simultaneously (++octave)
- Gray code
- K-means++ clustering
- Multiplication tables
- CSV to HTML translation
- Brownian tree
- Arbitrary-precision integers (included)
- Arithmetic/Rational
- Associative arrays/Creation
- Dining philosophers
- Fractal tree
- Hamming numbers
- Go Fish
- Horner's rule for polynomial evaluation
- Hough transform
- Pangram checker
- Polynomial long division
- Find the missing permutation
- Knuth shuffle
- Random Distribution Checker
- Ray-casting algorithm
- Safe addition
- Simple Random Distribution Checker
- Sorting algorithms/Pancake sort
- Sorting algorithms/Stooge sort
- Stable marriage problem
- Sutherland-Hodgman polygon clipping
- Zig-zag matrix
- Verify distribution uniformity/Naive
- XML/XPath
- Constrained random points on a circle
- FFT
- Euler method