Alphabetical Order - GameCreators Forum

Author

Message

Sinani201

19

Years of Service

User Offline

Joined: 16th Apr 2007

Location: Aperture Science Enrichment Center

Posted: 2nd Jan 2009 19:10 Edited at: 2nd Jan 2009 19:11

Link

Does anyone know how to sort strings into alphabetical order? I think I saw TDK put up a code snippet some other time, but when I did a search, all I got were DBPro snippets.

So... ummm... can someone help me? Thanks.

"I reveal my trap card, GEORGE DUBYA BUSH!
America loses 2000 Life Points! America loses." -Deucalion2

Back to top

Profile PM

Ashingda 27

18

Years of Service

User Offline

Joined: 15th Feb 2008

Location:

Posted: 2nd Jan 2009 19:56 Edited at: 2nd Jan 2009 19:58

Link

This example was taken out of my FileScan Function so the vaiable names are as is.

sync on
sync rate 0

ink rgb(255,255,255),0

FileCount = 10
dim FileName$(FileCount)

REM Generating Random String
for FileLP = 0 to FileCount

CharLen = 3

for CharLP = 1 to CharLen

CharGroup = rnd(2)

REM Random 0 - 9
		if CharGroup = 0 then Char$ = chr$(48+rnd(9))
		REM Random A - Z
		if CharGroup = 1 then Char$ = chr$(65+rnd(25))
		REM Random a - z
		if CharGroup = 2 then Char$ = chr$(97+rnd(25))

FileName$(FileLP) = FileName$(FileLP) + Char$

next CharLP

text 0,FileLP*15,FileName$(FileLP)

next FileLP

REM Sort the Names
gosub SortFileNames

REM Print Back to Screen
for NameLP = 0 to FileCount

text 200,NameLP*15,FileName$(NameLP)

next NameLP

sync
wait key
END

REM *********************************************************************
REM Sort FileNames
REM *********************************************************************
SortFileNames:

REM First loop - Sort FileNames
	for lp1 = 1 to FileCount

REM Input the two FileNames, later used for swaping if needed.
		f1$ = FileName$(lp1-1)
		f2$ = FileName$(lp1)

REM Checks for longer String, used for the next loop.
		if len(f1$) > len(f2$) then lp3 = len(f1$) else lp3 = len(f2$)

REM Second Loop - Compare each Charactor
		for lp2 = 1 to lp3

REM Input single Charactor from each FileNames
			i1$ = upper$(mid$(f1$,lp2))
			i2$ = upper$(mid$(f2$,lp2))

REM Checks if the two Charactors are different
			if asc(i1$) <> asc(i2$)

REM Checks if Second file is lower than First
				if asc(i2$) < asc(i1$)

REM Swaping the FileName positions
					FileName$(lp1-1) = f2$
					FileName$(lp1) = f1$

REM Restart lp1 Loop
					lp1 = 0

endif

REM Break out of lp2 loop
				lp2 = lp3

endif
		next lp2

next lp1

return

+ Code Snippet

sync on
sync rate 0

ink rgb(255,255,255),0

FileCount = 10
dim FileName$(FileCount)

REM Generating Random String
for FileLP = 0 to FileCount

	CharLen = 3

	for CharLP = 1 to CharLen

		CharGroup = rnd(2)

		REM Random 0 - 9
		if CharGroup = 0 then Char$ = chr$(48+rnd(9))
		REM Random A - Z
		if CharGroup = 1 then Char$ = chr$(65+rnd(25))
		REM Random a - z
		if CharGroup = 2 then Char$ = chr$(97+rnd(25))

		FileName$(FileLP) = FileName$(FileLP) + Char$

	next CharLP

	text 0,FileLP*15,FileName$(FileLP)

next FileLP




REM Sort the Names
gosub SortFileNames

REM Print Back to Screen
for NameLP = 0 to FileCount

	text 200,NameLP*15,FileName$(NameLP)

next NameLP


sync
wait key
END


REM *********************************************************************
REM Sort FileNames
REM *********************************************************************
SortFileNames:

	REM First loop - Sort FileNames
	for lp1 = 1 to FileCount

		REM Input the two FileNames, later used for swaping if needed.
		f1$ = FileName$(lp1-1)
		f2$ = FileName$(lp1)

		REM Checks for longer String, used for the next loop.
		if len(f1$) > len(f2$) then lp3 = len(f1$) else lp3 = len(f2$)

		REM Second Loop - Compare each Charactor
		for lp2 = 1 to lp3

			REM Input single Charactor from each FileNames
			i1$ = upper$(mid$(f1$,lp2))
			i2$ = upper$(mid$(f2$,lp2))

			REM Checks if the two Charactors are different
			if asc(i1$) <> asc(i2$)

				REM Checks if Second file is lower than First
				if asc(i2$) < asc(i1$)

					REM Swaping the FileName positions
					FileName$(lp1-1) = f2$
					FileName$(lp1) = f1$

					REM Restart lp1 Loop
					lp1 = 0

				endif

				REM Break out of lp2 loop
				lp2 = lp3

			endif
		next lp2

	next lp1

return

You can manually place in a string name instead of using that Generating Random String loop.

The SortFileNames subroutine will check through each filename in the list two at a time and check each string characters. If the 2nd filename which is further down the list has a lower ascii value, the two filenames swaps places. If any filenames are changed within the loop, the loop is forced to start over from the beginning until the loop runs through without having to swap any filenames in the list.

Back to top

Profile PM Email

Latch

19

Years of Service

User Offline

Joined: 23rd Jul 2006

Location:

Posted: 3rd Jan 2009 01:15 Edited at: 3rd Jan 2009 01:15

Link

a couple of tips:

Look up Select Sort on the internet. Much faster and efficient than a bubble sort.

Also, you can compare whole strings without looping through individual characters:

+ Code Snippet

a$="darkBasic"
b$="VBasic"

print a$=b$
print a$<b$
print a$>b$

This compares the entire strings by ascii values. So you don't get strings with capitals sorting before lowercase, like Ashingda demonstrated, use upper$()

+ Code Snippet

a$=upper$("darkBasic")
b$=upper$("VBasic")

print a$=b$
print a$<b$
print a$>b$

Enjoy your day.

Back to top

Profile PM

Ashingda 27

18

Years of Service

User Offline

Joined: 15th Feb 2008

Location:

Posted: 3rd Jan 2009 01:41

Link

Quote: "Also, you can compare whole strings without looping through individual characters:"

You're kidding... This is awsome! You the bomb Latch!

Back to top

Profile PM Email

Ashingda 27

18

Years of Service

User Offline

Joined: 15th Feb 2008

Location:

Posted: 3rd Jan 2009 05:40 Edited at: 3rd Jan 2009 08:24

Link

Ok I updated my bubble sort and tested it's speed against a select sort and there's a Super Large difference. BTW, my old bubble was horribly slow!

[edit]

hmm.. I'm trying to get a comb sort to work but it's not working right.

Ok got Comb Sort working and ready for testing.

I added Insertion sort, I dont know if I did it totally correct but it seems to work. So far SelectSort is the fastest one.

sync on
sync rate 0

ink rgb(255,255,255),0

FileCount = 255
dim GenName$(FileCount)
dim FileName$(FileCount)

REM Generating Random String
for FileLP = 0 to FileCount
	CharLen = 3
	for CharLP = 1 to CharLen
		CharGroup = rnd(100)
		REM Random 0 - 9
		if CharGroup < 100 then Char$ = chr$(48+rnd(9))
		REM Random A - Z
		if CharGroup < 90 then Char$ = chr$(65+rnd(25))
		GenName$(FileLP) = GenName$(FileLP) + Char$
		FileName$(FileLP) = GenName$(FileLP)
	next CharLP
next FileLP

REM Used for Testing New Sorts
`gosub ShowName
`sync
`FileName$(0) = "61"
`FileName$(1) = "52"
`FileName$(2) = "43"
`FileName$(3) = "34"
`FileName$(4) = "25"
`FileName$(5) = "16"
`gosub InsertionSort
`gosub ShowName
`sync
`END

do
	cls

print "1 = BubbleSort"
	print "2 = SelectSort"
	print "3 = CombSort"
	print "4 = InsertionSort"
	print
	print "Sorting "+str$(FileCount)+" FileNames"
	print
	print "Time Test: " + str$(t2-t1)

repeat
		i$ = inkey$()
		sync
	until i$ > ""

t1 = timer()

if i$ = "1" then gosub BubbleSort
	if i$ = "2" then gosub SelectSort
	if i$ = "3" then gosub CombSort
	if i$ = "4" then gosub InsertionSort

t2 = timer()

gosub ResetNames

sync

loop

REM *********************************************************************
REM ResetNames
REM *********************************************************************
ResetNames:
	for NameLP = 0 to FileCount
		FileName$(NameLP) = GenName$(NameLP)
	next NameLP
return

REM *********************************************************************
REM ShowNames
REM *********************************************************************
ShowName:
	y = 0
	x = 0
	for NameLP = 0 to FileCount
		y = y + 1
		if y > 30 then y = -1 : x = x + 1
		text x*50,y*15,FileName$(NameLP)
	next NameLP
return

REM *********************************************************************
REM Insertion Sort
REM *********************************************************************
InsertionSort:

for SortLP = 1 to FileCount

Insert$ = FileName$(SortLP)
		i = SortLP - 1

while i => 0

if upper$(FileName$(i)) > upper$(Insert$)
				FileName$(i + 1) = FileName$(i)
				FileName$(i) = Insert$
			endif

i = i - 1

endwhile

next SortLP

return

REM *********************************************************************
REM Comb Sort
REM *********************************************************************
CombSort:
	gap = FileCount
    
	repeat

REM update the gap value for a next comb
		if gap > 1
			gap = gap / 1.3
			if gap = 10 or gap = 9
				gap = 11
			endif
		endif

i = 0
		swaps = 0

repeat

if upper$(FileName$(i)) > upper$(FileName$(i+gap))

REM Swap
			   buffer$ = FileName$(i)
				FileName$(i) = FileName$(i+gap)
				FileName$(i+gap) = buffer$

swaps = 1

endif

i = i + 1

until i + gap > FileCount

sync
	until gap =< 1 and swaps = 0
return

REM *********************************************************************
REM SelectSort
REM *********************************************************************
SelectSort:

for SortLP = 0 to FileCount-2

min = SortLP

for SelectLP = (SortLP + 1) to FileCount
			if upper$(FileName$(SelectLP)) < upper$(FileName$(min))
				min = SelectLP
			endif
		next SelectLP

REM Swap
	   buffer$ = FileName$(min)
		FileName$(min) = FileName$(SortLP)
		FileName$(SortLP) = buffer$

next SortLP

return

REM *********************************************************************
REM BubbleSort
REM *********************************************************************
BubbleSort:

for BubbleLP = 1 to FileCount

if FileName$(BubbleLP) < FileName$(BubbleLP-1)

REM Swap
	   	buffer$ = FileName$(BubbleLP)
			FileName$(BubbleLP) = FileName$(BubbleLP-1)
			FileName$(BubbleLP-1) = buffer$
			BubbleLP = 0

endif

next BubbleLP

return

+ Code Snippet

sync on
sync rate 0

ink rgb(255,255,255),0

FileCount = 255
dim GenName$(FileCount)
dim FileName$(FileCount)


REM Generating Random String
for FileLP = 0 to FileCount
	CharLen = 3
	for CharLP = 1 to CharLen
		CharGroup = rnd(100)
		REM Random 0 - 9
		if CharGroup < 100 then Char$ = chr$(48+rnd(9))
		REM Random A - Z
		if CharGroup < 90 then Char$ = chr$(65+rnd(25))
		GenName$(FileLP) = GenName$(FileLP) + Char$
		FileName$(FileLP) = GenName$(FileLP)
	next CharLP
next FileLP


REM Used for Testing New Sorts
`gosub ShowName
`sync
`FileName$(0) = "61"
`FileName$(1) = "52"
`FileName$(2) = "43"
`FileName$(3) = "34"
`FileName$(4) = "25"
`FileName$(5) = "16"
`gosub InsertionSort
`gosub ShowName
`sync
`END

do
	cls

	print "1 = BubbleSort"
	print "2 = SelectSort"
	print "3 = CombSort"
	print "4 = InsertionSort"
	print
	print "Sorting "+str$(FileCount)+" FileNames"
	print
	print "Time Test: " + str$(t2-t1)

	repeat
		i$ = inkey$()
		sync
	until i$ > ""

	t1 = timer()

	if i$ = "1" then gosub BubbleSort
	if i$ = "2" then gosub SelectSort
	if i$ = "3" then gosub CombSort
	if i$ = "4" then gosub InsertionSort

	t2 = timer()

	gosub ResetNames

	sync

loop




REM *********************************************************************
REM ResetNames
REM *********************************************************************
ResetNames:
	for NameLP = 0 to FileCount
		FileName$(NameLP) = GenName$(NameLP)
	next NameLP
return


REM *********************************************************************
REM ShowNames
REM *********************************************************************
ShowName:
	y = 0
	x = 0
	for NameLP = 0 to FileCount
		y = y + 1
		if y > 30 then y = -1 : x = x + 1
		text x*50,y*15,FileName$(NameLP)
	next NameLP
return





REM *********************************************************************
REM Insertion Sort
REM *********************************************************************
InsertionSort:

	for SortLP = 1 to FileCount

		Insert$ = FileName$(SortLP)
		i = SortLP - 1

		while i => 0

			if upper$(FileName$(i)) > upper$(Insert$)
				FileName$(i + 1) = FileName$(i)
				FileName$(i) = Insert$
			endif

			i = i - 1

		endwhile


	next SortLP

return




REM *********************************************************************
REM Comb Sort
REM *********************************************************************
CombSort:
	gap = FileCount
    
	repeat

		REM update the gap value for a next comb
		if gap > 1
			gap = gap / 1.3
			if gap = 10 or gap = 9
				gap = 11
			endif
		endif

		i = 0
		swaps = 0 

		repeat 

			if upper$(FileName$(i)) > upper$(FileName$(i+gap))

				REM Swap
			   buffer$ = FileName$(i)
				FileName$(i) = FileName$(i+gap)
				FileName$(i+gap) = buffer$

				swaps = 1 

			endif

			i = i + 1

		until i + gap > FileCount

	sync
	until gap =< 1 and swaps = 0
return





REM *********************************************************************
REM SelectSort
REM *********************************************************************
SelectSort:

	for SortLP = 0 to FileCount-2

		min = SortLP

		for SelectLP = (SortLP + 1) to FileCount
			if upper$(FileName$(SelectLP)) < upper$(FileName$(min))
				min = SelectLP
			endif
		next SelectLP

		REM Swap
	   buffer$ = FileName$(min)
		FileName$(min) = FileName$(SortLP)
		FileName$(SortLP) = buffer$

	next SortLP

return



REM *********************************************************************
REM BubbleSort
REM *********************************************************************
BubbleSort:

	for BubbleLP = 1 to FileCount

		if FileName$(BubbleLP) < FileName$(BubbleLP-1)

			REM Swap
	   	buffer$ = FileName$(BubbleLP)
			FileName$(BubbleLP) = FileName$(BubbleLP-1)
			FileName$(BubbleLP-1) = buffer$
			BubbleLP = 0

		endif

	next BubbleLP

return

Quick Sort is rather tempting to try, but I don't think I'm mentally prepared for that yet. Has anyone coded a Quick Sort in DBC?
I'm looking at the pseudocode and it's carrying arrays into functions and returning it, we can't do that with DBC can we?

Back to top

Profile PM Email

Ashingda 27

18

Years of Service

User Offline

Joined: 15th Feb 2008

Location:

Posted: 3rd Jan 2009 17:26 Edited at: 3rd Jan 2009 17:35

Link

Ok I managed to make a Quick Sort, it's not as hard as I first thought. It was confusing at first cause the function would call itself, although I'm not completly new to that method I've always thought it was funny.

Quick Sort is blazing fast! I did a comparison between the different sorting algorithm I got so far, also found a speed difference amongst different machines, although not by much.

The Comb Sort is suprisingly stable.

These are the results I got from my laptop.

Random filenames 500

+ Code Snippet

Sort - Time taken to finnish sorting
Bubble Sort - 29,523
Selection Sort - 461
Comb Sort - 371
Insertion Sort - 550
Quick Sort - 21

Random filenames 1000

+ Code Snippet

Sort - Time taken to finnish sorting
Bubble Sort ---- too long
Selection Sort - 2133
Comb Sort ------ 430
Insertion Sort - 2744
Quick Sort ----- 30

Random filenames 2000

+ Code Snippet

Sort - Time taken to finnish sorting
Bubble Sort ---- too long
Selection Sort - 7401
Comb Sort ------ 471
Insertion Sort - 8743
Quick Sort ----- 80

Random filenames 3000

+ Code Snippet

Sort - Time taken to finnish sorting
Bubble Sort ---- too long
Selection Sort - too long
Comb Sort ------ 681
Insertion Sort - too long
Quick Sort ----- 130

Here's the codes.

sync on
sync rate 0
create bitmap 1,640,480

REM Set File amount here
FileCount = 3000

gosub SortSetup

REM *********************************************************************
REM Main Loop
REM *********************************************************************
do

gosub ShowName
	gosub KeysUpdate

copy bitmap 1,0
	sync

loop

REM *********************************************************************
REM SortSetup
REM *********************************************************************
SortSetup:

cls rgb(100,100,100)

dim GenName$(FileCount)
	dim FileName$(FileCount)

gosub GenName

return

REM *********************************************************************
REM GenName
REM *********************************************************************
GenName:
	REM Generating Random String
	for FileLP = 0 to FileCount
		CharLen = 3
		for CharLP = 1 to CharLen
			CharGroup = rnd(100)
			REM Random 0 - 9
			if CharGroup < 100 then Char$ = chr$(48+rnd(9))
			REM Random A - Z
			if CharGroup < 90 then Char$ = chr$(65+rnd(25))
			GenName$(FileLP) = GenName$(FileLP) + Char$
			FileName$(FileLP) = GenName$(FileLP)
		next CharLP
	next FileLP
return

REM *********************************************************************
REM KeysUpdate
REM *********************************************************************
KeysUpdate:

ink rgb(255,255,255),0
	Tsize = 10
	Ts = Tsize + Tsize/3
	set text size 10
	text 0,0*Ts,"1 = BubbleSort"
	text 0,1*Ts,"2 = SelectSort"
	text 0,2*Ts,"3 = CombSort"
	text 0,3*Ts,"4 = InsertionSort"
	text 0,4*Ts,"5 = QuickSort"
	text 0,6*Ts,"R = Reset Print"
	text 0,7*Ts,"Sorting "+str$(FileCount)+" FileNames"

i$ = inkey$()
	if i$ > ""
		cls
		gosub ResetNames
		t1 = timer()
		if i$ = "1" then gosub BubbleSort
		if i$ = "2" then gosub SelectSort
		if i$ = "3" then gosub CombSort
		if i$ = "4" then gosub InsertionSort
		if i$ = "5" then QuickSort(0,FileCount)
		if upper$(i$) = "R"
			gosub GenName
			gosub ResetNames
		endif
		t2 = timer()
		text 0,8*Ts,"Time Test: " + str$(t2-t1)
	endif

return

REM *********************************************************************
REM ResetNames
REM *********************************************************************
ResetNames:
	for NameLP = 0 to FileCount
		FileName$(NameLP) = GenName$(NameLP)
	next NameLP
return

REM *********************************************************************
REM ShowNames
REM *********************************************************************
ShowName:

ink rgb(255,255,255),0

maxX = 11
	maxY = FileCount/maxX

z = -1
	for lpy = 0 to maxY
	for lpx = 0 to maxX

z = z + 1

x = 180+lpx*35
		y = lpy*14

text x,y,FileName$(z)

if z + 1 > FileCount or y > 450
			lpx = maxX
			lpy = maxY
		endif

next lpx
	next lpy

ink rgb(50,50,50),0
	box 620,639,0,479

return

REM *********************************************************************
REM Insertion Sort
REM *********************************************************************
InsertionSort:

for SortLP = 1 to FileCount

Insert$ = FileName$(SortLP)
		i = SortLP - 1

while i => 0

if upper$(FileName$(i)) > upper$(Insert$)
				FileName$(i + 1) = FileName$(i)
				FileName$(i) = Insert$
			endif

i = i - 1

endwhile

next SortLP

return

REM *********************************************************************
REM Comb Sort
REM *********************************************************************
CombSort:
	gap = FileCount
    
	repeat

REM update the gap value for a next comb
		if gap > 1
			gap = gap / 1.3
			if gap = 10 or gap = 9
				gap = 11
			endif
		endif

i = 0
		swaps = 0

repeat

if upper$(FileName$(i)) > upper$(FileName$(i+gap))

REM Swap
				buffer$ = FileName$(i)
				FileName$(i) = FileName$(i+gap)
				FileName$(i+gap) = buffer$

swaps = 1

endif

i = i + 1

until i + gap > FileCount

sync
	until gap =< 1 and swaps = 0
return

REM *********************************************************************
REM SelectSort
REM *********************************************************************
SelectSort:

for SortLP = 0 to FileCount-2

min = SortLP

for SelectLP = (SortLP + 1) to FileCount
			if upper$(FileName$(SelectLP)) < upper$(FileName$(min))
				min = SelectLP
			endif
		next SelectLP

REM Swap
		buffer$ = FileName$(min)
		FileName$(min) = FileName$(SortLP)
		FileName$(SortLP) = buffer$

next SortLP

return

REM *********************************************************************
REM BubbleSort
REM *********************************************************************
BubbleSort:

for BubbleLP = 1 to FileCount

if FileName$(BubbleLP) < FileName$(BubbleLP-1)

REM Swap
			buffer$ = FileName$(BubbleLP)
			FileName$(BubbleLP) = FileName$(BubbleLP-1)
			FileName$(BubbleLP-1) = buffer$
			BubbleLP = 0

endif

next BubbleLP

return

REM *********************************************************************
REM Quick Sort
REM *********************************************************************
Function QuickSort(L,R)

CheckL = L
		CheckR = R
		Check$ = FileName$((L+R)/2)

repeat

REM Left Side Sort
			while FileName$(CheckL) < Check$
				CheckL = CheckL + 1
			endwhile

REM Right Side Sort
			while Check$ < FileName$(CheckR)
				CheckR = CheckR - 1
			endwhile

if CheckL <= CheckR

REM Swap
				buffer$ = FileName$(CheckL)
				FileName$(CheckL) = FileName$(CheckR)
				FileName$(CheckR) = buffer$

CheckL = CheckL + 1
				CheckR = CheckR - 1

endif

until CheckL >= CheckR
		
		REM Calling this same Function multiple times
		if L < CheckR then QuickSort(L,CheckR)
		if CheckL < R then QuickSort(CheckL,R)

EndFunction

+ Code Snippet

sync on
sync rate 0
create bitmap 1,640,480

REM Set File amount here
FileCount = 3000

gosub SortSetup


REM *********************************************************************
REM Main Loop
REM *********************************************************************
do

	gosub ShowName
	gosub KeysUpdate

	copy bitmap 1,0
	sync

loop





REM *********************************************************************
REM SortSetup
REM *********************************************************************
SortSetup:

	cls rgb(100,100,100)

	dim GenName$(FileCount)
	dim FileName$(FileCount)


	gosub GenName

return



REM *********************************************************************
REM GenName
REM *********************************************************************
GenName:
	REM Generating Random String
	for FileLP = 0 to FileCount
		CharLen = 3
		for CharLP = 1 to CharLen
			CharGroup = rnd(100)
			REM Random 0 - 9
			if CharGroup < 100 then Char$ = chr$(48+rnd(9))
			REM Random A - Z
			if CharGroup < 90 then Char$ = chr$(65+rnd(25))
			GenName$(FileLP) = GenName$(FileLP) + Char$
			FileName$(FileLP) = GenName$(FileLP)
		next CharLP
	next FileLP
return





REM *********************************************************************
REM KeysUpdate
REM *********************************************************************
KeysUpdate:

	ink rgb(255,255,255),0
	Tsize = 10
	Ts = Tsize + Tsize/3
	set text size 10
	text 0,0*Ts,"1 = BubbleSort"
	text 0,1*Ts,"2 = SelectSort"
	text 0,2*Ts,"3 = CombSort"
	text 0,3*Ts,"4 = InsertionSort"
	text 0,4*Ts,"5 = QuickSort"
	text 0,6*Ts,"R = Reset Print"
	text 0,7*Ts,"Sorting "+str$(FileCount)+" FileNames"




	


	i$ = inkey$()
	if i$ > ""
		cls
		gosub ResetNames
		t1 = timer()
		if i$ = "1" then gosub BubbleSort
		if i$ = "2" then gosub SelectSort
		if i$ = "3" then gosub CombSort
		if i$ = "4" then gosub InsertionSort
		if i$ = "5" then QuickSort(0,FileCount)
		if upper$(i$) = "R"
			gosub GenName
			gosub ResetNames
		endif
		t2 = timer()
		text 0,8*Ts,"Time Test: " + str$(t2-t1)
	endif



return





REM *********************************************************************
REM ResetNames
REM *********************************************************************
ResetNames:
	for NameLP = 0 to FileCount
		FileName$(NameLP) = GenName$(NameLP)
	next NameLP
return





REM *********************************************************************
REM ShowNames
REM *********************************************************************
ShowName:

	ink rgb(255,255,255),0

	maxX = 11
	maxY = FileCount/maxX

	z = -1
	for lpy = 0 to maxY
	for lpx = 0 to maxX

		z = z + 1

		x = 180+lpx*35
		y = lpy*14

		text x,y,FileName$(z)

		if z + 1 > FileCount or y > 450
			lpx = maxX
			lpy = maxY
		endif

	next lpx
	next lpy


	ink rgb(50,50,50),0
	box 620,639,0,479

return





REM *********************************************************************
REM Insertion Sort
REM *********************************************************************
InsertionSort:

	for SortLP = 1 to FileCount

		Insert$ = FileName$(SortLP)
		i = SortLP - 1

		while i => 0

			if upper$(FileName$(i)) > upper$(Insert$)
				FileName$(i + 1) = FileName$(i)
				FileName$(i) = Insert$
			endif

			i = i - 1

		endwhile


	next SortLP

return





REM *********************************************************************
REM Comb Sort
REM *********************************************************************
CombSort:
	gap = FileCount
    
	repeat

		REM update the gap value for a next comb
		if gap > 1
			gap = gap / 1.3
			if gap = 10 or gap = 9
				gap = 11
			endif
		endif

		i = 0
		swaps = 0 

		repeat 

			if upper$(FileName$(i)) > upper$(FileName$(i+gap))

				REM Swap
				buffer$ = FileName$(i)
				FileName$(i) = FileName$(i+gap)
				FileName$(i+gap) = buffer$

				swaps = 1 

			endif

			i = i + 1

		until i + gap > FileCount

	sync
	until gap =< 1 and swaps = 0
return





REM *********************************************************************
REM SelectSort
REM *********************************************************************
SelectSort:

	for SortLP = 0 to FileCount-2

		min = SortLP

		for SelectLP = (SortLP + 1) to FileCount
			if upper$(FileName$(SelectLP)) < upper$(FileName$(min))
				min = SelectLP
			endif
		next SelectLP

		REM Swap
		buffer$ = FileName$(min)
		FileName$(min) = FileName$(SortLP)
		FileName$(SortLP) = buffer$

	next SortLP

return





REM *********************************************************************
REM BubbleSort
REM *********************************************************************
BubbleSort:

	for BubbleLP = 1 to FileCount

		if FileName$(BubbleLP) < FileName$(BubbleLP-1)

			REM Swap
			buffer$ = FileName$(BubbleLP)
			FileName$(BubbleLP) = FileName$(BubbleLP-1)
			FileName$(BubbleLP-1) = buffer$
			BubbleLP = 0

		endif

	next BubbleLP

return





REM *********************************************************************
REM Quick Sort
REM *********************************************************************
Function QuickSort(L,R)

		CheckL = L
		CheckR = R
		Check$ = FileName$((L+R)/2)

		repeat

			REM Left Side Sort
			while FileName$(CheckL) < Check$
				CheckL = CheckL + 1
			endwhile

			REM Right Side Sort
			while Check$ < FileName$(CheckR)
				CheckR = CheckR - 1
			endwhile

			if CheckL <= CheckR

				REM Swap
				buffer$ = FileName$(CheckL)
				FileName$(CheckL) = FileName$(CheckR)
				FileName$(CheckR) = buffer$


				CheckL = CheckL + 1
				CheckR = CheckR - 1

			endif

		until CheckL >= CheckR
		
		REM Calling this same Function multiple times
		if L < CheckR then QuickSort(L,CheckR)
		if CheckL < R then QuickSort(CheckL,R)

EndFunction

Back to top

Profile PM Email

Sinani201

19

Years of Service

User Offline

Joined: 16th Apr 2007

Location: Aperture Science Enrichment Center

Posted: 3rd Jan 2009 20:04

Link

@Ashingda (last post you made thus far)
Your first code was good... but how am I supposed to use the last one you made? There's a lot of codes. I don't know where to input the strings.

@Latch
Is Select Sort supposed to be SQL select sort? That's all I got by Googling it.

I'm not so concerned about time. As long as it takes up to 10 seconds, that should be good enough.

"I reveal my trap card, GEORGE DUBYA BUSH!
America loses 2000 Life Points! America loses." -Deucalion2

Back to top

Profile PM

Latch

19

Years of Service

User Offline

Joined: 23rd Jul 2006

Location:

Posted: 3rd Jan 2009 22:52

Link

Quote: "Is Select Sort supposed to be SQL select sort? That's all I got by Googling it."

The algorithm I'm talking about is general. I mention it because it's easy to implement in just about any programming language and it's generally pretty fast. Ashingda has an example of it in his post about 4 posts up. He listed a bunch of different sorting methods so you can choose which one you like best.

Enjoy your day.

Back to top

Profile PM

Ashingda 27

18

Years of Service

User Offline

Joined: 15th Feb 2008

Location:

Posted: 4th Jan 2009 01:47 Edited at: 4th Jan 2009 01:49

Link

@Sinani
To use the Quick Sort the Keys are:
ArrayName$() - The list pretty much.
IndexUsed - The amount of Names to sort in the list.

To call the function:
QuickSort(0,IndexUsed) - The 1st parameter is the Left end of the partition and the 2nd is the Right end of the partition.

You'll have to change the Array and Variable names to adapt to your own use.

For more info, search "Quick Sort Wiki". It also has a visual animation to help understand too

. While you're at it there's alot of other algorithms there, I'm going to continue learning them just for kicks.

Back to top

Profile PM Email

Sinani201

19

Years of Service

User Offline

Joined: 16th Apr 2007

Location: Aperture Science Enrichment Center

Posted: 4th Jan 2009 23:05

Link

Err... OK. Thanks guys. I'll be on now...

"I reveal my trap card, GEORGE DUBYA BUSH!
America loses 2000 Life Points! America loses." -Deucalion2

Back to top

Profile PM

Libervurto

20

Years of Service

User Offline

Joined: 30th Jun 2006

Location: On Toast

Posted: 6th Jan 2009 19:56

Link

I select each string in turn and compare it to the others and keep a tally of how many strings it is greater than, then I place the string in a separate sorting array (needed so you don't overwrite strings).
Something like that its a while since I did it.
Is that a select sort?

Goke of the day: [Q]What's a coders' favourite part of an orchestra?
[A]The strings.

Back to top

Profile PM Email

Ashingda 27

18

Years of Service

User Offline

Joined: 15th Feb 2008

Location:

Posted: 6th Jan 2009 20:35 Edited at: 6th Jan 2009 20:36

Link

Seems the Select Sort algorithm would be to scan through the list from (x) "x = 0" to (end of list) and find the lowest value and swap it's position with the string in the (x) position. Then repeats it with a "x = x + 1" or "next x" etc.

As it progress the scan loops becomes significantly shorter.

This was taken from the wikipedia that show's a great example of how it's sorted.

Back to top

Profile PM Email

Sorry your browser is not supported!

DarkBASIC Discussion / Alphabetical Order