Anonymous user
User:Kevin Reid/E tasks: Difference between revisions
classifying
(classifying) |
(classifying) |
||
Line 9:
* [[Doubly-linked list/Traversal]]
* [[Evaluate binomial coefficients]]
* [[Hailstone sequence]]▼
* [[Hamming numbers]]▼
* [[Horner's rule for polynomial evaluation]]▼
==Language/library features==
Line 15 ⟶ 18:
* [[Compile-time calculation]]
* [[Extreme floating point values]]
* [[Flow-control structures]]▼
* [[JSON]] (2 ways: terml and deJSONKit)
==Algorithmic==
* [[Arena storage pool]] (Covers both implementing an allocator, and using it to allocate physical memory... Do the first part perhaps.)▼
* [[Best shuffle]]
* [[Catmull–Clark subdivision surface]]
Line 22 ⟶ 28:
* [[Closest-pair problem]]
* [[Equilibrium index]]
* [[Find common directory path]]▼
* [[Find the missing permutation]]▼
* [[Long multiplication]]
* [[Longest common subsequence]]
* [[Non-continuous subsequences]]
* [[Ray-casting algorithm]]
* [[Sorting algorithms/Bead sort]]▼
▲* [[Arena storage pool]] (Covers both implementing an allocator, and using it to allocate physical memory... Do the first part perhaps.)
* [[Sorting algorithms/Comb sort]]▼
* [[Sorting algorithms/Pancake sort]]▼
* [[Sorting algorithms/Radix sort]]▼
* [[Sorting algorithms/Stooge sort]]▼
==GUI==
* [[GUI component interaction]]▼
* [[GUI enabling/disabling of controls]]▼
* [[Keyboard macros]]
* [[Mouse position]]
Line 38 ⟶ 52:
* [[Simulate input/Keyboard]]
* [[Simulate input/Mouse]]
==User interaction (unspecified type)==
* [[Guess the number]]▼
* [[Guess the number/With feedback]]▼
* [[Guess the number/With feedback (player)]]▼
==Graphics==
* [[Brownian tree]]
* [[Constrained random points on a circle]]▼
* [[Dragon curve]]
* [[Fractal tree]]▼
* [[Plot coordinate pairs]]
* [[Image noise]]▼
▲* [[Constrained random points on a circle]]
===Using [[Basic bitmap storage]]===
* [[Bitmap/Bézier curves/Cubic]]
Line 56 ⟶ 77:
* [[Bitmap/Read an image through a pipe]]
* [[Xiaolin Wu's line algorithm]]
===Other pixel processing===
* [[Hough transform]]▼
==Mathematics==
Line 62 ⟶ 86:
* [[Deconvolution/1D]]
* [[Deconvolution/2D+]]
* [[Hofstadter-Conway $10,000 sequence]]▼
===Integers===
* [[Factors of an integer]]
Line 77 ⟶ 102:
* [[Verify distribution uniformity/Naive]]
* [[Verify distribution uniformity/Chi-squared test]]
==Operating system interfaces==
* [[Globally replace text in several files]]▼
* [[Hello world/Line printer]]▼
==Small projects==
* [[24 game]]
* [[
* [[Four bit adder]]▼
* [[Horizontal sundial calculations]]▼
* [[Inverted index]]▼
==Large projects==
Line 90 ⟶ 122:
* [[Execute a Markov algorithm]]
* [[Execute SNUSP]]
* [[Go Fish]]▼
* [[Huffman coding]]
* [[LZW compression]]
Line 150 ⟶ 183:
* [[Date manipulation]]
* [[Date format]]
* [[Discordian date]]
* [[Five weekends]]▼
* [[Holidays related to Easter]]▼
===Stream IO===
Line 229 ⟶ 265:
Insert new tasks here.
<!--INSERT-->
▲* [[Find common directory path]]
▲* [[Find the missing permutation]]
▲* [[Five weekends]]
▲* [[Flow-control structures]]
▲* [[Four bit adder]]
▲* [[Fractal tree]]
▲* [[GUI component interaction]]
▲* [[GUI enabling/disabling of controls]]
▲* [[Globally replace text in several files]]
▲* [[Go Fish]]
▲* [[Guess the number]]
▲* [[Guess the number/With feedback]]
▲* [[Guess the number/With feedback (player)]]
▲* [[Hailstone sequence]]
▲* [[Hamming numbers]]
▲* [[Hello world/Line printer]]
▲* [[Hofstadter-Conway $10,000 sequence]]
▲* [[Holidays related to Easter]]
▲* [[Horizontal sundial calculations]]
▲* [[Horner's rule for polynomial evaluation]]
▲* [[Hough transform]]
▲* [[Image noise]]
▲* [[Inverted index]]
* [[Knapsack problem/0-1]]
* [[Knapsack problem/Bounded]]
Line 286 ⟶ 297:
* [[Simple quaternion type and operations]]
* [[Sort an array of composite structures]]
▲* [[Sorting algorithms/Bead sort]]
▲* [[Sorting algorithms/Comb sort]]
▲* [[Sorting algorithms/Pancake sort]]
▲* [[Sorting algorithms/Radix sort]]
▲* [[Sorting algorithms/Stooge sort]]
* [[Soundex]]
* [[Stable marriage problem]]
| |||