Insertion Sort is O(n log n)

Bidirectional Conditional Insertion Sort algorithm; An efficient progress on the classical insertion sort

In this paper, we proposed a new efficient sorting algorithm based on insertion sort concept. The proposed algorithm called Bidirectional Conditional Insertion Sort (BCIS). It is in-place sorting algorithm and it has remarkably efficient average case time complexity when compared with classical insertion sort (IS). By comparing our new proposed algorithm with the Quicksort algorithm, BCIS indic...

Imperative Insertion Sort

StUSPACE(log n) <= DSPACE(log²n / log log n)

We present a deterministic algorithm running in space O ? log 2 n= log logn solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(logn) time-bounded algorithm for this problem running on a parallel pointer machine.

Static Dictionaries on AC0 RAMs: Query Time Theta(sqrt(log n/log log n)) is Necessary and Sufficient

In this paper we consider solutions to the static dictionary problem on ACo RAMs, i.e. random access machines where the only restriction on theJinite instruction set is that all computationcil instructions are in ACO. Our main result is a tight upper and lower bound of 0 (Jlog n / log log n ) on the time for (answering membership queries in a set of size n when reasonable space is used for the ...

Dictionaries on AC 0 RAMs : Query Time Θ ( √ log n / log log n ) is Necessary and Sufficient

In this paper we consider solutions to the dictionary problem on AC RAMs, i.e. random access machines where the only restriction on the finite instruction set is that all computational instructions are in AC. Our main result is a tight upper and lower bound of Θ( √ log n/ log log n) on the time for answering membership queries in a set of size n when reasonable space is used for the data struct...