I need help on some java programming am a 1st year student :-

Write two algorithms: first to put a list of names in ascending order;
then a second one to search an unordered set of students names with corresponding Test Marks.
Use these two algorithms to:
a. Update the ordered list of names with the correct test marks.
There are two unordered lists of names plus test marks, TEST1, TEST2.

b. Produce a final output which is a list of ordered names followed by at most two Test marks.
Make sure you have the rights captions/labels on the columns.

Question

I need help on some java programming am a 1st year student :-

Write two algorithms: first to put a list of names in ascending order;
 then a second one to search an unordered set of students names with corresponding Test Marks.
 Use these two algorithms to:
	a.	Update the ordered list of names with the correct test marks. 
	There are two unordered lists of names plus test marks, TEST1, TEST2.
	
	b.	Produce a final output which is a list of ordered names followed by at most two Test marks. 
	Make sure you have the rights captions/labels on the columns.

anonymous · Answer

Well to be specific, I need to know what data structure you're using - ie. trees, linked lists... and also whether you're using an iterator or not.

Updating is just a matter of traversing the list or tree to the node and using the setTestMark() method.

The final output you will need to implement an in-order list traversal method - there are some good examples on Wikipedia for this.

So yeah more info I think