Software Interview Questions

551,386 software interview questions shared by candidates

The Max Bubble sort is O(n) at best, O(n^2) at worst, and its memory usage is O(1) . Merge sort is always O(n log n), but its memory usage is O(n). Explain which algorithm you would use to implement a function that takes an array of integers and returns the max integer in the collection, assuming that the length of the array is less than 1000. What if the array length is greater than 1000?
avatar

Four Star Generalist Software Engineer

Interviewed at LiveRamp

3.3
Feb 7, 2014

The Max Bubble sort is O(n) at best, O(n^2) at worst, and its memory usage is O(1) . Merge sort is always O(n log n), but its memory usage is O(n). Explain which algorithm you would use to implement a function that takes an array of integers and returns the max integer in the collection, assuming that the length of the array is less than 1000. What if the array length is greater than 1000?

Viewing 3081 - 3090 interview questions

Glassdoor has 551,386 interview questions and reports from Software interviews. Prepare for your interview. Get hired. Love your job.