You use time complexity and space complexity functions to compare the algorithm to others of a similar nature (one sorting algorithm to another sorting algorithm, for example).

In its best case, where the list is sorted or nearly sorted, its time complexity is O(n). As far as space complexity is concerned, Insertion Sort requires O(1) additional space (for variable storage).