I haven't been visiting Zel much if you hadn't noticed. I only saw this because of D3V.
|
+1 rep for the next D3V post I see.
Quote:
No, there's no reason for me to have to prove myself to you. I don't know you and you don't know me. To build these data structures would take thinking that I don't wish to do. So, no.
|
You wouldn't believe the number of people who think you can't do anything, and that you just boast. This would have been a chance to prove them wrong.
Thinking that you don't wish to do? Seriously? You're supposedly a programmer - the data structures I was going to give you are seven of the most basic data structures, that every programmer should be able to explain without thought! They were:
Singly Linked List, Doubly Linked List, Binary Tree, Heap, Set, Queue, AVL Tree.
You can't get much simpler! If you can't even be bothered to put the tiniest bit of thought into something so easy, then why do you even bother programming?
As a point of reference, this task took me a day to complete, and that's with hour-long breaks every few hours for a meal, or to go to the bar.
Quote:
I hate geometry just so you know. So, a big fucking no!
|
No geometry involved at all.
Depending on the field of Computing you go into, Graph Theory could be extremely useful. It's the one part of my course that I despise completely. Yeah, I know all the basic theory, but I can't apply it for shit.
Building a program that implements a lot of the theory is, and I hate to use that word again, simple. You have a set for edges, and a set for vertices. Each vertex and edge is assigned a number and a name, and the edge is assigned two vertices - the one it starts at and the one it finishes at. The actions performed compare the edges and vertices with a given edge or vertex, and return either a boolean value, or a vertex or edge.
Representing the graph in the command line is simple, too - a few tables, and a graph in which each vertex is plotted on a circle, with the edges going between them (you do this by dividing 360 by the number of vertices, to get the angles between them, and drawing the circle, stopping at every calculated angle to draw a point which you use as the vertex).
|
Maybe I lied a tiny bit about there being no geometry.
Another way to do the plotting of points is to treat the space between each vertex as a segment - by calculating the size of the arc, you could use that to work out the co-ordinates of the next vertex. |
As another point of reference, this took me about 24 hours over three days to program.
Quote:
Sounds entertaining, but why? Give me a good reason and I'll think about it.
|
For fun?
There is no reason to program something like that. Sure, you could pass it off as practice, and even say that the various components (such as communication over a network using TCP or UDP) can be lifted out and put into your personal code library for use in programs in the future, but really it's just for fun, and to see what you can do.
As I said earlier, I'm programming an ant farm. The reason? For fun. Sure, it gives me chance to practice drawing graphics to a frame, implementing algorithms for shortest paths (amongst other things), and of building a model to mirror reality (to a small degree), from which I can then take snippets of code for later use, but the real reason is for fun. I get such a buzz from taking a problem and solving it by building a program.
Quote:
I hate Java. Java can burn and die.
|
I must say I agree - I hate Java, it's just that I can't be bothered reading through a different language to see how you've done things (for that is another thing I love about programming - everyone does things in a different way. I've learnt so much by simply reading through the source code of a solution to a problem that someone else has written).
This saddens Lenny.
Quote:
At this time I have several projects going as well as I'm freelancing for people. So this stuff would clutter my work time. Don't suddenly try to bring about drama by going and writing this without a thought as to what I do in my own time. It's very annoying and I must say is unthoughtful on your part.
|
Nevermind, this amuses Lenny.
As I said in a post above - multiple projects means shit. If anything, it means that should you hit a wall whilst doing one thing, you can move onto something else.
Task #1 and #2 would have taken no time at all (I'd have given you a week to complete both, which is more than enough time). Task #3 was the big one (I'd have given you a few months to do it in).
Quote:
I bid Zelaron a good day with this thought. I've been meaning to leave for a while, and I've succeeded. Here's my big, BYE!
|
Toodles.
Quote:
Oh yeah, see my sig, it runs off a data structure I designed last year.
Multiple mounts of data can be stacked into groups.
pwi = on|2:02|NRGLG;
Like that, I just don't want to. No reason for me to, I think the status is enough.
|
Care to post the code to that data structure? I'm interested, that's all.