Pseudocode Quiz 1

int sum (int A[], int n){

int sum = 0, i;

for (i = 0; i < n; i++) ------- line 1

sum = sum + A[i];

return sum;

}

function (input a, input b)

  	if (a > b)

 		 return function (b, a)

  	elseif (b != 0)

  		return (a + function (a, b - 1))

  	else

  		return 0

function(6,8)

Input m = 12, n = 4

m = m - 1 ;

n = n + 1 ;

m = m + n ;

n = n - 1 ;

Print m,n

Input i=8,j=9

Function ( i , j )

 for x=1 to x=5

	If i < j 

		i++

	Else 

		j++

print( i, j )

Input i=8,j=9

Function ( i , j )

 for x=1 to x=5

	If i < j 

		i++

	Else 

		j++

print( i, j )

function(int n)

   if (n <= 1)

      return n

   return function(n-1) + function(n-2)

End of function

main ()

   int n = 9

  printf("%d", function(n))

  return 0

End of main

function (int n)

{

    int a = 0, b = 1, c, i;

    if( n == 0)

    		return a;

    for (i = 2; i <= n; i++)

    {

    		c = a + b;

    		a = b;

    		b = c;

    }

    return b;

}



int main ()

{

    int n = 9;

    printf("%d", function(n));

    return 0;

}

public void func (Tree root)

{

      func (root.left ());

      func (root.right ());

      System.out.println (root.data ());

}

initialize char c

set c = ‘f’

print "%d",c