Hi guys, Can you suggest me a free web (browser) tester and can I hear your opinions about this testers? Thank you.

Member Avatar
Member Avatar
+0 forum 1

I need to create a palindrome tester program that ignores spaces, punctuation and uppercase/lowercase to determine if the string given to the user is a palindrome (same beginning to end as end to beginning). HERE'S WHAT I HAVE SO FAR: String str, another = "y"; int left, right; Scanner scan = new Scanner(System.in); while(another.equalsIgnoreCase("y")) { System.out.println("Enter a potential palindrome: "); str = scan.nextLine(); left = 0; right = str.length() - 1; while(str.charAt(left) == str.charAt(right) && left < right) { left++; right--; } System.out.println(); if(left < right) System.out.println("That string is NOT a palindrome."); else System.out.println("That string IS a palindrome."); System.out.println( ); …

Member Avatar
Member Avatar
+0 forum 3

Hi everyone! I've built prime testers and prime listers before, but they only work sufficiently fast for values <= 1e6. I was thinking about all the prime tester projects they have going on, how do they test very large numbers for primality? I'm talking numbers on the order 1e12, 1e13, or perhaps even larger (I don't know the currently feasible upper limit). Are there special numerical methods, algorithms, or tests to check large numbers? If so, please share. I'm very interested in how this works. Thanks! To get started, I'll list my own prime lister (I don't know if something …

Member Avatar
Member Avatar
+0 forum 9

Hi All, I am Jwalant Rawat, working as a Software Tester in Patni Computers System. At present I am located in India. Development was always my passion, but testing impressed me more. So I started with testing. My other area of interests is Machine Translation. I hope to have good/quality time in this community. Thanks, Jwalant Rawat

Member Avatar
Member Avatar
+0 forum 1

The End.