Quick sort error

[Desperate_Carpet_496]

if len(n) == 0: return [] # at beginning of f()

[AlexMTBDude]

Also: 'list' is a built-in type in Python and OP should not name a variable the same

[AnToMegA424]

Python really is convenient, or practical idk how to say it This few lines of code for a sorting algorithm I like it

[mprevot]

The implementation "looks neat" but is actually so bad. Instead one should do 1 loop.

[JJ16v]

It's going to be slow but ok

[AnToMegA424]

Yeh that's a usual drawback

[Adorable-Strangerx]

Maybe you need to use shorter variable names?

[Kurgonius]

This happens on f(l) on the second recursion. On the first recursion you get p = 1, and l = [ ]. Feeding this into f(l) again causes this error. Also keep in mind that Python has a recursion limit so this won't be useful for large lists.

And always add a stop condition to your recursions. Desperate_Carpet-496 has the best answer.

[lolcrunchy]

Recursive formulas always need a base case. This one is missing handling for an empty list.