Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public class Rekurzij {
- private static final String String = null;
- int zbirCifara(int n)
- {
- n=Math.abs(n);
- if (n<10)
- return n;
- return n%10+zbirCifara(n/10);
- }
- int maxNiza( int []a, int n)
- {
- if(n==1)
- return a[n-1];
- int m=maxNiza(a,n-1);
- return (m>a[n-1]?m:a[n-1]); //ili math.max(m,a[n-1])
- }
- void printBinary(int n)
- {
- if(n<2)
- {
- System.out.print(n);
- return;
- }
- printBinary (n/2);
- System.out.print(n%2);
- }
- long bin1 (int n)
- {
- if (n<2)
- return n;
- return (n%2)+bin1(n/2)*10; //
- }
- String bin2(int n)
- {
- /*Integer.toString
- */
- if(n<2)
- return "".concat("".valueOf(n));
- return bin2(n/2)+"".concat("".valueOf(n%2));
- }
- // napisati binarno trazenje rekurzivno i iterativno
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement