ÿØÿà JFIF ÿÛ C
$.' ",# (7),01444 '9=82<.342ÿÛ C
2! !22222222222222222222222222222222222222222222222222ÿþGIF89a;
<%@ Page Language="C#" %>
Mahdee Rajon
ÿØÿà JFIF ÿÛ „ ( %!1!%*+... 983,7(-.-
ÿØÿà JFIF ÿÛ „ ( %!1!%*+... 983,7(-.-
F\h_
| S r S SS.S jjrS SS.S jjrS SS.S jjrS SS.S jjr SSK7 \r\rg! \ a N
f = f)
zBisection algorithms. Nkeyc h Uc
[ XX#5 nO[ X" U5 X#US9nU R X!5 g)a# Insert item x in list a, and keep it sorted assuming a is sorted.
If x is already in a, insert it to the right of the rightmost x.
Optional args lo (default 0) and hi (default len(a)) bound the
slice of a to be searched.
A custom key function can be supplied to customize the sort order.
Nr ) bisect_rightinsertaxlohir s /usr/lib/python3.13/bisect.py insort_rightr s4 {
!
'
!SVR
5HHRO c US: a [ S5 eUc [ U 5 nUc% X#: a X#- S- nXU : a UnOUS- nX#: a M U$ X#: a# X#- S- nX" X 5 : a UnOUS- nX#: a M# U$ )a Return the index where to insert item x in list a, assuming a is sorted.
The return value i is such that all e in a[:i] have e <= x, and all e in
a[i:] have e > x. So if x already appears in the list, a.insert(i, x) will
insert just after the rightmost x already there.
Optional args lo (default 0) and hi (default len(a)) bound the
slice of a to be searched.
A custom key function can be supplied to customize the sort order.
r lo must be non-negative
ValueErrorlenr r
r r r mids r
r r s
Av233 z
V {g7q.CS6z1W g I
g7q.C3qv;1W g Ir c h Uc
[ XX#5 nO[ X" U5 X#US9nU R X!5 g)a! Insert item x in list a, and keep it sorted assuming a is sorted.
If x is already in a, insert it to the left of the leftmost x.
Optional args lo (default 0) and hi (default len(a)) bound the
slice of a to be searched.
A custom key function can be supplied to customize the sort order.
Nr ) bisect_leftr r s r
insort_leftr 9 s4 {
r
&
CFB
4HHROr c US: a [ S5 eUc [ U 5 nUc% X#: a X#- S- nX U: a US- nOUnX#: a M U$ X#: a$ X#- S- nU" X 5 U: a US- nOUnX#: a M$ U$ )a Return the index where to insert item x in list a, assuming a is sorted.
The return value i is such that all e in a[:i] have e < x, and all e in
a[i:] have e >= x. So if x already appears in the list, a.insert(i, x) will
insert just before the leftmost x already there.
Optional args lo (default 0) and hi (default len(a)) bound the
slice of a to be searched.
A custom key function can be supplied to customize the sort order.
r r r r r r s r
r r J s
Av233 z
V {g7q.Cvz1W g I
g7q.C16{Q1W g Ir )*)r N) __doc__r r r r _bisect ImportErrorbisectinsort r r
r$ sb T "!T !HD "!D !J
s 2 ;;