Programming Interview: Calculate Power(x,N) using Divide and Conquer

This video lecture is produced by S. Saurabh. He is B.Tech from IIT and MS from USA. Calculate x to the power of N power(x,N) such that its time complexity is O(log(N)) Write a C program to calculate pow(x,n) This channel is an ultimate guide to prepare for job interviews for software engineers, software test engineers, computer scientists, engineering students specially computer science and IT engineers, Master of Computer Application (MCA) and Bachelor of Computer Application (BCA) students. The content of this channel will help students prepare for C,C++, Java, data structures and algorithms. It also covers courses related to networking and database. To study interview questions on Linked List watch http://www.youtube.com/playlist?list=PL3D11462114F778D7&feature=view_all To prepare for programming Interview Questions on Binary Trees http://www.youtube.com/playlist?list=PLC3855D81E15BC990&feature=view_all To study programming Interview questions on Stack, Queues, Arrays visit http://www.youtube.com/playlist?list=PL65BCEDD6788C3F27&feature=view_all To watch all Programming Interview Questions visit http://www.youtube.com/playlist?list=PLD629C50E1A85BF84&feature=view_all To learn about Pointers in C visit http://www.youtube.com/playlist?list=PLC68607ACFA43C084&feature=view_all To learn C programming from IITian S.Saurabh visit http://www.youtube.com/playlist?list=PL3C47C530C457BACD&feature=view_all "divide and conquer power function " "algorithm power x N" "integer power algorithm" "x power n using recursion c" "Recursive function power(base,exponent)‎" "Write a C program to calculate pow(x,n)"