... is fine. Do not use DEF FN though as it seems to ...

... quicksort implementation...
[code] 1 DEF FN t()=(PEEK 23672+256*PEEK ... 1000
30 LET t1=FN t(): LET fr=1: LET ... : GO SUB 4000: LET t2=FN t()
40 GO SUB ...

... " method):

[code]10 DEF FN b$(n)=("0000" AND n ...
30 PRINT FN b$(INT (n/16));FN b$(n-16 ...

... /> [code] 5 RANDOMIZE
10 DEF FN b$()=STR$(INT (RND*2 ... n$=FN b$()+FN b$()+FN b$()+FN b$()+FN b$()+FN b$()+FN b$()+FN b$()

... it... :)

[code]10 DEF FN b$(n,d)=VAL$ "STR ... $(INT (n/d),d/2)+FN b$(n-d*INT (n ... -255): ";n
30 PRINT FN b$(INT (n/16),4 ... );FN b$(n-16*INT (n/ ...

... i: PRINT : RETURN
9000 DEF FN t()=(PEEK 23672+256*PEEK ... 5000
9030 LET t1=FN t(): LET a=1: LET ... : GO SUB 4000: LET t2=FN t()
9040 GO SUB ...

... i: PRINT : RETURN
9000 DEF FN t()=(PEEK 23672+256*PEEK ... 5000
9030 LET t1=FN t(): LET a=1: LET ... : GO SUB 4000: LET t2=FN t()
9040 GO SUB ...

[B]STEP 3 -[/B] Now let's take a look at the quicksort algorithm, since we will need to properly understand it in order to find further improvements.

The basic idea behind the quicksort algorithm can be represented by the following pseudo-code ...

[QUOTE=Dr BEEP;483699][code]
1 let b$="hello"
2 let v$="b$"
3 let a$=VAL$ v$
4 print a$
[/code][/QUOTE]

Very nice - scope for a [B]DEF FN[/B] there ?!

... i: PRINT : RETURN
9000 DEF FN t()=(PEEK 23672+256*PEEK ... 5000
9030 LET t1=FN t(): LET a=1: LET ... : GO SUB 4000: LET t2=FN t()
9040 GO SUB ...

... that's because it uses DEF FN and FN). "Mined Out", "Derby Day ... ] [INT] 1000
OP /
FN INT
OP -
OP ...

... bit long funciton):

DEF FN O(x,y)=(128 AND ... AND INT (FN V(FN V(FN V(FN V(FN V(FN V(FN V(x ... ) OR INT FN V(FN V(FN V(FN V(FN V(FN V(FN V(y ... , this is AND:

DEF FN A(x,y)=(128 AND ... AND INT FN V(FN V(FN…

... bit long funciton):

DEF FN O(x,y)=(128 AND ... AND INT (FN V(FN V(FN V(FN V(FN V(FN V(FN V(x ... ) OR INT FN V(FN V(FN V(FN V(FN V(FN V(FN V(y ... , this is AND:

DEF FN A(x,y)=(128 AND ... AND INT FN V(FN V(FN

bigjon December 2010 Sinclair Basic

... bit long funciton):

DEF FN O(x,y)=....

FN, but how, can please somebody ... are depend on another function (FN V) and that is dependant ... itself on yet another function (FN T from memory)!

... area used by user-defined FN evaluations. I'd often used ... first I tried using a DEF FN to assign the display file ... I could use LET s$=FN s$(), but I got nowhere ... was using a user-defined FN by POKEing DEFADD with an ...

...
10 DIM s$(length): DEF FN p(a)=PEEK a+256 ... +1):
DEF FN l(v)=v-256*FN h(v): DEF FN h(v ... )=INT (v/256):
LET udg=FN ...

... uses this technique with a DEF FN to handle copies from string ...

... .

[code]
10 DEF FN p(a)=PEEK a+256 ... +1):
DEF FN l(v)=v-256*FN h(v): DEF FN h(v ... )=INT (v/256)
20 DEF FN ... PEEK a>127):
DEF FN m$(a$,a,b$,b ... $(b$,b,l,1)+")":
DEF FN d$(a$,a,l,o ...

... value:

[code] 10 DEF FN D(o,n)=n-VAL ... /> For example [b]BEEP 1, FN D(4, C)[/b] would ...

... .

[code]
2 DEF FN p(a)=PEEK a+256 ... +1):
DEF FN l(v)=v-256*FN h(v): DEF FN h(v ... )=INT (v/256):
DEF FN d ... a>127)
3 DEF FN m$(a$,a,b$,b ... ,INT(l/256),1)+")":
DEF FN d$(a$,a,b,l ...

[QUOTE=murtceps;534043]there's also two < Symbols and two > Where = ended up.[/QUOTE]

Also, no CIRCLE, DRAW, DEF FN, FN, OPEN#, CLOSE#, CAT, MOVE, ERASE, FORMAT :)

... delimiter character for a DEF FN definition, telling the FN variable search routine ...

1 def fn b$(d)=val$ (("str$ d" and d1))

... /> 5 CLEAR 26000
9 DEF FN b$(n,b)=(STR$ (n ... -2^b>=0)+FN b$(n-(2^b AND ... '"a$=";
25 LET a$=FN b$(a,15): PRINT a ...

... $[/B]
[code]
1 def fn b$(d)=val$ (("str$ d ...

[code]
1 DEF FN b$(d)=VAL$ ((CHR$ 19 ...

[code]
1 DEF FN b$(d)=VAL$ ((CHR$ 19
3+"d" AND d1))
[/code]