Over a million developers have joined DZone.

Topcode Bonus Problem

·
public class Bonuses {
	public int[] getDivision(int[] points) {
		int totalPoints = 0;
		double extraPoints = 0.0;
		for(int point : points) {
			totalPoints += point;
		}
		int[] splitup = new int[points.length];
		for(int i=0; ilargestNumber) {
				largestNumber = array[i];
				largestNumberIndex = i;
			}
		}
		return largestNumberIndex;
	}
}
Topics:

The best of DZone straight to your inbox.

SEE AN EXAMPLE
Please provide a valid email address.

Thanks for subscribing!

Awesome! Check your inbox to verify your email so you can start receiving the latest in tech news and resources.
Subscribe

{{ parent.title || parent.header.title}}

{{ parent.tldr }}

{{ parent.urlSource.name }}