title: Why is insertion sort "decrease and conquer" whereas selection sort is "brute force"?
body: <p>Why are insertion sort algorithms also not considered brute force algorithms? Don't they systematically look through every value of the array as well? I undertand that selection sort has a worst best-case time complexity, but I'm still not fully understanding the differentiation between a brute-force algorithm and a decrease-and-conquer algorithm. Sorry if this is a stupid question. Thanks! </p>