| Current Forum: 15-211 Main Forum |
| Date: Tue Dec 18 2001 7:42 pm |
| Author: Tan, Jit Ken <jitken@andrew.cmu.edu> |
| Subject: Running time of insert in a sorted array |
|
|
This question is related to 15-211 falln 99 final problem 4. The answer key said that the insert operation of a sorted array is not cheap ( O(1) or O(log n) ). What is the running time of insert in a sorted array? I thought it is like O(log n) in an sorted array.
ken |
|