|
QBasic
Oct 16, 2006 14:38:28 GMT
Post by Iver on Oct 16, 2006 14:38:28 GMT
|
|
|
QBasic
Oct 16, 2006 14:45:20 GMT
Post by SandStorm on Oct 16, 2006 14:45:20 GMT
Man, that is so usefull! Sometimes i miss dos
|
|
|
QBasic
Oct 17, 2006 17:26:50 GMT
Post by SandStorm on Oct 17, 2006 17:26:50 GMT
I did one little program, anyone is free to try [ Download it]
|
|
560sel
Hey mama, I can spell SIEMENS!
Posts: 134
|
QBasic
Jan 24, 2007 14:45:57 GMT
Post by 560sel on Jan 24, 2007 14:45:57 GMT
I used to write programmes in GBasic , GW-Basic and Qbasic now I'm not even interested in any programming language related to Basic ... I think that because the way I used to write programmes was fool ,
anyone here heard of structural programming ?
|
|
|
QBasic
Jan 24, 2007 20:07:24 GMT
Post by Iver on Jan 24, 2007 20:07:24 GMT
anyone here heard of structural programming ? Nope, what is it? I'm not so much into programming
|
|
560sel
Hey mama, I can spell SIEMENS!
Posts: 134
|
QBasic
Jan 25, 2007 11:39:07 GMT
Post by 560sel on Jan 25, 2007 11:39:07 GMT
well that is a kind of Scientific / Mathematical Programming which is based on probelms solving ... there are many stricted rules in structured programming , e.g. you're not allowed to use (GOTO) and (GO SUB) ... people who are involved in this kind of programming usually use a strange flow chart type called (Nassi-Shniederman) flow chart instead of the conventional flowcharts this is the conventional flowchart this is Nassi-Shniederman flowchart I don't attack this type of programming but from what I can say this is an educational programming which is based on logic and it is actually a very useful tool in solving Mathematical problems ((same as FORTRAN)) but if you want more freedom and if you aren't interested in solving scientific problems then this is not the bast way to write programms I really recommend you to use the two methods and decide which one is better for you ... so start working
|
|
DireWolf
Hey mama, I can spell SIEMENS!
--> SR-F Logo Designer <--
Robots do NOT mix up well with cats
Posts: 179
|
QBasic
Feb 13, 2007 23:58:32 GMT
Post by DireWolf on Feb 13, 2007 23:58:32 GMT
I used to use GOTO's on the ZX81, Spectrum (actually, Timex TC2068), and GW-Basic... but never used them since I migrated to QuickBASIC. The absence of line-numbers and control structures like DO-LOOP and the appearance of SUB's and FUNCTION's made GOTO's redundant.
|
|
Firmansyah
Yo! teach me hard!
www.siemensxp.com
Posts: 15
|
QBasic
Feb 14, 2007 8:56:34 GMT
Post by Firmansyah on Feb 14, 2007 8:56:34 GMT
Soory, lil bit OOT.
Any one knows b-tree algorithm??? look like the buble short algorithm.
|
|
|
QBasic
Feb 15, 2007 9:30:05 GMT
Post by Iver on Feb 15, 2007 9:30:05 GMT
Any one knows b-tree algorithm??? look like the buble short algorithm. No, I haven't heard of it I'm not so much into programming
|
|
DireWolf
Hey mama, I can spell SIEMENS!
--> SR-F Logo Designer <--
Robots do NOT mix up well with cats
Posts: 179
|
QBasic
Feb 15, 2007 17:00:26 GMT
Post by DireWolf on Feb 15, 2007 17:00:26 GMT
I know it, but it's a bit hard to explain by words... let's try. Each data element is connected to two more below it, sorted by value: if it is smaller, it clings to the left, if bigger, to the right. The first element in the tree (called the "root") has all elements smaller than it to its left, and all elements bigger to its right. When drawn in a diagram, the data elements and their connections remind of an upside-down tree, and, because each branch can only have two sub-branches (left and right), it's a binary tree. When a new element is to be inserted, a call to "INSERT (element, b_tree_root)" routine something like this is used: IF (current_location IS EMPTY) THEN INSERT_ELEMENT_HERE ELSE IF (data_at_current_location < data_to_be_inserted) THEN INSERT (element, left_of_current_location) ELSE INSERT (element, right_of_current_location) (with proper indentation, it's easier to understand: just hit "Quote" and see it how it should be)This makes the function call itself, going down branches left or right depending on the values it finds, until an empty position is found. After unsuccessfully trying to understand this blabber, you can try a more clear source.
|
|