Algorithms

Question 1

What is sequential search?

Answer 1

Searches each element sequentially

Question 2

What is binary search?

Answer 2

Examines the middle of each array, if it’s too big, eliminate the right have of the array and repeat

Question 3

What is the runtime of sequential search?

Answer 3

N

Question 4

What is the runtime of binary search?

Answer 4

Eliminates 1/2 of the array until 1 element remains, so how many divisions does it take?

Log(base 2) N

Question 5

Write a program that prints the nth Fibonacci number

Answer 5

class fibonacci
{
    static int fib(int n)
    {
        int a = 0, b = 1, c;
        if (n == 0)
            return a;
        for (int i = 2; i <= n; i++)
        {
            c = a + b;
            a = b;
            b = c;
        }
        return b;
    }

    public static void main (String args[])
    {
        int n = 9;
        System.out.println(fib(n));
    }
}