Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon.

Pages: 1-

hahaha oh wow

Name: Anonymous 2007-10-15 23:21

finally after a week of hard work, my implementation of a binary search tree is complete and working! well, except for duplicate nodes... the nodeDeletion method will probably crash the program

I AM SO FUCKING HAPPY!! I WISH I COULD SAVE THIS FEELING AND FEEL IT WHENEVER I FEEL DEPRESSED SINCE I HAVE NO SOCIAL LIFE

Name: Anonymous 2007-10-15 23:24

implementing a BST took you a fucking week?

GET OUT

Name: Anonymous 2007-10-15 23:29

>>2

well i have no friends, its a given i'm stupid. i had a week to implement a BST, a B* and B tree and a red-black tree, and i only managed to implement a BST. i know i fucking fail, but i though i wouldnt be capable of doing even the BST, so this is quite an accomplishment for me

Name: Anonymous 2007-10-15 23:37

I wrote a prolog interpreter in python, using monads, in the last two days.

Name: Anonymous 2007-10-15 23:37

this is quite an accomplishment for me

That is just a testament to your absolute failure.

Name: Anonymous 2007-10-15 23:41

OP here
i think my feelings of happiness are vanishing
well, it was good while it lasted

Name: Anonymous 2007-10-15 23:59

you guys are jerks

Name: Anonymous 2007-10-16 0:16

A few months ago i made a hash table for the first time in C++, it was happy time for me too.

Now when i look at the code i realize its shit. Also I now know about #include <map.h>

Name: Anonymous 2007-10-16 0:39

>>1
You will never understand trees, although they will prove a useful place to hang yourself.

Name: Anonymous 2007-10-16 3:14

| well i have no friends
It would've taken you even longer if you had.

Name: Anonymous 2007-10-16 3:25

>>8
#include <map.h>
#include <map>

Name: Anonymous 2007-10-16 3:51

finally after a month of hard work, my implementation of a singly-linked list is complete and working! well, except for final nodes... the nodeDeletion method will probably crash the program

Name: Anonymous 2007-10-16 10:23

I implemented a British Standard Time in 2 daysM

Name: Anonymous 2007-10-16 11:33

finally after a year of hard work, my implementation of a "Hello, World!" application is complete! well, except for the final endl;... the newline will probably crash the program

Name: Anonymous 2007-10-16 12:46

finally after a decade of hard work, my team for an Enterprise project is complete and working! well, except for final product... the crunch will probably crash the project

Name: Anonymous 2007-10-16 14:27

>>1
Heh. Don't listen to the trolls, I remember implementing my first binary search tree being fucking hard. You deserve your sense of accomplishment - even if the code will look like shit when you look at it again in a few months. (In retrospect, the main reason that it was so hard was that my teacher was the worst teacher ever and unable to clearly answer the simplest questions, but whatever.)

Name: Anonymous 2007-10-16 18:16

>>16

OP here
actually my teacher doesn't teaches anything. he show up and gives us assignments. we have to learn stuff by ourselves. all i know about binary search trees was what i found on the internet

Name: Anonymous 2007-10-16 20:02

EXPERT PROGRAMMERS DON'T NEED NO FUQIN' DATA STRUCTURES! GTFO STRUCTFAGS!

Name: Anonymous 2007-10-16 20:16

>>18
Here are the stages of a meme.

*1 The meme is first posted.
*2 A small number of people find it funny.
*3 The meme is copied and generally accepted.

It goes downhill here.
*4 The meme starts to become overused.
*5 The meme spreads to people unaware of it's origin, who still find it funny.
*6 The meme is used incorrectly.
*7 The meme is used on Gaiaonline and therefore dies.

We are at Stage 6 with quite a funny meme. Please don't kill it.

Name: Anonymous 2007-10-16 23:42

>>18
HELL YEAH ARRAYS OR GTFO STRUCTURES ARE FOR BITCHES

Name: Anonymous 2007-10-17 0:16

bullshit. expert programmers love data strucutures.

Name: Anonymous 2007-10-17 0:22

now you must program it in asembly
good luck

Name: Anonymous 2007-10-17 2:07

>>22
MIPS ASSEMBLY

Name: Anonymous 2007-10-17 3:37

>>21
Expert programmers don't need them, so their emotional attachment is irrelevant.

Name: Anonymous 2007-10-17 10:44

Expert programmers may either handle memory bits or octets directly, use a stack, or a hash table to get anything done.

Name: Anonymous 2007-10-17 13:44

>>23
Could be worse. RISC ISAs aren't typically that hard to deal with, especially when you can fit the entire instruction set on a half a sheet of A4  paper. And still be able to read it.

Name: Anonymous 2007-10-17 15:32

>>25
Tis true. There are certainly no data structures in brainfuck, but it is Turing complete.

Name: Anonymous 2009-02-14 10:30

>>11
Taskbar balloon tooltips are a ready replacement for program functionality. [1][2][3]

[1]Recursive Functions of Balloon Tooltips and Their Computation by the System Tray Page 23
[2]Recursive Functions of Balloon Tooltips and Their Computation - 2nd Edition: System Tray and Task Bar with Start Menu Page 57
[3]Structure and Interpretation of Balloon Tooltips Page 14

Name: Anonymous 2009-02-14 10:31

>>11
Taskbar balloon tooltips are a ready replacement for program functionality. [1][2][3]

[1]  Recursive Functions of Balloon Tooltips and Their Computation by the System Tray  Page 23
[2]  Recursive Functions of Balloon Tooltips and Their Computation - 2nd Edition: System Tray and Task Bar with Start Menu Page 57
[3]  Structure and Interpretation of Balloon Tooltips  Page 14

Name: ​​​​​​​​​​ 2010-10-21 14:01

Name: Anonymous 2010-11-25 21:47

Name: Anonymous 2011-01-31 20:19

<-- check em dubz

Name: Anonymous 2011-02-04 17:33

Don't change these.
Name: Email:
Entire Thread Thread List