Balanced index of an array

Paul Schwartzberg

24 Jan 2015CPOL4 min read

16.8K

117

Two possible methods to find the balanced index of an array. The one with O(0.5n) is slower than the other (O(1.5n)), because the first is simpler and mostly uses value rather than reference types.

This is an old version of the currently published article.

Only logged in members can view this content

Please go to the Performance Table of Contents to view the list of available articles in this section.

Closed because the post is not clear, or is incomplete and has not been phrased in a way that allows it to be fully understood.. Reported by Wendelius, Mehdi Gholam, Nelek, Kenneth Haugland on Saturday, January 24, 2015 10:20pm