113481Sgiacomo.travaglini@arm.com// Copyright 2005, Google Inc. 213481Sgiacomo.travaglini@arm.com// All rights reserved. 313481Sgiacomo.travaglini@arm.com// 413481Sgiacomo.travaglini@arm.com// Redistribution and use in source and binary forms, with or without 513481Sgiacomo.travaglini@arm.com// modification, are permitted provided that the following conditions are 613481Sgiacomo.travaglini@arm.com// met: 713481Sgiacomo.travaglini@arm.com// 813481Sgiacomo.travaglini@arm.com// * Redistributions of source code must retain the above copyright 913481Sgiacomo.travaglini@arm.com// notice, this list of conditions and the following disclaimer. 1013481Sgiacomo.travaglini@arm.com// * Redistributions in binary form must reproduce the above 1113481Sgiacomo.travaglini@arm.com// copyright notice, this list of conditions and the following disclaimer 1213481Sgiacomo.travaglini@arm.com// in the documentation and/or other materials provided with the 1313481Sgiacomo.travaglini@arm.com// distribution. 1413481Sgiacomo.travaglini@arm.com// * Neither the name of Google Inc. nor the names of its 1513481Sgiacomo.travaglini@arm.com// contributors may be used to endorse or promote products derived from 1613481Sgiacomo.travaglini@arm.com// this software without specific prior written permission. 1713481Sgiacomo.travaglini@arm.com// 1813481Sgiacomo.travaglini@arm.com// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 1913481Sgiacomo.travaglini@arm.com// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 2013481Sgiacomo.travaglini@arm.com// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 2113481Sgiacomo.travaglini@arm.com// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 2213481Sgiacomo.travaglini@arm.com// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 2313481Sgiacomo.travaglini@arm.com// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 2413481Sgiacomo.travaglini@arm.com// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 2513481Sgiacomo.travaglini@arm.com// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 2613481Sgiacomo.travaglini@arm.com// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 2713481Sgiacomo.travaglini@arm.com// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 2813481Sgiacomo.travaglini@arm.com// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 2913481Sgiacomo.travaglini@arm.com 3013481Sgiacomo.travaglini@arm.com// A sample program demonstrating using Google C++ testing framework. 3113481Sgiacomo.travaglini@arm.com// 3213481Sgiacomo.travaglini@arm.com// Author: wan@google.com (Zhanyong Wan) 3313481Sgiacomo.travaglini@arm.com 3413481Sgiacomo.travaglini@arm.com#include "sample1.h" 3513481Sgiacomo.travaglini@arm.com 3613481Sgiacomo.travaglini@arm.com// Returns n! (the factorial of n). For negative n, n! is defined to be 1. 3713481Sgiacomo.travaglini@arm.comint Factorial(int n) { 3813481Sgiacomo.travaglini@arm.com int result = 1; 3913481Sgiacomo.travaglini@arm.com for (int i = 1; i <= n; i++) { 4013481Sgiacomo.travaglini@arm.com result *= i; 4113481Sgiacomo.travaglini@arm.com } 4213481Sgiacomo.travaglini@arm.com 4313481Sgiacomo.travaglini@arm.com return result; 4413481Sgiacomo.travaglini@arm.com} 4513481Sgiacomo.travaglini@arm.com 4613481Sgiacomo.travaglini@arm.com// Returns true iff n is a prime number. 4713481Sgiacomo.travaglini@arm.combool IsPrime(int n) { 4813481Sgiacomo.travaglini@arm.com // Trivial case 1: small numbers 4913481Sgiacomo.travaglini@arm.com if (n <= 1) return false; 5013481Sgiacomo.travaglini@arm.com 5113481Sgiacomo.travaglini@arm.com // Trivial case 2: even numbers 5213481Sgiacomo.travaglini@arm.com if (n % 2 == 0) return n == 2; 5313481Sgiacomo.travaglini@arm.com 5413481Sgiacomo.travaglini@arm.com // Now, we have that n is odd and n >= 3. 5513481Sgiacomo.travaglini@arm.com 5613481Sgiacomo.travaglini@arm.com // Try to divide n by every odd number i, starting from 3 5713481Sgiacomo.travaglini@arm.com for (int i = 3; ; i += 2) { 5813481Sgiacomo.travaglini@arm.com // We only have to try i up to the squre root of n 5913481Sgiacomo.travaglini@arm.com if (i > n/i) break; 6013481Sgiacomo.travaglini@arm.com 6113481Sgiacomo.travaglini@arm.com // Now, we have i <= n/i < n. 6213481Sgiacomo.travaglini@arm.com // If n is divisible by i, n is not prime. 6313481Sgiacomo.travaglini@arm.com if (n % i == 0) return false; 6413481Sgiacomo.travaglini@arm.com } 6513481Sgiacomo.travaglini@arm.com 6613481Sgiacomo.travaglini@arm.com // n has no integer factor in the range (1, n), and thus is prime. 6713481Sgiacomo.travaglini@arm.com return true; 6813481Sgiacomo.travaglini@arm.com} 69