These Asian beauties really do seem to like each other a LOT !
http://www.what-a-day.com/file2.php?jid=235
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email
On May 28, 6:21 pm, sl7fat <[EMAIL PROTECTED]> wrote:
> hi i have an algorthim code and i have to find the time complixcity of
> the code so can you plz help me ASAP the code is written done ,,
> # include
>
> void main()
> {
>
> int a[10][4]=
> {{ 16,17,19,13},
> {18,14,1
Just test whether they are collinear or not i.e. get the slopes,
m1 from 1st and 2nd point
m2 from 2nd and 3rd point
if m1==m2 then they do not form a triangle
else they do
Computing the area of the triangle and testing for 0 might also
work but I feel that the computation will be big
