Forum: Java Oct 31st, 2006 |
| Replies: 2 Views: 5,364 I really appreciate all your comments. I am going to start from scratch and I hope I can get your help again. I am going to do one step at a time and send it to you so you can make sure I stay on the... |
Forum: Java Oct 29th, 2006 |
| Replies: 2 Views: 5,364 I have a assignment with these requirements:
Please begin stage 1 by writing a program that creates an output file. Name the file using your userid followed by .dat. For example, I would call my... |
Forum: Computer Science Oct 12th, 2006 |
| Replies: 6 Views: 3,629 I figured it out. All inner steps should have the same answer. n(n-1) which in turn will give me 3n(n-1)/2 and from there I fugure time complexity.
Thanks
All for the help |
Forum: Computer Science Oct 3rd, 2006 |
| Replies: 6 Views: 3,629 Thanks for the help. I figured out the inner loops.
int t= a[i][j]; (n-1)+(n-2)+(n-3)+...+1=(n-1)n
2
a[i][j]=a[j][i];... |
Forum: Community Introductions Sep 28th, 2006 |
| Replies: 1 Views: 632 Hello every one. My name is lorrie and I just joined. I find it very nice that I finally have people that I can communicate with about the one thing I enjoy computers and programming. It is so nice... |
Forum: Computer Science Sep 28th, 2006 |
| Replies: 6 Views: 3,629 I have this algorithm that is really giving e a problem can someone please help me.
void Transpose (int a[][SIZE], int n)
}
for(int=1;i<n;i++)
for(int j=i+1; j<=n; j++)
{
... |