Unoptimized C is 10 times slower then assembly
Unoptimized Java is 10 times slower then C
Unoptimized Python is 10 times slower then Java
Unoptimized Ruby is 10 times slower then Python
Unoptimized Io is 10 times slower then Ruby
Name:
Anonymous2009-03-24 4:50
Unoptimized YHBT is 10 times slower than Io
Name:
Anonymous2009-03-24 4:54
Real YHBT code:
sum :: [Int] -> Int
sum:
add rax, [rdi]
mov rdi, [rdi + 8]
or rdi, rdi
jnz sum
ret
Name:
Anonymous2009-03-24 5:03
>>1
Unoptimized Assembly is 10 times slower than VHDL
>>4
Unoptimized VHDL is 10 times slower than preprocessor macros
Name:
Anonymous2009-03-24 10:49
Unoptimized C is 10 times slower then assembly
Unoptimized Java is 10 times slower then C
Unoptimized Python is 10 times slower then Java
Unoptimized Ruby is 10 times slower then Python
Unoptimized Io is 10 times slower then Ruby
Unoptimized Lisp is 10 times slower then Io
Unoptimized assembly is 10 times slower then Lisp
Unoptimized C is 10 times slower, followed by assembly
Unoptimized Java is 10 times slower, followed by C
Unoptimized Python is 10 times slower, followed by Java
Unoptimized Ruby is 10 times slower, followed by Python
Unoptimized Io is 10 times slower, followed by Ruby
Name:
Anonymous2009-03-24 10:59
Unoptimized C is 10 times slower >> assembly
Unoptimized Java is 10 times slower >> C
Unoptimized Python is 10 times slower >> Java
Unoptimized Ruby is 10 times slower >> Python
Unoptimized Io is 10 times slower >> Ruby
Unoptimized C is 10 times slower `rShift` assembly
Unoptimized Java is 10 times slower `rShift` C
Unoptimized Python is 10 times slower `rShift` Java
Unoptimized Ruby is 10 times slower `rShift` Python
Unoptimized Io is 10 times slower `rShift` Ruby
if (Unoptimized C is 10 times slower) then assembly
if (Unoptimized Java is 10 times slower) then C
if (Unoptimized Python is 10 times slower) then Java
if (Unoptimized Ruby is 10 times slower) then Python
if (Unoptimized Io is 10 times slower) then Ruby
Cantor defined two kinds of infinite numbers: ordinal numbers and cardinal numbers. Ordinal numbers may be identified with well-ordered sets, or counting carried on to any stopping point, including points after an infinite number have already been counted.