Timeline for Algorithm to add all lucky numbers under [N] to a Vector

15 events

when toggle format	what		by	license	comment
S Nov 2, 2022 at 12:04	history	edited	Toby Speight	CC BY-SA 4.0	Shorten SO link
S Nov 2, 2022 at 12:04	history	suggested	Glorfindel	CC BY-SA 4.0	broken link fixed, cf. https://meta.stackoverflow.com/a/406565/4751173
Nov 2, 2022 at 9:00	review	Suggested edits
S Nov 2, 2022 at 12:04
May 23, 2017 at 12:40	history	edited	CommunityBot		replaced http://stackoverflow.com/ with https://stackoverflow.com/
Nov 13, 2015 at 10:44	vote	accept	Anuj Saharan
Nov 13, 2015 at 10:44
Nov 13, 2015 at 2:52	history	edited	Deduplicator	CC BY-SA 3.0	deleted 18 characters in body
Nov 13, 2015 at 1:06	comment	added	Deduplicator		@200_success: I gave a way to do the task the program solves efficiently with recursion, yes. And a way to just generate a vector with all those numbers, without recursion. Clarified what is what.
Nov 13, 2015 at 1:01	history	edited	Deduplicator	CC BY-SA 3.0	added 33 characters in body
Nov 13, 2015 at 0:52	comment	added	200_success		You used recursion in `luckydiv_helper()`, and the task forbids recursion.
Nov 13, 2015 at 0:48	history	edited	Deduplicator	CC BY-SA 3.0	added 396 characters in body
Nov 13, 2015 at 0:16	history	edited	Deduplicator	CC BY-SA 3.0	added 122 characters in body
Nov 13, 2015 at 0:03	history	undeleted	Deduplicator
Nov 13, 2015 at 0:03	history	edited	Deduplicator	CC BY-SA 3.0	added 147 characters in body
Nov 12, 2015 at 23:57	history	deleted	Deduplicator		via Vote
Nov 12, 2015 at 23:55	history	answered	Deduplicator	CC BY-SA 3.0