Search results
- {{#set:is contribution page=true}}If for some reason, you found this page before you found [[:Category:Solutions by ...erested in, you may [[Help:Request a new programming language|request it]] on another page. ...7 KB (930 words) - 01:52, 17 April 2024
- FOR i=y TO y+h-1 FOR i=0 TO level-1 ...135 KB (12,316 words) - 13:48, 14 May 2024
- For consistency's sake, show the date in UTC time where possible. In Ada, time is a private type and is implementation defined, for instance, on 64 bit GNAT, time is represented internally as nanoseconds relative to Jan ...42 KB (5,490 words) - 15:50, 5 February 2024
- ...<tt>'''ls'''</tt> system command (<tt>'''dir'''</tt> on Windows), or the <tt>'''pause'''</tt> system command. ...of the current application server. When running on Windows, it calls dir, for all other platforms ls. A new command is created if not existing and run. ...73 KB (9,300 words) - 12:15, 15 May 2024
- For example, the next row of the triangle would be: Behavior for <big><tt> n ≤ 0 </tt></big> does not need to be uniform, but ...176 KB (18,530 words) - 11:07, 24 January 2024
- {{task|Basic language learning}} /* for this file see task include a file in language AArch64 assembly*/ ...117 KB (17,613 words) - 16:41, 20 February 2024
- ; Even or Odd for the 6502 by barrym95838 2014.12.10 ; Thanks to sbprojects.com for a very nice assembler! ...124 KB (16,642 words) - 18:00, 1 March 2024
- For macro usage see [[360_Assembly_macros#360_Assembly_Structured_Macros|Struct FOR line IN {1..lines}: ...181 KB (17,760 words) - 22:16, 22 March 2024
- ...important in navigation, giving great-circle distances between two points on a sphere from their longitudes and latitudes. User Kaimbridge clarified on the Talk page: ...142 KB (17,780 words) - 11:01, 9 December 2023
- is appropriate or idiomatic for that language. Please add a note * [[Loops/Downward for]] ...152 KB (14,460 words) - 16:33, 3 May 2024
- For any odd '''N''', [[wp:Magic square#Method_for_constructing_a_ You should demonstrate the generator by showing at least a magic square for '''N''' = '''5'''. ...173 KB (18,488 words) - 18:18, 19 February 2024
- FOR j=0 TO m.height-1 FOR i=0 TO m.width-1 ...196 KB (24,132 words) - 17:40, 6 May 2024
- The most general case allows for complex numbers at the input ...n.wikipedia.org/wiki/Cooley–Tukey_FFT_algorithm Wikipedia] has pseudo-code for that. ...159 KB (19,443 words) - 14:22, 29 February 2024
- instruction (and only an add, not even a subtract), namely <code>dad</code> (for "double add"), Computers based on the 8080 (or processors that are backwards compatible with it, such as the ...183 KB (24,377 words) - 21:55, 17 May 2024
- ...[wp:Collatz conjecture|Collatz conjecture]] is that the hailstone sequence for any starting number always terminates. # Create a routine to generate the hailstone sequence for a number. ...317 KB (36,225 words) - 16:45, 14 March 2024
- ...any adjacent points that are also free space- this is repeated recursively for subsequent adjacent free points unless that point is marked as a mine or is ...at assumes all user input is formatted correctly''' and so checking inputs for correct form may be omitted. ...266 KB (33,387 words) - 22:46, 13 February 2024
- for Screen_X in 1 .. Width loop for Screen_Y in 1 .. Height loop ...532 KB (51,655 words) - 13:24, 20 March 2024
- ...equal to 1 or 5 modulo 6 (wheel based on 2 and 3), or similar wheels based on low primes. ...hat the sieve algorithm be the actual algorithm used to find prime numbers for the task. ...795 KB (104,384 words) - 19:34, 1 May 2024