>>4
I have, but only because I wanted to see how big a shithole it was. The rumors are true.
Name:
Anonymous2009-02-19 2:39
/g/ -> where you go to anonymously prove that your e-penis is bigger than everybody else's.
it's even less productive than /prog/
Name:
Anonymous2009-02-19 2:54
>>8
/g/ is nothing but MS fanboys, they could get repeatedly raped in the face by a well endowed e-peen and still need to be smacked with a clue-by-four to even know what happened.
Name:
Anonymous2009-02-19 5:55
>>9
European /g/ is pretty heavy on the alternatives.
I know because, uh, a friend told me... yeah.
>>20
Explain how tail-recursive optimization is any different than iteration.
Name:
Anonymous2009-02-19 7:00
Lets take the average PHP "Developer"
HIGH AVAILABILITY PHP Framework AJAX Frontend
Time worked(min): 2880 (2 days)
One off Payment: 500
Time worked in days:0.03333
Daily Salary:15000
Yearly Salary:5475000
Guys like that are pushing up their average with lies.
Name:
Anonymous2009-02-19 7:00
>>22
One might say tail recursion is a god awful small affair
Name:
Anonymous2009-02-19 7:11
>>18
compare the speed of this with the best iterative fib you can come up with: threeFibs 0 = [1,0,1]
threeFibs 1 = [1,1,0]
threeFibs n = (\[a,b,c] [1,d,e] -> [a+b*d,b+c*d,b*d+c*e]) ((\[a,b,c] -> [a*a+b*b,b*(a+c),b*b+c*c]) . threeFibs $ div n 2) (threeFibs $ mod n 2)
fib n = threeFibs n !! 1
Name:
Anonymous2009-02-19 7:29
>>25
I compared F# and C#
The difference can be described as a god awful small affair, it really was quite negligible.
>>33 Prelude> let fibs = 1 : 1 : zipWith (+) fibs (tail fibs) in fibs !! 40000
2317995759...5359577501
(3.92 secs, 108973360 bytes)
Prelude> let twoFibs n=case n of{0->[1,0];1->[0,1];_->(\[a,b][c,d]->[a*c+b*d,b+a*d])((\[a,b]->map(b*b+)[a*a,2*a*b]).twoFibs$div n 2)$twoFibs$mod n 2} in let fib n=head$twoFibs n in fib 40002
2317995759...5359577501
(0.22 secs, 7488156 bytes)
Prelude> let twoFibs n=case n of{0->[1,0];1->[0,1];_->(\[a,b][c,d]->[a*c+b*d,b+a*d])((\[a,b]->map(b*b+)[a*a,2*a*b]).twoFibs$div n 2)$twoFibs$mod n 2} in let fib n=head$twoFibs n in fib 1000000
1207194745...6684390626
(4.63 secs, 88099104 bytes)
that's 208988 digits. lern2matrix.
>>44 is a pascal coder. >>43 is a beet toll. >>42 is a genius, EXPERT BBCODE PROGRAMMER and probably the Sussman. >>41 enjoys his fibs, along with his unemployment. >>33 owns a deceased dog.
>>50
There's even stuff programmed in COBOL that needs to be maintained. Coder maintainers get paid like crazy, because nobody learns those old languages anymore
Name:
Anonymous2009-02-19 17:15
COBOL programmers average about 120k
theres also plenty of legacy FORTRAN, but most of them have been superceded by C
Name:
Anonymous2009-02-19 17:20
Coder maintainers get paid like crazy,
Damn, that must be a nasty job, having to maintain crusty old COBOL coders.
Name:
Anonymous2009-02-19 17:29
>>1
I don't know if this has been mentioned yet but...
that website is completely fucked up. Look up COBOL. Says the salary is 79k. Last time I did COBOL I earned about 100k in 6 months. It's pretty much the average from what I've heard.
>>33
Here's how CL performs on it, generates slightly less garbage:
CL-USER> (time (fibs3 10001))
Evaluation took:
0.000 seconds of real time
0.000000 seconds of total run time (0.000000 user, 0.000000 system)
100.00% CPU
10,383,444 processor cycles
4,458,784 bytes consed
Implementation:
(defun fibs3 (n)
(labels ((rec (prev cur k n)
(if (= k n)
cur
(rec cur (+ prev cur) (1+ k) n))))
(rec 1 0 0 n)))
;;; I also have an imperative one, a parallel setf one, 2 memoized implementation of simple (doubly) recursive fibs. They perform more or less the same in speed, but the hashtable memoized one eats a bit more memory due to hashtable lookups. The one which is memoized using arrays is just as fast though, except for the memory usage as it remembers all previous fib numbers.
>>69 (defun scroll-this-shit-off-the-front-page ()
"Scroll a stupid fucking topic off the page"
(loop for each $x in xrange([1..10])
\x -> begin do |y|
$fh `open` "DIS.4CHAN.ORG".downcase!;
$fh.WriteLine(">>67", y);
$fh ! close.
end)
(format t "I scrolled that shit motherfucker"))