Smaller than a floppy

Suppose you are programming an ATM that has about 4KB of memory. A single customer could have millions of transactions on their card and you want to sort their withdrawal transaction history by the amount of money withdrawn. Which sorting algorithm would you decide to implement?

Radix Sort Counting Sort Merge Sort Heap Sort Insertion Sort Bubble Sort

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...