Timeline for Minimum number of swaps required to sort the array in ascending order
Current License: CC BY-SA 4.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 5, 2022 at 15:52 | comment | added | Edward Olamisan | Does someone know the actual algorithm described in the examples to the question? I always see only alternate algorithms. What is the real algorithm? | |
| Feb 4, 2021 at 15:00 | history | tweeted | twitter.com/StackCodeReview/status/1357343169059246081 | ||
| Feb 3, 2021 at 17:31 | answer | added | Toby Speight | timeline score: 0 | |
| Aug 28, 2020 at 1:57 | history | protected | Jamal | ||
| Jun 10, 2020 at 13:24 | history | edited | CommunityBot |
Commonmark migration
|
|
| Aug 9, 2019 at 15:50 | review | Suggested edits | |||
| Aug 9, 2019 at 17:09 | |||||
| Aug 9, 2019 at 5:38 | answer | added | Sameh | timeline score: 1 | |
| Oct 26, 2018 at 9:43 | vote | accept | anand powai | ||
| Oct 26, 2018 at 6:59 | answer | added | janos | timeline score: 14 | |
| Oct 24, 2018 at 18:18 | comment | added | AJNeufeld |
The array length, array elements and return values are all of type int. It doesn't make any sense to use long long int for all local variables; that will just slow down your implementation, which is already a \$O(n^2)\$ slow algorithm. The optimal solution will scale slower than \$O(n^2)\$.
|
|
| Oct 24, 2018 at 8:47 | history | edited | Mast♦ | CC BY-SA 4.0 |
added 668 characters in body; edited tags; edited title
|
| Oct 24, 2018 at 8:40 | review | Close votes | |||
| Oct 24, 2018 at 17:56 | |||||
| Oct 24, 2018 at 5:30 | review | First posts | |||
| Oct 24, 2018 at 8:20 | |||||
| Oct 24, 2018 at 5:26 | history | asked | anand powai | CC BY-SA 4.0 |