Timeline for Sorting array of strings in c
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 12, 2016 at 12:07 | history | migrated | from stackoverflow.com (revisions) | ||
| Aug 5, 2016 at 15:36 | comment | added | sps |
@Iu Tub Your code still can be improved performance wise. As you have written, it has O(n^2) worst case time complexity. You can make it nlog(n) if you write a merge sort, or nlog(n) in average case if you write quick sort.
|
|
| Aug 5, 2016 at 15:27 | vote | accept | CommunityBot | ||
| Aug 5, 2016 at 11:54 | history | answered | sps | CC BY-SA 3.0 |