//info: Based on the above algorithm I need to "find the integer square root of a large integer x" which means by giving an input "Large integer x", and a large integer n such that n*n = x, if such n does not exist, return -1.

I only need Python code for the above details.

Thanks!

I write this Algorithm to find out a very large integer number. How can I implement this Algorithm in Python? And also, I was wondering you to add Complexity Analysis Thank you! TofindLargeInteger Square (largeInteger x) { largelnteger lowestNumber, middle Number, highestNumber lowestNumber = 2 highestNumber = x/2 while (lowestNumber