Solved

find if a number is perfect square

Posted on 2003-11-21
9
2,153 Views
Last Modified: 2013-11-13
How to find if a number is a perfect square?

I am NOT looking for the solution which says check if sqrt is integer or not
0
Comment
Question by:bsarvanikumar
9 Comments
 
LVL 8

Expert Comment

by:Rog
ID: 9800610
Could you give us more information?  How about a sample of what you are looking for?  When is this due? ;)
0
 

Author Comment

by:bsarvanikumar
ID: 9800691
for those who need clarification

I don't want this solution

int n;
cin >> n;
if (sqrt (N) == Whole Number)
  cout << "A perfect square"
else
  cout << "Not a perfect square"
 
I was hoping more in terms of bit wise operators (>>,<<,&,|) etc

 I actually read the solution in terms of bit wise operators many weeks ago. I could not recall the solution.


This is not due as in for assignment or hw. Hence I alotted only few points. Take your time and hopefully provide a solution i am looking for.

K
0
 
LVL 8

Expert Comment

by:_corey_
ID: 9801897
Perhaps then you'd be interested in researching assembly square root solutions and convert them manually?  Here is one for z80 which has a similar feel to x86:

http://www.ticalc.org/pub/83plus/asm/source/routines/_fastsqrt_.zip
0
Free Tool: Postgres Monitoring System

A PHP and Perl based system to collect and display usage statistics from PostgreSQL databases.

One of a set of tools we are providing to everyone as a way of saying thank you for being a part of the community.

 
LVL 1

Expert Comment

by:Skytzo
ID: 9802069

I came across this website which might be closer to what you are looking for.

http://www.fifi.org/cgi-bin/info2www?(gmp)Perfect+Square+Algorithm

0
 

Expert Comment

by:mem_fam
ID: 9805828
Please disregard my question if it is irrelevant, but are you sure you saw the biwise solution for N^2?
It is possible that you remember seeing the bitwise solution for checking whether the number is power of 2 - it would be indeed simple in bitwise terms:
  M is 2^N  if and only if  (M & (M-1)) equals zero (assuming N>0).
For N^2 I cannot remember anything simple (if I do, I'll let you know, of course).

Regards
0
 
LVL 1

Expert Comment

by:suma_ds
ID: 9830135
there is a very easy to do it using mod... unfortunatly i cant quite remember it but if i do ill tell u


l8rz... suma
0
 
LVL 20

Expert Comment

by:Venabili
ID: 10962993
No comment has been added to this question in more than 21 days, so it is now classified as abandoned.

I will leave the following recommendation for this question in the Cleanup topic area:
   PAQ - no points refunded (of 50)

Any objections should be posted here in the next 4 days. After that time, the question will be closed.

Venabili
EE Cleanup Volunteer
0
 

Accepted Solution

by:
RomMod earned 0 total points
ID: 11001885
Question finalized per recommendation.

RomMod
Community Support Moderator
0

Featured Post

Announcing the Most Valuable Experts of 2016

MVEs are more concerned with the satisfaction of those they help than with the considerable points they can earn. They are the types of people you feel privileged to call colleagues. Join us in honoring this amazing group of Experts.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Although it can be difficult to imagine, someday your child will have a career of his or her own. He or she will likely start a family, buy a home and start having their own children. So, while being a kid is still extremely important, it’s also …
Today, the web development industry is booming, and many people consider it to be their vocation. The question you may be asking yourself is – how do I become a web developer?
In this fifth video of the Xpdf series, we discuss and demonstrate the PDFdetach utility, which is able to list and, more importantly, extract attachments that are embedded in PDF files. It does this via a command line interface, making it suitable …

808 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question