Function to reverse an integer array

This function(ReverseArray is used to reverse an integer array. For example, if the

array is {1,2,3,4,5}, these functions will return an array like {5,4,3,2,1}.

The user needs to pass in a pointer to the array and the size of the array,

and the function will return a pointer to an array in the reverse order. 

Array

The array keyword lets you create a dynamic array that is allocated on the common language runtime heap.

[qualifiers] [cli::]array<[qualifiers]type1[, dimension]>^ var = 
gcnew [cli::]array<type2[, dimension]>(val[,val...])

String Contains function

The strContains function returns true or false depending on whether the input string contains the search string. If you have ever used the contains function in C# or VB then you may know how useful it can be.

Power series determinan (jeliot 3)

import jeliot.io.*;

public class calculate {

    public void input(){
    System.out.println("specify the value n:");
    n=Input.readInt();

Program determines the leap year (Jeliot 3)

import jeliot.io.*;

public class leap {
    public static void main() {
 

FOUND GCD WITH JELIOT 3

import jeliot.io.*;

public class MyClass {
    public static void main() {
int a=4,b=3,c=0;

Java programming exercise (Jeliot 3)

Jeliot 3 is a Program Visualization application. It visualizes how a Java program is interpreted. Method calls, variables, operation are displayed on a screen as the animation goes on, allowing the student to follow step by step the execution of a program. Programs can be created from scratch or they can be modifyed from previously stored code examples.

RECCURENCE RELATION

use the iteration scheme for a SERIES of ISSUES the formula can be expressed in relationship/recurring relationship, which concerns the issue of accuracy of the representation of numbers on a computer.

Example :

Recursion

Recursion is a programming technique that allows the programmer to express operations in terms of themselves. In C++, this takes the form of a function that calls itself. A useful way to think of recursive functions is to imagine them as a process being performed where one of the instructions is to "repeat the process". This makes it sound very similar to a loop because it repeats the same code, and in some ways it is similar to looping.

Recursion Shortest Function to Reverse a String

/*
Recursive Reverse String Algorithm

The Shortest function to reverse a string.


*/

Calculator (C++)

This code (program) allows you to choose what calculations you want. Like Addition and Multiplication. It uses the switch statement. this is only a very simple calculator and can only calculate two numbers at a time. Now it uses a loop and quits when you want it to.

Recursive Format numbers with commas

 You may also like to use the enclosed snippet that demo's a way to validate if a C++ string represents an integer.

// validates string 's' passed in and extracts a front sign (if there) into char var 'sign'
bool isInt( string& s, char& sign ); // Note: string without a 'sign' is returned

Calling functions with Inline Assembly

Compiles under Visual C++ 2008 as a console application and should compile with Visual C++ 2005

Recursive Function

A recursive function is a function that calls itself. This function will continue to run until the stop condition is met, therefore in a recursive function needs to be there are 2 important blocks, namely block that became the point stop from a process of recursion and the block that is calling itself.

Algoritma Menentukan Tahun Kabisat

Tahun Kabisat adalah :
- Tahun yang habis dibagi 4
- Jika tahun habis dibagi 100, maka Tahun tersebut juga harus habis dibagi 400

Algoritma dan Class Bilangan Prima

ALGORITMA BILANGAN PRIMA

KAMUS :

i     : integer

bil   : integer

prima : boolean

Class Luas Lingkaran dan Volume Bola With Jeliot

 Class Menghitung Luas Lingkaran dan Volume Bola

Class Bilangan [Bahasa C++]

Class Berikut contoh program C++ tentang class bilangan semoga berguna


#include <iostream.h>

class Bilangan{
friend istream& operator>>(istream&, Bilangan&);
friend ostream& operator<<(ostream&, const Bilangan&);

Struktur Perulangan (Lanjutan)

Dalam bahasa pemograman, proses perulangan ditanganni dengan mekanisme yang dinamakan dengan LOOP. Dengan mekanisme Loop ini, suatu proses yang berulang dapat diimplementasikan dengan pernyataan-pernyataan yang relatif pendek.