Speed: Fast- Selection sort is one of the fastest sorting algorithms due to its extremely simplsitic nature. It works by just finding the smallest element and moving it to the front then going through it agian and finding the second smallest element and moving it to the second and so forth.
Strength: Arrays with fewer than 20 elements- Due to its simple nature on arrays longer than 20 elements it struggles and is more and more slower the longer the dataset is.
Endurance: Weak- When the data is shorter selection sort works the best due to the fact it reads the array faster the shorter it is so its able to find the next shortest element easier.