Cara Memeriksa Apakah Nomor Perdana atau Tidak di C++

Ditulis olehAdi Gunawan -
To understand this example, you should have knowledge of following C++ programming topics:
A positive integer which is only divisible by 1 and itself is known as prime number. For example: 13 is a prime number because it is only divisible by 1 and 13 but, 15 is not prime number because it is divisible by 1, 3, 5 and 15.
Artikel Terkait Tutorial C

C++ program to Check Prime Number

Examples C++ Objects and Class, C++ Constructors Tutorials, Coding C++ Objects & Function, Program C++ Operator Overloading
 
 
Output

Enter a positive integer: 29
This is a prime number.


Enter a positive integer: 12
This is not a prime number.
This program takes a positive integer from user and stores it in variable n. Then, for loop is executed which checks whether the number entered by user is perfectly divisible by i or not starting with initial value of i equals to 2 and increasing the value of i in each iteration. If the number entered by user is perfectly divisible by i then, flag is set to 1 and that number will not be a prime number but, if the number is not perfectly divisible by i until test condition i<=n/2 is true means, it is only divisible by 1 and that number itself and that number is a prime number.

Tag :  Examples C++ Objects and Class, C++ Constructors Tutorials, Coding C++ Objects & Function, Program C++ Operator Overloading

Selain Sebagai Penyedia Panduan Belajar Database dan Tutorial Pemrograman, Kami Juga Membagikan Kumpulan Source Code Program Aplikasi dan Ebook Pemrograman Terlengkap yang Bisa Anda Dapatkan Secara Gratis di Halaman :


Rekomendasi Web Hosting
  1. 20rb perbulan. Diskon hingga 40% kode kupon: MCP Daftar disini.
  2. 10rb perbulan. Diskon hingga 75% kode kupon: MCP Daftar disini.
  3. 10rb perbulan. Diskon hingga 70% kode kupon: aff-MCP Daftar disini.
Tag