please give clear writing thanks. write in psuedocode (if applicable)

Write an algorithm for the non-recursive version of quicksort based on a main loop where a subarray is popped from a stack to be partitioned, and the resulting subarrays are pushed onto the stack. Note : Push the larger of the subarrays onto the stack first, which guarantees that the stack will have at most log N entries. [7 marks]