(stack)
| 2 | // solution using recursion |
| 3 | |
| 4 | function sortStack(stack) { |
| 5 | if (stack.length === 0) return stack; |
| 6 | |
| 7 | const top = stack.pop(); |
| 8 | |
| 9 | sortStack(stack); |
| 10 | |
| 11 | insertInSortedOrder(stack, top); |
| 12 | |
| 13 | return stack; |
| 14 | } |
| 15 | |
| 16 | function insertInSortedOrder(stack, value) { |
| 17 | if (stack.length === 0 || stack[stack.length - 1] <= value) { |
no test coverage detected