Uploaded February 2013 | Updated November 2026, 3 hours ago
Tutorial Level: Intermediate
In this lesson we will be solving a programming interview question to find out the number of rotations of a sorted array in O(log n) time using binary search.
Prerequisite: Knowledge of binary search algorithm. Watch previous lessons here - youtube.com/playlist?list=PL2_aWCzGMAwL3ldWlrii6YeLszojgH77j
Tutorial Level: Intermediate
In this lesson we will be solving a programming interview question to find out the number of rotations of a sorted array in O(log n) time using binary search.
Prerequisite: Knowledge of binary search algorithm. Watch previous lessons here - youtube.com/playlist?list=PL2_aWCzGMAwL3ldWlrii6YeLszojgH77j






![Verify a Prime number - Trial division method
See complete series on maths problems here:
http://www.youtube.com/playlist?list=PL2_aWCzGMAwLL-mEB4ef20f3iqWMGWa25&feature=view_all
In this lesson, we will write a simple program to verify whether a given number is prime or not. The tutorial only describes the algorithm and gives a pseudo-code.
Prerequisite: Knowledge of basic programming constructs like loop.
www.mycodeschool.com is a not for profit educational initiative. You can send your feedback to mycodeschool [at] gmail [dot] com Verify a Prime number - Trial division method](https://i.ytimg.com/vi/7VPA-HjjUmU/mqdefault.jpg)



