Big O notation — while loops + for loops

Question

How do I find big O notation for this algorithm?

Find Base(N,B)   // N>=1 and B>=2
    index <- 0
    while N > 0 do
       A[index] <- N % B