Exponentiation
When it is a positive integer, the exponent indicates how many copies of the base are multiplied together. For example, . The base appears times in the repeated multiplication, because the exponent is . Here, is the "base", is the "exponent", and is the "power" or, more specifically, "3 raised to the 5th power".
Exponential search
In computer science, an exponential search (also called doubling search or galloping search or Struzik search) is an algorithm, created by Jon Bentley and Andrew Chi-Chih Yao in 1976, for searching sorted, unbounded/infinite lists. There are numerous ways to implement this with the most common being to determine a range that the search key resides in and performing a binary search within that range. This takes "O"(log "i") where "i" is the position of the search key in the list, if the search key is in the list, or the position where the search key should be, if the search key is not in the list.