list$\_$of$\_$numbers $=(-34,-22,1.3,4,4,7,9,12,14,15,18,22,37,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99.$

$100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,$

$129,131,138,135,140,145,150,155,160,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181.182,183$

$184,185,186,190,200,201,202,225,230$

Your goal is to sort the numbers in the list $\_$of $\_$numbers from smallest to the largest $($in the increasing order$)$

a$.$ To satisfy this goal, which sorting algorithm $($Selection sort, Merge sort, insertion sort, Quicksort$)$ would you select for the shortest running time? Think in terms of asymptotic notation

b$.$ Why?