It's UWAweek 47

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 176 articles.
Currently 17 other people reading this forum.


 UWA week 13 (1st semester, week 5) ↓
SVG not supported

Login to reply

👍?
helpful
6:40pm Tue 26th Mar, ANONYMOUS

In the lab it is specified when two runs have the same time that they should be 'tie-broken by runner name.' I'm having trouble with this, originally i thought it meant in Lexicographical order but my code keeps failing particularly when runs have the same time and first letter but differ in capitalization so how exactly should it be treated i.e for the list[c,b,B,C,A,a] should they be sorted: [A,C,abc] or [a,A,b,c,C] I have tried to implement the second version for hours but when i do more failure is added.

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  8:08AM Aug 25 2024
Privacy policy