使用堆栈或队列在c ++中实现插入排序？

Question

Classical insertion sort algorithm with array is

void insertion_sort (int arr[], int length){
        int j, temp;

    for (int i = 0; i < length; i++){
        j = i;

        while (j > 0 && arr[j] < arr[j-1]){
              temp = arr[j];
              arr[j] = arr[j-1];
              arr[j-1] = temp;
              j--;
              }
        }
}

So should it implemented by using stack or queue?

Answer 1

If you use a vector, you gain the performance that all the memory you're working with is contiguous, but lose performance because you have to copy. If you use a linked list of any type, you gain because you don't have to copy, but you lose because your memory is scattered all over the place.

As such, this will depend on the number of items being sorted, the processor cache, and probably a whole host of other things.

Given that this sorting algorithm is known to be slow for any numbers of N, the correct solution is to not worry about performance at all and just use std::sort.