OT: Finished my Master's today!!!
#23
sweet...im sure you'll like c++...it's pretty crazy..im just a 'c' guy at heart, but a friend of mine is in college for computer science and he is doing c++...he's taught me some pretty neat tricks that are known by very few people...I guess his class is pretty tough and most fail...
#24
Ut oh, Hope I can pass it then [img]i/expressions/face-icon-small-smile.gif[/img] Na imma pass that class if I have to study even on the weekend hah which I know im going to have to probably, hate studying on weekends!!
#25
if I remember right..they talk about inheritense, binary search tree's, and a lot of other stuff..havent talked to em in awhile...the binary search tree is one of the coolest search algorithms Ive ever seen
#26
Tell you the truth man, I have never heard of any of that lol. I programmed in Visual Basic 3.0 a lil bit and Qbasic about 2 years ago, and thats all the programming I have done. So im new at this.
#27
if you do VB you will not hear about it...the binary search tree is not hard to understand at all...it's just a real clever way to sor data and then search for it really quickly...like:
we all know in C and VB if we make an array of say 100 and have data in each part of the array...and we need to find something...we will have to go thru each one by itself..0 - 99 of the array ot until we find what we're looking for...but a binary search tree is different because it uses a greater than or less than tree in memory that's so effecient that if you have a tree of 1,000,000 entries that maximum memory jumps it will take to find what it's looking for is 20
it would be easier to draw a simple diagram on paper and show it to you...but as you learn c++, you'll see how powerful it is...and it's a lot of fun to do and a pretty straight forward language
we all know in C and VB if we make an array of say 100 and have data in each part of the array...and we need to find something...we will have to go thru each one by itself..0 - 99 of the array ot until we find what we're looking for...but a binary search tree is different because it uses a greater than or less than tree in memory that's so effecient that if you have a tree of 1,000,000 entries that maximum memory jumps it will take to find what it's looking for is 20
it would be easier to draw a simple diagram on paper and show it to you...but as you learn c++, you'll see how powerful it is...and it's a lot of fun to do and a pretty straight forward language
#28
[img]i/expressions/face-icon-small-confused.gif[/img]my brain hurts[img]i/expressions/face-icon-small-frown.gif[/img][img]i/expressions/face-icon-small-confused.gif[/img][img]i/expressions/face-icon-small-frown.gif[/img][img]i/expressions/face-icon-small-confused.gif[/img]!!!!!!!!!!!!!!
#29
Wolverine,
The Cutlass is my daily driver - it's got about 92,000 miles. When I got it and we were going through it, it had about a million spider egg sacs and stuff all over the place from sitting in a field. One of the brakes was fused together and there was a rust line where the grass was grown up around it. However, nothing too major - it's not a show car but a nice 20 footer. Not bad for under 5,000 total including body and paint. Much more fun than a Ford Taurus or some other nondescript boring car.
The Cutlass is my daily driver - it's got about 92,000 miles. When I got it and we were going through it, it had about a million spider egg sacs and stuff all over the place from sitting in a field. One of the brakes was fused together and there was a rust line where the grass was grown up around it. However, nothing too major - it's not a show car but a nice 20 footer. Not bad for under 5,000 total including body and paint. Much more fun than a Ford Taurus or some other nondescript boring car.
#30
Gosh this over been over 25 years ago now But I had a 1967 442 Convertible, auto, navy blue with a white top.
It was a fun car and pretty quick. [img]i/expressions/face-icon-small-happy.gif[/img]
It was a fun car and pretty quick. [img]i/expressions/face-icon-small-happy.gif[/img]


