21-09-2003 15:49									#1
	Need help with Java Full PM-box? Change here!

Does anyone know where I can find the sourcecode for Quick Search, Merge Search and Heap Search?

I need the source code, because our teachers told us to download them from the internet, and we should comment the different lines in the code, so they know we understand it. Our assignment isn't based on the "do-it-yourself", because we didn't have enough time for this assignment to actually do it ourself.

Does anyone know where I can find those?

	21-09-2003 16:19									#2
	Help yourself to an AD-FREE life

Sorry, a quick search (grin) with google didn't turn up anything interesting with any of them.

	21-09-2003 16:22									#3
	Full PM-box? Change here!

Goldmine!

http://www.cs.ubc.ca/spider/harriso...rting-demo.html

and if that doesn't help, some more from sun
http://java.sun.com/docs/books/tuto...ons/algorithms/

	21-09-2003 16:22									#4
	Support Apolyton, buy Civilization III: Complete

Thx, I'll take a look

	21-09-2003 16:32									#5
	Support Apolyton buy from Amazon

Do you know an easy way to compile SortAlgorithm.jav and SortItem.java?

I can't find them as class files, and I can't compile them because file1 needs file2, and file2 needs file1

	21-09-2003 16:36									#6
	Support Apolyton buy from Amazon

Nevermind, found the way

	21-09-2003 18:05									#7
	Support Apolyton or Terrorists Win

how?

	21-09-2003 18:07									#8
	Remove this text

By opening the files in a project (I'm using JCreator)

	21-09-2003 18:11									#9
	Put an end to popups!

cunning

	21-09-2003 18:19									#10
	Enter the AD-FREE zone

Could someone please take a look at my code and tell me what's wrong here?


Tester.java is the execution file.
I'm having problems with HeapSort.java

I have included a lot of System.out.println's to find the error, but I can't seem to find anything wrong in the code.

For some strange reason it just stops in the middle of the for-loop in heapSort method

Can someone see what's wrong here?

	21-09-2003 21:15									#11
	Support Apolyton, buy Civilization III: Complete

Shouldn't you use v[] instead of data[] inside HeapSort?

	22-09-2003 14:44									#12
	Avatar Enlargement: We've got the solution

Uhmm... I guess so, but this doesn't make any difference. The problem is the pause(); methods. I don't understand why they're included. If I don't include them it goes on forever, but if I include them, the program ends with a pause(); (Using the System.out.println("Pause1"); line in the pause(); method)

	22-09-2003 15:05									#13
	Support Apolyton buy from Amazon

Which line exactly does it stop at, or which for loop?
What are the variables doing just before it stops responding?

Have your println call display the values of the variables used in that particular section of code, it should help point out the problem.

	22-09-2003 15:10									#14
	Support Apolyton, buy Call to Power 2

In HeapSort line 101 it calls the medhod pause(), which is line 61 - 67 in class SortAlgorithm

The last thing it does before stopping is printing "Pause1" (line 65). I have checked, it doesn't enter this:

if (stopRequested)
{
throw new Exception("Sort Algorithm");
}

	22-09-2003 20:33									#15
	Got spare money?

The pause() method is part of Java's AWT. It seems like it was included to be used as part of some sorting demo program. I think you can take it out.

	22-09-2003 20:39									#16
	Got spare money?

I have tried to take it out, but if I do it, it makes something strange. It prints out like this:

(...)
5
44
89
1
56
4
8
12
11
18
(...)

It has printed very much, before I get the chance to stop the print's, which makes it impossible to see where it fails

	22-09-2003 22:24									#17
	Support Apolyton, buy Civilization III: Complete

I just found a MergeSort.class file, but somethings weird about it. When sorting, the graf shows it mostly only takes 0-10 milliseconds to sort 5000 ints

The funny thing is, when I insert some System.out.print()'s to check to see if it really sorts it, the array is actually sorted... sounds too fast to be true...

	22-09-2003 22:33									#18
	Support Apolyton buy from Amazon

Just tried the test with 50,000 ints, but it still sorted correctly, and this within 10 milliseconds...