Oldest pages

Jump to: navigation, search

Showing below up to 50 results in range #21 to #70.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

  1. Longest common subsequence‏‎ (05:07, 31 May 2011)
  2. Minimum spanning tree‏‎ (05:43, 31 May 2011)
  3. Dijkstra's algorithm‏‎ (05:45, 31 May 2011)
  4. Prim's algorithm‏‎ (05:47, 31 May 2011)
  5. Kruskal's algorithm‏‎ (05:47, 31 May 2011)
  6. Convex hull‏‎ (05:49, 31 May 2011)
  7. Algorithm‏‎ (18:12, 28 June 2011)
  8. Sequence‏‎ (18:20, 28 June 2011)
  9. Big numbers‏‎ (20:22, 28 June 2011)
  10. Naive algorithm‏‎ (15:24, 29 June 2011)
  11. Preprocessing and postprocessing‏‎ (03:38, 21 November 2011)
  12. String‏‎ (23:56, 23 November 2011)
  13. Disjoint sets‏‎ (01:29, 11 December 2011)
  14. Greatest common divisor‏‎ (20:46, 11 December 2011)
  15. Least common multiple‏‎ (20:58, 11 December 2011)
  16. Knuth–Morris–Pratt algorithm‏‎ (22:01, 11 December 2011)
  17. Heap‏‎ (23:31, 11 December 2011)
  18. Tree‏‎ (03:22, 12 December 2011)
  19. Constant optimization‏‎ (07:22, 25 December 2011)
  20. Linked list‏‎ (02:16, 30 December 2011)
  21. Optimization‏‎ (01:34, 5 January 2012)
  22. Greedy algorithm‏‎ (00:32, 14 January 2012)
  23. Topological sort‏‎ (11:36, 25 January 2012)
  24. Ternary search‏‎ (20:30, 13 February 2012)
  25. Floating-point data type‏‎ (01:31, 14 February 2012)
  26. Recursive function‏‎ (02:05, 14 February 2012)
  27. Hidden constant factor‏‎ (08:49, 18 February 2012)
  28. Map‏‎ (18:16, 25 February 2012)
  29. Trailing zeroes in factorial‏‎ (23:07, 28 February 2012)
  30. Depth-first search‏‎ (00:28, 3 March 2012)
  31. Array‏‎ (03:08, 17 April 2012)
  32. Maximum subvector sum‏‎ (06:09, 3 May 2012)
  33. IEEE 754‏‎ (02:45, 14 May 2012)
  34. Half-open interval‏‎ (02:56, 14 May 2012)
  35. Shunting yard algorithm/foo.hs‏‎ (19:01, 31 July 2012)
  36. Pointer‏‎ (19:59, 1 August 2012)
  37. Game theory‏‎ (19:21, 3 September 2012)
  38. Asymptotic analysis‏‎ (02:12, 10 October 2012)
  39. Binomial heap‏‎ (06:16, 10 October 2012)
  40. Augmenting path‏‎ (03:01, 9 September 2013)
  41. Max-flow min-cut theorem‏‎ (03:18, 9 September 2013)
  42. Maximum flow‏‎ (03:22, 9 September 2013)
  43. Ford–Fulkerson method‏‎ (04:12, 9 September 2013)
  44. Edmonds–Karp algorithm‏‎ (04:36, 9 September 2013)
  45. Graph search‏‎ (18:00, 15 January 2014)
  46. Computational geometry‏‎ (06:14, 11 April 2014)
  47. Range minimum query‏‎ (16:46, 24 April 2014)
  48. Binary heap‏‎ (08:58, 27 July 2014)
  49. Decimal range decomposition‏‎ (15:42, 11 August 2014)
  50. Long double‏‎ (22:22, 20 August 2014)

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

Retrieved from "https://wcipeg.com/wiki/Special:AncientPages"