It's UWAweek 16 (1st semester, week 7)

help2200

This forum is provided to promote discussion amongst students enrolled in CITS2200 Data Structures and Algorithms.

Please consider offering answers and suggestions to help other students! And if you fix a problem by following a suggestion here, it would be great if other interested students could see a short "Great, fixed it!"  followup message.

How do I ask a good question?
Displaying selected article
Showing 1 of 84 articles.
Currently no other people reading this forum.


 UWA week 12 (1st semester, week 4) ↓
SVG not supported

Login to reply

👍?
helpful
5:03pm Sat 23rd Mar, ANONYMOUS

I was thinking about this myself, but computers are so fast that for sorting sub 100 elements it makes hardly any practical difference, so I went with merge sort only. Also, different sources on the internet say different numbers of `n` items are the equilibrium; I have seen n stated as 55, 38, 100 etc. I came across this link in my research which was quite informative: https://w3.cs.jmu.edu/lam2mo/cs240_2014_08/pa04-sorting.html#:~:text=Switching%20Strategies&text=As%20you%20can%20see%2C%20binary,faster%20for%20all%20larger%20inputs. Although I could be entirely wrong so if someone more knowledgable replies feel free to ignore this :)

The University of Western Australia

Computer Science and Software Engineering

CRICOS Code: 00126G
Written by [email protected]
Powered by history
Feedback always welcome - it makes our software better!
Last modified  5:07AM Sep 06 2023
Privacy policy