sbsatter

class IntegerBaseConversion{
	static String numbers= "0123456789abcdef";
	public static void main(String ... args){
		if(args.length!=2){
			int n= Integer.parseInt(args[0]);
			int base= Integer.parseInt(args[1]);
			System.out.println(convertBase(n, base));
		}
	}

sbsatter

import java.util.Scanner;
class Fibonacci{
	public static void main(String ... args){
		Scanner sc= new Scanner(System.in);
		System.out.println("Enter the number of terms you are interested in");
		int n=sc.nextInt();
			
		do{
			System.out.println(n+"th term is "+fib(n));
			System.out.println("And the sum is "+sum(n));

sbsatter

import java.util.Arrays;

class RecursiveBinarySearch{
	static int elem;
	static int passNumber=1;
	public static void main(String ... args){
		elem=Integer.parseInt(args[args.length-1]);
		int [] array;
		if(args.length!=0){
			array= new int [args.length-1];

sbsatter

import java.util.Scanner;
class SelectionSort{
	public static void main(String ... args){
		int [] unsorted;
		if(args.length!=0){
			unsorted= new int [args.length];
			int i=0;
			for(String s: args){
				unsorted[i++]=Integer.parseInt(s);
			}

sbsatter

class BubbleSort{
	public static void main(String [] args){
		int [] unsorted= {9,8,7,6,5,4,3,2,1};
		if(args.length!=0){
			unsorted= new int [args.length];
			for(int i=0; i<args.length; i++){
				unsorted[i]=Integer.parseInt(args[i]);
			}
		}
		System.out.println("STARTING SORTING");

sbsatter

import java.util.Arrays;

class BinarySearch{
	public static void main(String ... args){
		int [] array;
		if(args.length!=0){
			array= new int [args.length-1];
			
			for(int i=0; i<args.length-1; i++){
				array[i]=Integer.parseInt(args[i]);