cyclic-sort-easy__pattern-cyclic-sort__grokking-the-coding-interview-patterns-for-coding-questions
| Topic | Replies | Views | Activity | |
|---|---|---|---|---|
| Why is complexity O(n) + O(n-1) |
|
1 | 82 | September 14, 2022 |
| Cyclic Sort (easy) |
|
1 | 143 | August 11, 2022 |
| Why this pattern is called "Cyclic sort". Can we add that description too? |
|
1 | 233 | December 22, 2021 |
| Isn't the time complexity of Cyclic Sort O(n^2) rather than O(n)? |
|
2 | 249 | December 21, 2021 |
| Coud we just do nums[i]- 1 != i instead of nums[i] != nums[nums[i] - 1]? |
|
2 | 374 | December 8, 2021 |
| Can we just fil the array with 1, 2, 3, 4 ... n? |
|
1 | 246 | January 20, 2021 |