VBnet program to find the prime numbers between 100 to 200?
you take the biggest number and subtract it by the smallest number.
Java is not better than VBNet, nor is VBNet better than Java. Eachone has its advantages and disadvantaged over the other one.
it would have to be the biggest number
Take the biggest number and subtract it by the smallest number
There is no smallest number and no biggest number. Given any big number, however big, it is always possible to find one that is bigger (and the same with the smallest).
It is just a different coding language, but C is more for business that VBNET
x
Take the biggest number(9) and subtract it by the smallest number(1)
An instance in VBNet is the same as an instance in any other language; it is the realisation of a type. In object-oriented languages, like VBNet, we say that an object is an instance of a class, where the class defines the object's type.
An instance in VBNet is the same as an instance in any other language; it is the realisation of a type. In object-oriented languages, like VBNet, we say that an object is an instance of a class, where the class defines the object's type.
There is no such number as if you ever find one, add 1 to it and then you'll have an even larger number.