/prog/ - ANY OF U REDDY 2 CHALLENGE ME YET?

Name: L. A. Calculus !!wKyoNUUHDOmjW7I 2013-06-20 0:33

CARN

Name: Anonymous 2013-06-20 0:38

What's your challenge?

Name: L. A. Calculus !!wKyoNUUHDOmjW7I 2013-06-20 0:40

EEEEEEEH EEEEEEEEEEEEH EEEEEEEEEEEEEEH EEEEEEEEEEEEEEEEEH
http://dis.4chan.org/read/prog/1366682174

Name: Anonymous 2013-06-20 2:13

>>3
>LE FRENCH MORON FACE

Name: Anonymous 2013-06-20 3:06

>>3
Your code <https://dis.4chan.org/read/prog/1366682174/12>; is very underwhelming for somebody who has supposedly ``READ DA STANDARD''. I mean, a linked list for a one-page program? Seriously? What's a dynamic array? Have you read the fuqin standard? The Python equivalent would be faster than your C implementation.

Name: Anonymous 2013-06-20 3:33

>>5
Have you read the fuqin standard?
MANY MORE TIMES THAN U HAVE, DATS FOR DAMN SURE. I'VE ALSO TAKEN A SHIT ON IT WAY MORE THAN U HAVE. I TOOK A SHIT ON A DRAFT, RIGHT IN FRONT OF THE C COMMITTEE, BACK BEFORE C89 WAS PUBLISHED. EVER SINCE THEN, I'VE BEEN SHITTING ON EVERY SINGLE VERSION DAT FOUND ITS WAY INTO MY HANDS.

I mean, a linked list for a one-page program? Seriously?
LOOKS LIKE WE HAVE ANOTHER CANDIDATE FOR DA /prog/ AWARD FOR RETOIDATION.

What's a dynamic array?
TRY REEDIN A BOOK YA FUCKIN RETOID.

NOW GIMMIE A CHALLENGE YA FUCKIN RETOIDS.

Name: Anonymous 2013-06-20 3:35

YOU IS NOT ANDRU

Name: L. A. Calculus !!wKyoNUUHDOmjW7I 2013-06-20 3:40

>>7
OUT OF MY THRED OR I'LL SHOVE ANDRE THE GIANT'S SKELETON UP UR SCRAWNY ANUS.

Name: Anonymous 2013-06-20 3:44

>>8
spooky scary skeletons~

Name: Anonymous 2013-06-20 3:54

>>6
Here's a challenge: rewrite your shitty little program to use a dynamic array instead of a slow-as-fuck linked list.

Name: Anonymous 2013-06-20 4:09

( ͡° ͜ʖ ͡°) le prog face

Name: Anonymous 2013-06-20 4:17

check my base >11 dubs

Name: L. A. Calculus !!wKyoNUUHDOmjW7I 2013-06-20 4:19

>>10
First explain why you believe the linked list used in that program is slow-as-fuck.

Name: Anonymous 2013-06-20 4:39

>>12
No one is interested in trivial dubs. More interestingly 12 has dubs in base 5 and base 2.

Name: Anonymous 2013-06-20 4:45

Aight, write a red black tree implementation to keep my
rgb 24 bitmap images ordered

Name: Anonymous 2013-06-20 4:53

>>15
and please, keep them ordered by the amount of cum that you can aproximate they show on girls bodies, lets say that those are usually blobs with values ranging from.

Cum:
0xff-0xdf R
0xff-0xdf G
0xff-0xdf B
With a size between (1/8)-(1/32) of the images actual W/H

Surrounded by skin:
0xed-0xdf R
0xda-0xaf G
0xda-0xaf B
and remember that girls bodies are usually petite

Name: L. A. Calculus !!wKyoNUUHDOmjW7I 2013-06-20 4:58

>>15,16
REED DA RULES YA FUCKIN RETOID: http://dis.4chan.org/read/prog/1366682174

AND TAKE UR TWISTED FANTASIES OUT OF MY FUCKIN THRED.

Name: Anonymous 2013-06-20 5:04

>>13
Do some benchmarking. Dynamic arrays are always faster than a linked list. Even if the array needs to be resized several times, the difference between O(1) and O(n) is huge. If you ever wrote anything non-trivial with linked lists you'd know that. For something like a video game or GUI where the bottleneck is blitting to the screen, it doesn't matter much, but for a low-level program or a trivial script, a linked list just says ``I can't into memory management and pointer safety''. Plus arrays are primitive, lists are not. They're even simpler to use if you understand them and know how to use them safely. Read the fuqin standard.

Name: Anonymous 2013-06-20 5:08

>>16
I won't write an implementation myself but i'll build yours and test it on said group of images and report results if it's decent.

Make it that receives as single argument a string for directory and applies the algorithm to every *.bmp file.

File structure as: 1st word for W, 2nd word for H, 24b pixels.
Words unsigned btw.

How you display results is up to you but if you're fine with the terminal I'll redirect it a textfile.

Also don't use libraries other than the
standard and avoid obfuscated code, I won't carefully check for weird things and with that I mean
that as soon as I see a clusterfuck of something I'll stop trying very fast, so apply yourself.

Name: Anonymous 2013-06-20 5:16

>>17
I'll do my part adjusting the files for the test, is up to you to make the code shine and sort properly "Koishis_first_load" so it doesn't appear near "mum_in_weddingdress"

I thought you wanted a challenge, here you have one.
Show me something decent and I'll consider actually engaging in e-peen competitions.

Name: L. A. C. !!wKyoNUUHDOmjW7I 2013-06-20 5:20

>>18
Even if the array needs to be resized several times, the difference between O(1) and O(n) is huge.
TELL ME, WHAT DA FUCK ARE DESE GROWTH RATES MEANT TO REPRESENT?

Name: Anonymous 2013-06-20 5:22

>>20
HOW MANY ILLITERATE RETOIDS VISIT DIS BOARD?

Name: Anonymous 2013-06-20 5:30

>>22
There are only three people on /prog/.

Name: Anonymous 2013-06-20 5:34

>>23
You, me, and le Sussman. XDDD

Name: Anonymous 2013-06-20 5:38

>>18
Most often you walk across the whole list instead of random access you faglord.

Name: L. A. Calculus !!wKyoNUUHDOmjW7I 2013-06-20 5:54

>>25
I'LL ASSUME U MEANT TO REFERENCE MY POST.

ANYWAY, NOW UR BEING A BIT LESS VAGUE. OKAY, LET'S ANALYSE MY PROGRAM A BIT, SHALL WE? WE'LL TAKE A LOOK AT DA VARIOUS OPERATIONS WE DO ON DESE LINKED LISTS. WE'LL LOOK AT DIS LINK: http://ideone.com/S9BEkQ

OK, THE OPERATION WE SEE ON LINE 35 IS AN INSERTION OPERATION. WE INSERT TO DA FRONT OF DA LIST. PRETTY FUCKIN COOL. LOOKS LIKE DAT HAS A GROWTH RATE OF O(1). PRETTY FUCKIN SNAZZY HUH?

OK, THE NEXT OPERATION, ON LINE 39, IS A TRAVERSAL. O(n), BUT DATS DA SAME AS IT IS FOR AN ARRAY. U EVER SEE ANYONE TRAVERSE AN ARRAY IN UNDER O(n)? I HAVEN'T. GOTTA BE FUCKIN SUPERMAN TO DO DAT SHIT, RIGHT?

GOT A PROBLEM WITH O(1) INSERTION? GOT A PROBLEM WITH O(n) TRAVERSAL? DON'T THINK SO. SO WATS UR NEXT COMPLAINT ABOUT LINKED LISTS, YA RETOID?

Name: Anonymous 2013-06-20 5:57

>>26
NO, SCRATCH DAT. WATS UR NEXT COMPLAINT ABOUT LINKED LISTS IN MY FUCKING PROGRAM.

Name: Anonymous 2013-06-20 6:01

>>26
I am offended by your pejorative usage of the word "retard".

Name: Anonymous 2013-06-20 6:06

>>28
WHERE DID I USE DAT WORD, YA FUCKIN RETOID? HARH?

Name: Anonymous 2013-06-20 6:20

CARN, >>25. CARN, >>28. TYPE SOME LETTERS.

Name: Anonymous 2013-06-20 6:27

dear LAC~kun.
Theoretical challenge.

It's a regular Saturday at your family's home and your dad is fucking the dog in the ass while the dog does the same with ur mum who also fucks you using your dad strap on^{^{25cm PINK RUBBER Salvaje[/u]}} symbolizing a linked list, could you tell me where should you put ur 3inches to make said linked give the impression it's infinite as we iterate it?

1) Can you write a function
void print_linked_dick(linked_list_node *node, void *wildcard);//Use wildcard as you wish without modifying the list
such that it can iterate through every element, print it and determine if we're looping to exit?

2) Can you do it recursively without the wildcard?

3) And recursively without the wildcard AND without modifying the list?

Name: L. A. Calculus !!wKyoNUUHDOmjW7I 2013-06-20 6:35

>>31
HAHAHAHAHAHAHHHAHAHAHHAHAHAA
I'M NOT ACCEPTING A CHALLENGE AS SHITTY AS THAT (REED DA RULES YA RETOID), BUT UR POST WINS A PAGE IN MY FUCKING JOKE BOOK.

Name: L. A. Calculus !!wKyoNUUHDOmjW7I 2013-06-20 6:43

>>31
O YEA, AND TO ANSWER UR QUESTION, LOOK NO FURTHER THAN DA OUROBOROS. WILLY GOES IN PAPA'S ASS.

Name: !!YtwzkeoLMFQUgZv 2013-06-20 7:57

Challenge:
Write a program that reads a left-to-right text and outputs top-to-bottom.
For example, having read this post up to this point, it would output:



F

Wo

rr

i

te

ex

 a

am

 p

pl

re

o,

g

rh

aa

mv

 i

tn

hg

a

tr

 e

ra

ed

a

dt

sh

 i

as



lp

eo

fs

tt

-

tu

op

-

rt

io

g

ht

th

 i

ts

e

xp

to

 i

an

nt

d,



oi

ut

t

pw

uo

tu

sl

 d

t

oo

pu

-t

tp

ou

-t

b:

o

t

t

o

m

.

Challenge accepted?

Name: Anonymous 2013-06-20 7:59

>>34
The output is correct except the first `F' was supposed to be ` F'. I did not copy it correctly.

Name: Anonymous 2013-06-20 8:06

>>34,35

Name: Anonymous 2013-06-20 9:08

>>34
Collect lines as rows of matrix L, read out rows of L^T

Name: !!YtwzkeoLMFQUgZv 2013-06-20 9:19

>>37

Inefficient.

I am challenging Calculus but I'd like you to participate as well. The best solution wins. Yes, L^T is a solution, but if that is what you are going to post, it will not win. Memory, time, true LOC. An obscure solution may also be the winner. Ι did not mention this in my original post because I thought it'd be fucking obvious.

Name: !!YtwzkeoLMFQUgZv 2013-06-20 9:28

>>38
more guidelines:
bugs automatically disqualify the solution, and you don't get a second chance, there should be no memory limitation as to how much can be read from input or minus points, unless of course the cleverness of the solution depends on the finiteness of the buffer used. Also minus points for everything that could be written in a standard manner and is not. I will be the only and final judge, but you are free to make remarks and/or discredit me.

Name: Anonymous 2013-06-20 9:33

>>38
I can see memory being an issue, but it should be rather fast to read out [j i] after you have stored all [i j]. Anyway another way I came up with quick is storing up pointers to the starts of each line and building up lines by traversing one character of each line, defaulting to ' ' once a line has been exhausted.

ANY OF U REDDY 2 CHALLENGE ME YET?

1 Name: L. A. Calculus !!wKyoNUUHDOmjW7I 2013-06-20 0:33

2 Name: Anonymous 2013-06-20 0:38

3 Name: L. A. Calculus !!wKyoNUUHDOmjW7I 2013-06-20 0:40

4 Name: Anonymous 2013-06-20 2:13

5 Name: Anonymous 2013-06-20 3:06

6 Name: Anonymous 2013-06-20 3:33

7 Name: Anonymous 2013-06-20 3:35

8 Name: L. A. Calculus !!wKyoNUUHDOmjW7I 2013-06-20 3:40

9 Name: Anonymous 2013-06-20 3:44

10 Name: Anonymous 2013-06-20 3:54

11 Name: Anonymous 2013-06-20 4:09

12 Name: Anonymous 2013-06-20 4:17

13 Name: L. A. Calculus !!wKyoNUUHDOmjW7I 2013-06-20 4:19

14 Name: Anonymous 2013-06-20 4:39

15 Name: Anonymous 2013-06-20 4:45

16 Name: Anonymous 2013-06-20 4:53

17 Name: L. A. Calculus !!wKyoNUUHDOmjW7I 2013-06-20 4:58

18 Name: Anonymous 2013-06-20 5:04

19 Name: Anonymous 2013-06-20 5:08

20 Name: Anonymous 2013-06-20 5:16

21 Name: L. A. C. !!wKyoNUUHDOmjW7I 2013-06-20 5:20

22 Name: Anonymous 2013-06-20 5:22

23 Name: Anonymous 2013-06-20 5:30

24 Name: Anonymous 2013-06-20 5:34

25 Name: Anonymous 2013-06-20 5:38

26 Name: L. A. Calculus !!wKyoNUUHDOmjW7I 2013-06-20 5:54

27 Name: Anonymous 2013-06-20 5:57

28 Name: Anonymous 2013-06-20 6:01

29 Name: Anonymous 2013-06-20 6:06

30 Name: Anonymous 2013-06-20 6:20

31 Name: Anonymous 2013-06-20 6:27

32 Name: L. A. Calculus !!wKyoNUUHDOmjW7I 2013-06-20 6:35

33 Name: L. A. Calculus !!wKyoNUUHDOmjW7I 2013-06-20 6:43

34 Name: !!YtwzkeoLMFQUgZv 2013-06-20 7:57

35 Name: Anonymous 2013-06-20 7:59

36 Name: Anonymous 2013-06-20 8:06

37 Name: Anonymous 2013-06-20 9:08

38 Name: !!YtwzkeoLMFQUgZv 2013-06-20 9:19

39 Name: !!YtwzkeoLMFQUgZv 2013-06-20 9:28

40 Name: Anonymous 2013-06-20 9:33