Frage im Vorstellungsgespräch bei Google

Write code that sorts a stack

Antworten zu Vorstellungsgespräch

Anonym

19. Juni 2014

You use another stack to help with the sorting

1

Anonym

10. Sep. 2014

Or just use recursion(implicit stack).

Anonym

5. Jän. 2015

Pop everything into a sorted map/tree?

Anonym

17. Feb. 2018

Using the same queue, do "bubble sort" length(queue) times: void bubbleSortQueue(std::queue* toSort ) { int length = toSort->size(); if (length front(); toSort->pop(); for (int currItem = 0; currItem front(); toSort->pop(); if (first > second) { toSort->push(second); } else { toSort->push(first); first = second; } } toSort->push(first); } }