Skip to main content

Timeline for Delete an element list recursively

Current License: CC BY-SA 4.0

9 events
when toggle format what by license comment
Jun 5, 2018 at 11:30 comment added kglr @Alucard, it seems that it depends on how much variation there is in the input list. With SeedRandom[1]; lst1=RandomSample[Range[30000]]; First/@{RepeatedTiming[fixedPointPick[lst1];], RepeatedTiming[descendingSequence[lst1];]} I get {0.0015, 0.038}, The results are similar with lst2 = RandomInteger[100000,30000]. With lst3 = RandomInteger[100,30000]; the timings are reversed: {0.0014, 0.00015}.
Jun 3, 2018 at 15:45 comment added Alucard i tried with a 30000 element long list. Carl's method was the first to complete the task (up to 1 order of magnitude faster than accidental's FixedPoint[Pick[]]method)
Jun 2, 2018 at 8:49 history edited kglr CC BY-SA 4.0
deleted 3 characters in body
Jun 2, 2018 at 5:06 history edited kglr CC BY-SA 4.0
added 54 characters in body
Jun 2, 2018 at 4:59 history edited kglr CC BY-SA 4.0
added 7 characters in body
Jun 2, 2018 at 4:39 history edited kglr CC BY-SA 4.0
added 342 characters in body
Jun 2, 2018 at 4:21 comment added yode Crazy man.......
Jun 2, 2018 at 4:15 history edited kglr CC BY-SA 4.0
deleted 9 characters in body
Jun 2, 2018 at 4:04 history answered kglr CC BY-SA 4.0