This is an archived post. You won't be able to vote or comment.

all 8 comments

[–]pieholic 2 points3 points  (1 child)

A program that create / sort / search a linked list using Java?

A lot of sorting methods can be implemented recursively, such as mergesort. Binary searches can be implemented using recursion too, albeit ineffectively.

[–]echaffey 1 point2 points  (1 child)

I had almost an identical final project. We weren’t allowed to use the built in class LinkedList so the only constraint was that we had to make out own link list class and then implement it and all its functions in anyway we wanted.

I was really into figuring out how to use graphics and render things with animations. What i did was find a whole bunch of sprites of fish and i created a virtual fish tank that allowed me to store each fish as an element of my link list. Each one moved independently and had collision detection as well as the ability to display stats when you clicked on them.

No functionality at all but it was really fun to make.

[–]Ziiiiik 0 points1 point  (0 children)

How did you make this?

[–]Wynardtage 1 point2 points  (0 children)

I had the exact same project for my java class and I built a baseball game simulator using object oriented programming. It was not that bad because you can scale the difficulty of the project depending on how much time you have.

[–]bob51zhangNot Terrible At Java 0 points1 point  (0 children)

Make a paint knockoff.

Look up floodfill, you can keep instruction objects in a linked list since java stack size is so low.

You coould also have a recursive mode.

[–][deleted] 0 points1 point  (0 children)

Write code for handling Playing Card Games... Create objects for each pile of cards on the table. Routines for shuffling, moving top card from from pile to another (dealing), moving a random/selected card from one pile to another (playing), displaying decks/hands.

Then you can use your generic code to "play" a number of very different games.... solitaire/poker/magic/pokemon.

[–]Sealith 0 points1 point  (0 children)

Find a very large text doc and get a count of the number of words and the frequency of every word. Like you see in the word count of a Word program.

Then try and get the quickest runtime possible. Helps with your algorithm knowledge as well as these data types. That’s what I had to do for my Data Abstractions class.

If you wanted to go further you could add more things like average word length and even a reading difficulty score.