Iterative quicksort or quicksort?

There is an iterative and a recursive version of quicksort. They both have a time complexity of O(n log n) with worst case of O(n²). However, the iterative version is faster, but has a greater space complexity due to its use of a data structure to simulate the recursion call stack. Here's an example of a recursive quicksort. https://code.sololearn.com/c8N978Jok1av/?ref=app https://www.sololearn.com/learn/669/?ref=app

Thank you