The list in my future code would be dynamic in size, and would contain anywhere from 50-1500 elements. I certainly obtained a ton of good advice on the topic. I need to consult my old operation cost charts from school, and play with a few of the ideas to decide which data type would be a best fit for my app. I am really looking forward to getting this running.
Well, have fun. Just remeber that O-notation comparisons of different algorithms general carry an unstated "all other things being equal" clause.
That is, an O(N) algorithm written in C (like splice), may outform a O(1+a few bits) algorithm written in Perl, if N is fairly small (and 50-1500 is small in this context) and those "few bits" consitute several lines of Perl.