insort_left clear solution for The Ship Teams by flpo - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

insort_left solution in Clear category for The Ship Teams by flpo

from bisect import insort_left

def two_teams(sailors):
    ships = [[],[]]
    for sailor, age in sailors.items(): 
        insort_left(ships[20 <= age <= 40], sailor)
    return ships

Sept. 1, 2018

Comments:

oduvan on Sept. 1, 2018, 6:49 p.m.
wow

halianka on Sept. 2, 2018, 11:07 p.m.
something new to learn :)

sesenion on Sept. 10, 2018, 5:05 p.m.
Nice, I read about insort some time ago, but didn't think of it.

harryk1 on Sept. 10, 2018, 5:59 p.m.
awesome

animuza on Nov. 16, 2018, 10:16 a.m.
A really efficient way to do it :O

juestr on May 14, 2019, 10:44 p.m.
It's very very neat code, but execution efficiency is low, O(n^2 * log n) if I am not mistaken. Against O(n * log n) for the naive partition-and-sort solution. Repeated inserts into a list are expensive.

conghua_t on March 27, 2019, 12:29 p.m.
nice

Denis_Emel_janenko on March 27, 2019, 1:13 p.m.
Great work!

bsquare on Sept. 15, 2019, 9:54 a.m.
Nice solution :)

vlad.bezden on Feb. 13, 2020, 4:22 p.m.
Great job!

samdec11 on May 9, 2023, 2:57 a.m.
I never would've thought to use a boolean as an index. That's a neat idea.

Escher

0 %

PyCharm The Python IDE for Professional Developers. Enjoy productive Python, web and scientific development with PyCharm. Download it now!