On May 27, 1:22 am, Feng <[EMAIL PROTECTED]> wrote:
> Hi all!
>
> Given 3 points in 3D, what is the fast and numerically stable way to
> test if they form a triangle?
>
> I am thinking computing the determinant of the square matrix formed by
> the 3 points and testing if the determinant is nonze
Well she sort of has half-a-bikini and then she has a whole bikini !
http://www.what-a-day.com/file2.php?jid=230
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send
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,15,19},
{18,20,20,19},
{13,14,15,10},
{20,17,19,1
since your input is of fixed size, your algorithm always runs in
constant time. If the # of students and # of courses are variable, the
algorithm is O(n^2).
satya.
On 5/28/07, sl7fat <[EMAIL PROTECTED]> wrote:
>
> hi i have an algorthim code and i have to find the time complixcity of
> the code
thanx for ur help :D
On May 28, 5:22 pm, Satya <[EMAIL PROTECTED]> wrote:
> since your input is of fixed size, your algorithm always runs in
> constant time. If the # of students and # of courses are variable, the
> algorithm is O(n^2).
>
> satya.
>
> On 5/28/07, sl7fat <[EMAIL PROTECTED]> wrote:
Saddam tries out a new career move !
http://www.funnyshows.net/?id=56
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsu
I've never been so aroused by a bottle of water before in my life :)
http://www.what-a-day.com/file2.php?jid=231
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send
