...olving clever manipulations of coefficients, which results in a lower time complexity than [[polynomial long division]].</cite>
V n = [1, -12, 0, -42]
...
41 KB (5,138 words) - 04:00, 29 January 2024
If this isn't feasible due to language complexity, link to external projects that achieve this task.
...with the last recompiling itself, and apart from a slightly longer startup time, no slower than the shorter command.
...
41 KB (4,271 words) - 19:38, 27 February 2024
...ine printer]] was an older-style printer which prints one line at a time to a continuous ream of paper.
lp.write("Hello World!\n")
...
46 KB (6,143 words) - 16:17, 9 December 2023
...llip; ''A''[m - 1] and ''B'' ≡ ''B''[0]… ''B''[n - 1], m < n be strings drawn from an alphabet Σ of size s, containing every disti
...as a match if ''A''[i] = ''B''[j], where 0 ≤ i < m and 0 ≤ j < n.
...
120 KB (16,073 words) - 15:17, 28 April 2024
DO WHILE=(CH,R6,LE,N) do i=1 to n
N DC H'2' n
...
69 KB (8,712 words) - 16:53, 14 March 2024
szCarriageReturn: .asciz "\n"
szMessStart: .asciz "Program 64 bits start.\n"
...
161 KB (19,899 words) - 12:16, 29 January 2024
o_("Max sum ", sum, "\n");
print [pad "subsequence:" 15 last processed "\n"]
...
120 KB (16,057 words) - 16:36, 20 April 2024
...common techniques of the riffle shuffle and overhand shuffle for ''n'' iterations.
#include <time.h>
...
97 KB (10,350 words) - 11:52, 12 November 2023
: Count how many number chains for integers 1 <= n < 100_000_000 end with a value 89.
: Count how many number chains for integers 1 <= n < 1_000_000 end with a value 89.
...
163 KB (16,789 words) - 03:24, 20 March 2024
Its asymptotic complexity is <big> [[O]](n<sup>2</sup>) </big> making it inefficient on large arrays.
* Rosetta Code: [[O]] (complexity).
...
103 KB (12,290 words) - 12:20, 8 February 2024
...s]], the number N is encoded by a function that applies its first argument N times to its second argument.
...d each successive Church numeral applies its first argument one additional time to its second argument, '''f(f(f(x)))''', '''f(f(f(f(x))))''' ... The Chur
...
142 KB (20,183 words) - 12:22, 5 March 2024
L R2,N n
BCTR R2,0 n-1
...
110 KB (12,112 words) - 11:36, 8 February 2024
...does not allow duplicates. The complexity is O(''n'') on average, and O(''n''<sup>2</sup>) worst case. This approach requires a hash function for your
...e elements. The complexity of the best sorting algorithms is O(''n'' log ''n''). This approach requires that your type be "comparable", i.e., have an or
...
156 KB (20,444 words) - 11:36, 2 February 2024
...bsp; <big>'''n'''</big> that are relatively prime to <big>'''n'''</big>
...n'''</big> for which the greatest common divisor <big>'''gcd(n,k)'''</big> is equal to <big>'''1'''</big>
...
147 KB (16,575 words) - 15:09, 14 February 2024
V highest_left = [0] [+] (1 .< l).map(n -> max(@tower[0 .< n]))
V highest_right = (1 .< l).map(n -> max(@tower[n .< @l])) [+] [0]
...
149 KB (16,503 words) - 17:37, 19 February 2024
r ‘’= I i == m.len - 1 {‘]’} E "\n"
print("\n")
...
145 KB (17,036 words) - 16:40, 20 November 2023
..., accept a single argument which is itself a list of lists, and return the n-ary product of those lists.
Use your [[wp:Cartesian_product#Finite_n-ary_product|n-ary Cartesian product]] function to show the following products:
...
158 KB (15,445 words) - 18:54, 1 May 2024
V cArr = [‘n’, ‘o’, ‘n’, ‘z’, ‘e’, ‘r’, ‘o’, ‘s’, ‘u’, ‘m’]
[e, m, n, n, o, o, r, s, u, z]
...
220 KB (25,799 words) - 12:08, 8 February 2024
-- Updated each time a function is called with a new source
Algorithium Performance "about" O(n**2)...
...
260 KB (35,090 words) - 11:31, 18 May 2024
<syntaxhighlight lang="applescript">on exponentiationOperatorTask(n, power)
set operatorResult to (n ^ power)
...
117 KB (14,600 words) - 17:08, 28 December 2023