Michael Boyd

Greenhorn
+ Follow
since Dec 04, 2003
Merit badge: grant badges
For More
Cows and Likes
Cows
Total received
0
In last 30 days
0
Total given
0
Likes
Total received
0
Received in last 30 days
0
Total given
0
Given in last 30 days
0
Forums and Threads
Scavenger Hunt
expand Ranch Hand Scavenger Hunt
expand Greenhorn Scavenger Hunt

Recent posts by Michael Boyd

I need to input a file to be hashed, but the file to be inputted has to be chosen in the command line, not the code. It has to be in the form "java IdCheck file001.pas", where IdCheck is the name of the java file and file001 is a pascal file to be hashed. All I need to know is how to input the file. Thanks a bunch.
20 years ago
The file format is a simple .txt file with one word per line of text. If you have anything to add now that i finally remembered to say that, i'd be happy to hear it.
Thanks guys
20 years ago
Since this is the first time I've had to do something like this, I'm not quite sure on how to read/insert lines to/from file, or on how to parse a line in the file. I do have a an algorithm for inserting into dlB trees, but that's about it.
Sorry about the name thing, btw.
20 years ago
Basically, I have a dictionary file that I have to load into a de la briandais tree so I can search for anagrams in it. I have the anagram part worked out, but loading the thing is giving me fits. Any suggestions?
20 years ago
That sounds about right, although the code that I have to test the constructor indicates that the root should be a node of some sort; in that case, do I just create a node and make it a root? Thanks a lot for the help.
Also one more thing, would I need to import anything, such as java.util, java.awt, etc?
[ December 05, 2003: Message edited by: Michael Boyd ]
20 years ago
I am writing a binary tree constructor that uses three variables as inputs: BinaryTree left, Object e, and BinaryTree right; BinaryTree left and right are previoiusly defined trees, or they can be null initially, and e is the new root. The constructor constructs a tree from the bottom up.
Basically, my problem is the syntax needed for this, I have tried coding it but it never quite works and is quite frankly driving me up the wall. Anyone know how to set this up?
20 years ago