Skip to content

Conversation

@YuShuanHsieh
Copy link
Contributor

Test sorting performance with random and descending order data.

  • 10000: all correct sorting algorithms are expected pass.
  • 50000: sorting algorithms with O(n^2) time complexity are expected failed.
  • 100000: sorting algorithms with O(nlogn) time complexity are expected pass.

@jserv
Copy link
Contributor

jserv commented Jan 31, 2020

The the criteria is perfect to me! Thanks for doing this. Can you mention the information about time complexity in file trace-16-perf.cmd as well?

@jserv jserv self-requested a review January 31, 2020 05:00
@YuShuanHsieh YuShuanHsieh force-pushed the feature/sorting-performance branch from 9dbdf0b to 3722e08 Compare January 31, 2020 05:32
@jserv jserv merged commit b9ed05d into sysprog21:master Jan 31, 2020
@YuShuanHsieh YuShuanHsieh deleted the feature/sorting-performance branch February 2, 2020 16:01
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants