Timeline for Finding duplicates in two sorted arrays
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 7, 2018 at 3:29 | history | edited | ratchet freak | CC BY-SA 4.0 |
added 1 character in body
|
| Jun 30, 2017 at 0:57 | history | edited | alecxe | CC BY-SA 3.0 |
added 2 characters in body
|
| Jan 23, 2015 at 17:15 | history | edited | ratchet freak | CC BY-SA 3.0 |
edited body
|
| Jan 23, 2015 at 16:57 | vote | accept | committedandroider | ||
| Jan 23, 2015 at 16:57 | comment | added | committedandroider | @h.j.k. think you're right there. if the first array's value is greater, you have to increment index2 because there is no way for that second array's value to be in the first array | |
| Jan 23, 2015 at 16:44 | comment | added | h.j.k. |
Should it be else if(sorted1[index1] > sorted2[index2]) { index2++ }?
|
|
| Jan 23, 2015 at 9:30 | history | answered | ratchet freak | CC BY-SA 3.0 |