public static int divisionFor(int a, int b){
int n;
if(b>a)
return 0;
else
for(n=1;a>b;n++)
a-=b;
return n;
}
public static int divisionDoWhile(int a, int b){
int n=1;
if(b>a)
return 0;
else{
do{
a-=b;
n++;
}while(a>b);
}return n;
}
public static int divisionWhile(int a, int b){
int n=1;
if(b>a)
return 0;
else{
while(a>b){
a-=b;
n++;
}
}return n;
}
public static int division (int a, int b) {
if(b > a) {
return 0;
}
else {
return division(a-b, b) + 1;
}
}
public int factorialFor(int n){
int fact;
if(n==0)
return 1;
else{
for(fact=1;n>0;n--){
fact*=n;
}
}return fact;
}
public static int factorialDoWhile(int n){
int fact=1;
if(n==0)
return 1;
else
do{
fact*=n;
n--;
}while(n>0);
return fact;
}
public static int factorialWhile(int n){
int fact=1;
if(n==0)
return 1;
else{
while(n>0){
fact*=n;
n--;
}
}return fact;
}
public static int factorial(int n){
if(n==0){
return 1; //Caso Base
}
else {
return n * factorial(n-1); //Frmula Recursiva
}
}
public static int fibonaciFor(int n){
int suma=0;
int cont=2;
int anterior=1;
int siguiente=1;
if(n==1||n==2)
return 1;
else
for(cont=2;cont!=n;cont++){
suma=siguiente+anterior;
anterior=siguiente;
siguiente=suma;
}
return suma;
}
public static int fibonaciDowhile(int n){
int suma=0;
int cont=2;
int anterior=1;
int siguiente=1;
if(n==1||n==2)
return 1;
else{
do{
suma=siguiente+anterior;
anterior=siguiente;
siguiente=suma;
cont++;
}while(cont!=n);
}return suma;
}
public static int fibonaciWhile(int n){
int suma=0;
int cont=2;
int anterior=1;
int siguiente=1;
if(n==1||n==2)
return 1;
else{
while(cont!=n){
suma=siguiente+anterior;
anterior=siguiente;
siguiente=suma;
cont++;
}
}return suma;
}
public static int fibonaci(int n){
if(n==1 || n==2) {
return 1;
}
else{
return fibonaci(n-1)+fibonaci(n-2);
}
}
public static int invertirFor(int n){
int inv;
if(n0;n/=10)
inv=inv*10+(n%10);
return inv;
}
public static int invertirDoWhile(int n){
int inv=0;
if(n0);
return inv;
}
public static int innvertirWhile(int n){
int inv=0;
if(n0){
inv=inv*10+(n%10);
n/=10;
}
}return inv;
}
public static int invertir (int n) {
if (n < 10) { //caso base
return n;
}
else {
return invertir(n%10)*100+invertir(n%10)*10+(n/100);
}
}
public static int sumarFor(int n){
int suma;
if(n0;n/=10){
suma+=(n%10);
}
return suma;
}
public static int sumarDoWhile(int n){
int suma=0;
if(n0);
return suma;
}
public static int sumarWhile(int n){
int suma=0;
if(n0){
suma=suma+(n%10);
n/=10;
}
}return suma;
}
public static int sumar_dig (int n) {
if (n == 0) { //caso base
return n;
}
else {
return sumar_dig(n/10) + (n % 10);
}
}
![Selection Sort - cs.appstate.edu · selectionSort() public static void selectionSort(int[] arr) {// index of smallest element in the sublist int smallIndex; int pass, j, n = arr.length;](https://img.pdfslide.us/doc/110x75/5f7405248b63bf4c08084ac5/selection-sort-cs-selectionsort-public-static-void-selectionsortint-arr.jpg)
![1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://img.pdfslide.us/doc/110x75/56649d8b5503460f94a7192b/1-public-class-josephus-private-static-class-node-int-val-node-next-.jpg)
![Algorithms and Java basics: pseudocode, variables ...map/1051/f18/02dataalgorithms.pdf · public static void main (String[] args) ... input method (for int) Interactive Programs –](https://img.pdfslide.us/doc/110x75/5e810f10160e232704787018/algorithms-and-java-basics-pseudocode-variables-map1051f1802dataalgorithmspdf.jpg)
![matheusrumetna.com...Output - contoh while (run) genap BUILD 1 time: 1 E] ort swing public class Contoh while { public static void maim String[] args) int jumGenap=O, ;](https://img.pdfslide.us/doc/110x75/604c6685cc7e830a4e47e8e6/-output-contoh-while-run-genap-build-1-time-1-e-ort-swing-public-class.jpg)
![1 Programmation événementielle. 2 Programmation séquentielle public static void main(String args[]) { Toto t = new Toto(); for (int i = 0; i < C.maxi;](https://img.pdfslide.us/doc/110x75/551d9d81497959293b8bafcd/1-programmation-evenementielle-2-programmation-sequentielle-public-static-void-mainstring-args-toto-t-new-toto-for-int-i-0-i-cmaxi.jpg)
![Nested Loops - Kirkwood Community College java.util.*; public class NestLoop {public static void main (String [] args) {int total = 0; // total for all](https://img.pdfslide.us/doc/110x75/5aedcd167f8b9a585f90c139/nested-loops-kirkwood-community-javautil-public-class-nestloop-public-static.jpg)
![Minnet (=stacken) public static int fac(int n) { if (n == 0) return 1; else return fac(n-1) * n; }..... main(String [] a) { int x; x = fac(3); System.out.println(x);](https://img.pdfslide.us/doc/110x75/56649d405503460f94a19bee/minnet-stacken-public-static-int-facint-n-if-n-0-return-1-else.jpg)
![CS 211: Linear Search, Binary Search, Sorting · Binary Search: Recursive // Easy-to-use recursive version which calls a helper public static int binarySearchR(int a[], int key){return](https://img.pdfslide.us/doc/110x75/5f618479efea1e6a8f2b4c9c/cs-211-linear-search-binary-search-sorting-binary-search-recursive-easy-to-use.jpg)
![1 Reference semantics. 2 A swap method? Does the following swap method work? Why or why not? public static void main(String[] args) { int a = 7; int b](https://img.pdfslide.us/doc/110x75/56649e535503460f94b49297/1-reference-semantics-2-a-swap-method-does-the-following-swap-method-work.jpg)
![vegafar.files.wordpress.com … · Web view07.12.2007 · public static void quicksort( int [] array, int left, int right )](https://img.pdfslide.us/doc/110x75/5a9e46af7f8b9a6a218d0d3d/web-view07122007public-static-void-quicksort-int-array-int-left-int-right.jpg)
![Heapsclass Heaps ds.util Static Methods static void adjustHeap (T[] arr, int first, int last, Comparator](https://img.pdfslide.us/doc/110x75/6021d31411d5b61bc9749d4e/heaps-class-heaps-dsutil-static-methods-static-void-adjustheap-t-arr-int-first.jpg)
![public class One { public static void main(String[] args) { int size = 10, nuf, fun;](https://img.pdfslide.us/doc/110x75/56814e4a550346895dbbd1bb/public-class-one-public-static-void-mainstring-args-int-size-10.jpg)
![class CAritmetica { /* *Operaciones aritmeticas */ public static void main (string[]args) { int dato1,dato2, resultado; dato1=20; dato2=10; //suma resultado=dato1+dato2;](https://img.pdfslide.us/doc/110x75/5665b4931a28abb57c924fae/class-caritmetica-operaciones-aritmeticas-public-static-void-main.jpg)