Scala insert element into sorted array in log(N)

Question

I have a sorted Array and I would like to insert a new element in logarithmic time.

I want to do something like this:

def addElem(Array[Int] data, Int x) {
            val pos = java.util.Arrays.binarySearch(data,x);
            data.insertAfter(pos, x);
}

Can I do this with an Array?

Should I try a different data structure?

How could insertion to an array be log(N) when it needs O(n) to move part of array to make space for new element? — Łukasz
– Łukasz, Commented Dec 23, 2015 at 12:52
Does your sorted collection need to be able to handle duplicate elements? — Daenyth
– Daenyth, Commented Dec 23, 2015 at 14:05

vvg · Accepted Answer · 2015-12-23 12:51:25Z

2

Please consider scala collections performance charasteristics:

http://docs.scala-lang.org/overviews/collections/performance-characteristics.html

There are two types of collections that provide Log complexity for insert operation. They are: TreeSet, TreeMap (mutable and immutable).

I would suggest use them.

Regarding Arrays.binarySearch usage. It will not work as most likely you array will not contains x element, so it returns -1. Definitely you can implement binarySearch on Array[Int] by yourself that satisfy your needs.

answered Dec 23, 2015 at 12:51

vvg

6,40522 silver badges36 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

Scala insert element into sorted array in log(N)

1 Answer 1

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Related