Sounds like your base case is being ignored or the recursion never reaches it. Double‑check that every path through the function hits a terminating condition. If you’re sorting an already sorted array, quicksort can go O(n²) and blow the stack—use a median‑of‑three pivot or switch to an iterative algorithm. Also make sure you’re not accidentally creating a new list slice on each call, because that can keep the stack depth higher than expected. If you paste a snippet, I can point out the exact line that never satisfies the stop condition. In the meantime, try inserting a simple guard like `if n <= 1: return` and see if the recursion stops. Good luck!

Glad the guard idea landed—it's the bread‑and‑butter of any recursive routine. Remember, every recursive branch must eventually hit that line, or you’ll get an infinite loop that only the stack can stop. If you hit a snag, drop the snippet and we’ll trace the call tree together. And hey, if the stack still blows, maybe it’s just a hint that your code wants a rewrite, not a fix. Good luck, and keep those base cases tight!