排序算法的图形比较

Question

Task: I need to graph the number of comparisons(y axis) to the number of arguments in my array(x axis) for Insertion Sort and Quick Sort.

Question: I was wondering if I could use the average time complexities in order to do this.

Insertion Sort: O(n^2)= 1 element in my array(x axis) 1 comparison (y axis)

Quick Sort: O(n log(n)) = 1 element in my array(x axis) 0 comparisons ( y axis)

Similar/Helpful Question asked: https://cs.stackexchange.com/questions/3/why-is-quicksort-better-than-other-sorting-algorithms-in-practice

Answer 1

我会说是的，除非您需要在排序函数中使用计数器来获取针对每个数组长度进行的比较的实际数量，这将取决于元素本身。