Timeline for Job scheduling: algorithm to find the maximum number of overlapping jobs?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 13, 2016 at 14:53 | vote | accept | Liz | ||
| Sep 13, 2016 at 2:46 | vote | accept | Liz | ||
| Sep 13, 2016 at 14:53 | |||||
| Sep 12, 2016 at 20:22 | comment | added | Erik Eidt | As you are asking if you're on the right track, I'd suggest that you write your algorithm in a bit more detail, such as in terms of loops or nested step so you can determine the complexity. (For example, if you are doing two loops, nested, over the input, that is O(n^2).) I think this can be done linearly, after sorting, which is usually ~O(n log n). | |
| Sep 12, 2016 at 20:20 | answer | added | Doc Brown | timeline score: 6 | |
| Sep 12, 2016 at 19:45 | review | First posts | |||
| Oct 7, 2016 at 14:29 | |||||
| Sep 12, 2016 at 19:44 | history | asked | Liz | CC BY-SA 3.0 |