(logs []string)
| 6 | ) |
| 7 | |
| 8 | func reorderLogFiles(logs []string) []string { |
| 9 | // insertion sort with custom comparison function |
| 10 | for i := 1; i < len(logs); i++ { |
| 11 | k := i |
| 12 | for k > 0 { |
| 13 | ct := compareLogs(logs[k-1], logs[k]) |
| 14 | |
| 15 | if ct <= 0 { |
| 16 | break |
| 17 | } |
| 18 | |
| 19 | if ct > 0 { |
| 20 | hold := logs[k] |
| 21 | logs[k] = logs[k-1] |
| 22 | logs[k-1] = hold |
| 23 | } |
| 24 | |
| 25 | k-- |
| 26 | } |
| 27 | } |
| 28 | |
| 29 | return logs |
| 30 | } |
| 31 | |
| 32 | func compareLogs(a, b string) int { |
| 33 | aTokens := strings.Split(a, " ") |