Implement Quick and Selection sort algorithms and test them over $4$ arrays filled as following:

$1-$ Array $1$ has sorted numbers

Example: $1|2|3|4|5|6|7|8|9|10$

$2-$ Array $2$ is reversely sorted

Example: $10|9|8|7|6|5|4|3|2|1$

$3-$ Array $3$ is filled with random numbers

Example: $5|2|7|4|8|10|9|1|3|6$

$4-$ Array $4$ is partially sorted

Example: $1|2|3|5|6|4|7|8|10|9$