June 2018 Update
This commit is contained in:
parent
ba8067c3b7
commit
22f33d4004
5278 changed files with 84726 additions and 14379 deletions
|
|
@ -47,7 +47,7 @@ An algorithm for the previous speech could be (if P is a point, Px is its x coor
|
|||
'''end''' '''if'''
|
||||
'''if''' Py < Ay '''or''' Py > By '''then'''
|
||||
'''return''' false
|
||||
'''else''' '''if''' Px > max(Ax, Bx) '''then'''
|
||||
'''else''' '''if''' Px >= max(Ax, Bx) '''then'''
|
||||
'''return''' false
|
||||
'''else'''
|
||||
'''if''' Px < min(Ax, Bx) '''then'''
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue