Timeline for Sorting a list of strings in lexicographic order of sorted strings
Current License: CC BY-SA 3.0
45 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 16, 2020 at 10:30 | history | edited | CommunityBot |
Commonmark migration
|
|
| Jun 2, 2020 at 18:03 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Feb 3, 2020 at 18:02 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jan 4, 2020 at 16:31 | answer | added | Gerardo Zinno | timeline score: 0 | |
| Jan 3, 2020 at 18:02 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Sep 5, 2019 at 17:03 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| May 8, 2019 at 16:03 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jan 8, 2019 at 16:00 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Dec 9, 2018 at 15:02 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Nov 9, 2018 at 15:01 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Oct 10, 2018 at 15:00 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Sep 10, 2018 at 14:00 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Aug 11, 2018 at 5:00 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jul 12, 2018 at 4:06 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jun 12, 2018 at 3:41 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| May 13, 2018 at 4:22 | comment | added | greybeard |
no […] statistical algorithms I hope amortised analysis is OK.
|
|
| May 13, 2018 at 4:16 | comment | added | greybeard |
@YuvalFilmus Time cannot be smaller than space true. You are cheating in some way does not follow from "$O(m+n)$ time and $O(mn)$ space": with $1 \le mn$, $xm + yn + z \in O(mn)$ - the bound on space looks needlessly lax.
|
|
| May 13, 2018 at 2:47 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Apr 13, 2018 at 2:25 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Mar 14, 2018 at 1:54 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Feb 12, 2018 at 1:37 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jan 13, 2018 at 1:08 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Dec 14, 2017 at 0:42 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Nov 14, 2017 at 0:40 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Oct 14, 2017 at 23:53 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Sep 14, 2017 at 23:28 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Aug 15, 2017 at 22:49 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jul 16, 2017 at 22:31 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jun 16, 2017 at 21:46 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| May 17, 2017 at 21:31 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Apr 17, 2017 at 19:44 | history | edited | Raphael |
edited tags
|
|
| Apr 17, 2017 at 19:23 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Mar 18, 2017 at 19:14 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Feb 16, 2017 at 18:58 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jan 17, 2017 at 18:19 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Dec 19, 2016 at 10:56 | history | tweeted | twitter.com/StackCompSci/status/810801092305027073 | ||
| Dec 18, 2016 at 18:04 | answer | added | D.W.♦ | timeline score: 1 | |
| Dec 17, 2016 at 6:28 | history | edited | Yuval Filmus | CC BY-SA 3.0 |
added 68 characters in body
|
| Dec 16, 2016 at 22:04 | history | edited | Ofer Magen | CC BY-SA 3.0 |
added 2127 characters in body; added 37 characters in body; added 93 characters in body
|
| Dec 16, 2016 at 17:11 | comment | added | Ofer Magen | RAM model takes O(1) to define an array with size n (the computer only needs to define the start and end pointers). It takes O(n) to reset it to zeroes. C++ IS a ram model language that's why I brought this example | |
| Dec 16, 2016 at 17:08 | comment | added | Yuval Filmus | I don't care much for C and C++. We usually analyze algorithms under the RAM machine model. In this model time cannot be smaller than space. I'm slightly worried that your smart array doesn't really work in $O(1)$ per access. | |
| Dec 16, 2016 at 17:07 | history | edited | Yuval Filmus | CC BY-SA 3.0 |
deleted 86 characters in body; edited title
|
| Dec 16, 2016 at 17:06 | comment | added | Ofer Magen | Sure it can. Creating an array in size n without reseting it takes O(1). That's true for c and c++. Then you can use a very simple data structure to track which cells you've used and which are garbage | |
| Dec 16, 2016 at 17:01 | comment | added | Yuval Filmus | Time cannot be smaller than space. You are cheating in some way. | |
| Dec 16, 2016 at 13:22 | history | asked | Ofer Magen | CC BY-SA 3.0 |