Designing a sorting algorithm from scratch
Congrats of making your own sorting algorithm!
Speed/Efficiency
There are plenty of sorts on Wikipedia that are more efficient, if you want to take a look at them. I added rough speed (given random data) and difficulty estimates:

Bubble sort (very slow, very easy)
Selection sort (slow, easiest)
Insertion sort (also slow, but harder)
Merge sort (fast, hard)
Quicksort (faster, also hard)

Output
Typically it is bad practice to put a print statement inside a function, because you don't want your console flooded with text if you are calling that function a bunch of times. Instead, you can do return numSort inside your function and print(sortFunc(myList)) outside.
Naming
Now, I'm sure you will also get answers pertaining to variable names, but I'm not a stickler for that, plus your variables and functions seem good already.
Happy coding!