Goldman Sachs Interview Question: Name one of the more efficient sorting algorithms | Glassdoor

Skip to content Skip to footer

Notifications

Loading...

employer cover photo

Goldman Sachs

Goldman Sachs Analyst Developer interview

Goldman Sachs Interview Question

Analyst Developer Interview

Name one of the more efficient sorting algorithms

Interview Answers

Anonymous

Aug 21, 2010

Hash Sort

Anonymous

Feb 9, 2011

Merge Sort. Used in Java implementations for sorting. O(NlogN) runtime

Related searches: Goldman Sachs reviews | Goldman Sachs jobs | Goldman Sachs salaries | Goldman Sachs benefits | Goldman Sachs conversations

Goldman Sachs interviews