Modular exponentiation - using Recursion @mycodeschool

Modular exponentiation - using Recursion @mycodeschool

Uploaded October 2012 | Updated September 2026, 2 weeks ago

See complete series on recursion here
youtube.com/playlist?list=PL2_aWCzGMAwLz3g66WrxFGSXvSsvyfzCO
In this lesson, we will see an efficient recursive algorithm to calculate (x^n)%M - (x to power n modulo n)

Prerequisite: Basic knowledge of recursion in programming.

Modular exponentiation - using Recursion

Time and space complexity analysis of recursive programs - using factorial

Maximum sum sub-array

Data structures: Array implementation of Queue

Count occurrences of a number in a sorted array with duplicates using Binary Search

Data structures: Binary Search Tree

Introduction to sorting algorithms

Time Complexity analysis of recursion - Fibonacci Sequence

Data structures: Introduction to Trees

Data structures: Array implementation of stacks

Pointers and 2-D arrays

Reverse a linked list - Iterative method

Modular exponentiation - using Recursion