0
Still curious? Ask our experts.
Chat with our AI personalities
Fran
Beau
MaxineAdd your answer:
Earn +20 pts
How do you create a string and reverse a string in visual basic?
Dim x As String x = "HELLO" Dim tmpString As String tmpString = Nothing For j = 0 To x.Length - 1 Dim int int=x.Length - 1 int=int-j tmpString=x(j) Next
Program to find reverse of given number using pointers?
#include #include void main() { int rev num=0; while(num>0) { rev num=rev num*10+num%10; num=num%10; } return rev_num; } int main(); { int num=4562; printf("reverse of number is%d",reverse digit(num)); getch(); return o; }
How do you display prime number in Microsoft visual studio 6.0?
Function is_prime(ByVal num As Integer) As Boolean If num < 0 Then num = num * -1 If num < 2 Then Return False If num Mod 2 = 0 Then Return num = 2 Dim max As Integer = Math.Sqrt(num) For div As Integer = 3 To max Step 2 If num Mod div = 0 Then Return False Next Return True End Function Sub Main() For num As Integer = 0 To 100 If is_prime(num) Then Console.Write(num) Console.WriteLine(" is prime") End If Next End Sub
How do you print the series of prime number between 11 to 100?
#include<iostream> bool is_prime (const unsigned num) { return num%2 && num%3 && num%5 && num%7; } int main() { for (unsigned num=11; num<=100; ++num) if (is_prime (num)) std::cout<<num<<std::endl; } Output: 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97
Composite numbers from 1-10 in c plus plus programming?
#include<iostream> bool is_composite (const size_t); bool is_prime (const size_t); int main() { for (size_t num=1; num<=10; ++num) if (is_composite (num)) std::cout << num << " is composite\n"; } bool is_composite (const size_t num) { if (num < 4U) return false; return !is_prime (num); } bool is_prime (const size_t num) { const size_t two = 2U; if (num < two) return false; if (!(num % two)) return num == two; const size_t max = static_cast<size_t>(sqrt (static_cast<double>(num))); for (size_t div = 3U; div <= max; div += two) if (!(num % div)) return false; return true; }
