IT 210 Week 5 DQ 2

**********************************************************

IT 210 Entire Course Link

https://uopcourses.com/category/it-210/

**********************************************************

Question:
Post your response to the following: You've been asked to write some code to sort a set of numbers. For example if (19, 5, 22, 11) "came in" to your code, you would output (5, 11, 19, 22). You're further told that the quantity of numbers coming in will always be small, i.e. under ten total. QUESTION: which sort technique (algorithm) would you use? A bubble sort? A quick sort? Maybe a heap sort? Why would you choose one sort technique (algorithm) over all the others?


RESPONSE 1
After reading the chapters i would have to go will the bubble sort for smaller quaintly numbers. The main reason being the function of the type of sort algorithm and how if functions.
Powered by