Forums
New posts
Search forums
Members
Current visitors
Log in
Register
What's new
Search
Search
Search titles only
By:
New posts
Search forums
Menu
Log in
Register
Install the app
Install
Forums
Archive
Archive
Java
Binary Search
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an
alternative browser
.
Reply to thread
Message
[QUOTE="Roedy Green, post: 4197091"] The pattern I often work with is the elements are known at compile time or when the program first starts, and from then on are effectively read-only. I thought you might replace the entire array on every add, and sort on the first lookup. This as slow to build, but has a simple sorted array of the exact size for lookup. [/QUOTE]
Verification
Post reply
Forums
Archive
Archive
Java
Binary Search
Top
