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, sl7fa
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
