Would anybody be up to helping me solve this? It's one of the questions on
Codility. According to them, it should only take 30 mins.
Two non-empty zero-indexed arrays A and B, each consisting of N integers, are
given. Four functions are defined based on these arrays:
F(X,K) = A[K]*X + B[K]
U(X)
was told the algorithm is located somewhere here:
> >> http://hg.python.org/cpython/file/default/Objects/listobject.c
>
> >>
>
> >>
>
> >>
>
> >> So of all the functions in there, could somebody point to me which one is
> >> timsort?
>
> >>
>
> >>
>
> >>
>
> >> Thanks, if anyone can help.
>
> >>
>
> >> Alphonse23
--
http://mail.python.org/mailman/listinfo/python-list
age I was told the algorithm is located somewhere here:
> http://hg.python.org/cpython/file/default/Objects/listobject.c
>
>
>
> So of all the functions in there, could somebody point to me which one is
> timsort?
>
>
>
> Thanks, if anyone can help.
>
> Alphonse23
--
http://mail.python.org/mailman/listinfo/python-list
Ahh, that makes perfect sense. Thanks for clearing that up.
On Saturday, June 15, 2013 1:55:29 PM UTC-7, Robert Kern wrote:
> On 2013-06-15 21:21, alphons...@gmail.com wrote:
>
> > Hey guys,
>
> > Thanks for the quick reply! So why did they decide to call it listsort in
> > the source instead?
Hey guys,
Thanks for the quick reply! So why did they decide to call it listsort in the
source instead? Why didn't they keep it as Timsort?
Well. I'm going to have a ton of fun trying to make sense of this.
--
http://mail.python.org/mailman/listinfo/python-list
t?
Thanks, if anyone can help.
Alphonse23
--
http://mail.python.org/mailman/listinfo/python-list
