Forum: Computer Science Nov 22nd, 2008 |
| Replies: 4 Views: 559 H and HD=dept size optimal; WSO= Waist-Size Optimal, [;g(n-1)]= [lg(n-1)] |
Forum: Computer Science Nov 21st, 2008 |
| Replies: 4 Views: 559 |
Forum: Computer Science Nov 20th, 2008 |
| Replies: 4 Views: 559 Dear All,
Can you help me to find something wrong on the following theorem :
THEOREM 2 : if A and B are WSO(n1, a,b) and WSO(n2,c,d). respectively, where b>=c, then A(n1) * B(n2) is... |
Forum: Computer Science Oct 28th, 2008 |
| Replies: 0 Views: 787 Dear All
I knew that te formula of time optimal and cost optimal of prefix algorithm is p=teta(n/log n). But I have information that it is the same with n=omega(p log p).
I have some question :... |
Forum: Java Oct 28th, 2008 |
| Replies: 1 Views: 426 Dear All,
I am interested to study java programming, I am collecting some sample of program. do you have a sample program of TicTacToe game?
I need a sample that the tictactoe program have a... |
Forum: Java Oct 26th, 2008 |
| Replies: 3 Views: 510 Dear All,
I have a problem with Java Programming. I am writing a TatTicToe Program but I found a Error. It is a unexpected type for mark.equals("X")? currentPlayer=1: currentPlayer=0;
I don't... |