neviete kedy sa pisu zapocty z OS? aspon opakujuci?
kleinova 13:30 streda
kleinova 13:30 streda
This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.
Zobrazi� pr�spevky Menupublic class keksa extends AbstractItem{
public keksa(){
super("nazov", "popis");
}
kontrola prikazu -> if(ak je za prikazom daco){oreze a vybere parameter} else {hlaska: zly parameter};
Quote from: visvk on 21.10.2011, 02:50:16
ja som to robil takto, ale nefunguje to, lebo neviem preco stale maze aj ten S
void PrintStack( Stack S )
{
Stack L=S;
while( !IsEmpty( L ) ){
printf ("%d",L->TopOfStack);
--L->TopOfStack;
}
putchar('\n');
}
Quote from: paloSK on 21.10.2011, 02:27:08Quote from: charlie on 21.10.2011, 02:16:53Ja to mam takto void
vie dakto urobit PrintStack(Stack S) ? bo ja s tym babrem uz tyzden a nic
PrintStack( Stack S )
{
int i;
printf(" | ");
if( IsEmpty( S ) )
printf( "Empty stack " );
for(i=0;i<= S->TopOfStack; i++)
printf("%d ",S->Array);
printf("\n");
}
Quote from: veteran on 03.10.2011, 23:03:07Quote from: tomas4578 on 03.10.2011, 22:33:40Mne vyšlo len log2 n. Bez tej dvojky na začiatku.
aj vám vyšlo 2lognpriestorová logaritmická zložitosť???
Quote from: xxx3 on 04.10.2011, 00:06:08
a ta uniformna casova a priestorova postupnost sa ako pocita ? ... inak je to v tom cviceni c2 na moodli a inak to mam v zosite, co robil cviciaci
S(n) = 4 je na moodli pre faktorial a S(n)=3 (akoze 3 registre) je podla cviciaceho ... tak ako to je ? .. a ta casova sa tiez ako robi ?