{{task|Classic CS problems and programs}}
...
12 KB (1,765 words) - 11:44, 24 May 2024
{{draft task|Classic CS problems and programs}}
...
41 KB (5,138 words) - 04:00, 29 January 2024
[[Category:Classic CS problems and programs]]
The '''[[wp:Sudan function|Sudan function]]''' is a classic example of a recursive function, notable especially because it is not a [[w
...
55 KB (6,473 words) - 18:29, 1 April 2024
{{draft task|Classic CS problems}}
...
75 KB (9,010 words) - 00:08, 2 February 2024
#cs
Everything between the cs and and the ce is commented.
...
132 KB (18,533 words) - 19:19, 23 May 2024
[[Category:Classic CS problems and programs]]
...
83 KB (8,723 words) - 10:17, 17 December 2023
...dia]]{{draft task|Data Structures}}{{data structure}}[[Category:Classic CS problems and programs]]
This classic REXX version uses (mostly) the same "input" and operations as the ooRexx ve
...
121 KB (14,768 words) - 11:15, 16 February 2024
{{task|Classic CS problems and programs}}
...
64 KB (8,330 words) - 13:15, 28 April 2024
{{draft task|Classic CS problems and programs}}
...
71 KB (8,110 words) - 22:52, 13 February 2024
{{task|Classic CS problems and programs}}
[http://www.cs.arizona.edu/icon/library/src/procs/printf.icn printf.icn provides formattin
...
134 KB (8,675 words) - 20:47, 29 March 2024
[[Category:Classic CS problems and programs]]
...code awareness depends on APL interpreter; NARS2000 has no support for it. Classic case conversion means lookup up the letters in an alphabet of UppercaseLowe
...
184 KB (24,118 words) - 05:47, 10 May 2024
REAL lg,ca,ki,gr,mo,kh,da,al,ab,cs
ValR("4.4",ab) ValR("3.98",cs)
...
137 KB (16,954 words) - 20:47, 4 April 2024
[[Category:Classic CS problems and programs]]
...ning a 'flag set' data structure (which is hopefully also useful for other problems), which allows us to express the checkpoint algorithm straightforwardly whi
...
119 KB (15,427 words) - 12:09, 17 November 2023
{{task|Classic CS problems and programs}}
...thing. So, classes are used to simulate the closures. Also (5)()-->5 so no problems there.
...
127 KB (18,020 words) - 17:15, 4 February 2024
{{task|Classic CS problems and programs}}
...
172 KB (20,663 words) - 11:20, 18 May 2024
In general, 8-bit math is not good enough for numerical problems, but in this particular case,
let sqr x = x*x // Classic square definition
...
171 KB (21,475 words) - 21:06, 17 March 2024
{{task|Classic CS problems and programs}}{{Wikipedia}}
...
123 KB (15,499 words) - 09:25, 29 January 2024
{{task|Classic CS problems and programs}}
...
102 KB (12,882 words) - 09:55, 24 April 2024
{{task|Classic CS problems and programs}}
Classic dumb search algorithm:
...
239 KB (26,163 words) - 11:35, 12 December 2023
# classic version while avoiding duplicate generation
hammings-classic (+1) : (foldr u empty ((+2) : ((+3) : {}(+5))))
...
496 KB (65,987 words) - 17:50, 20 April 2024
