Add files via upload

Arrays/binarysearch.java

@@ -0,0 +1,25 @@
+import java.util.*;
+public class binarysearch {
+    public static int bin(int numbers[],int key){
+        int start=0,end = numbers.length-1;
+
+        while(start<=end){
+            int mid=(start+end)/2;
+            if(numbers[mid]==key){
+                return mid;
+            }
+            if(numbers[mid]<key){
+                start=mid+1;
+            }
+            else{
+                end=mid-1;
+            }
+        }
+        return -1;
+    }
+    public static void main(String args[]){
+        int numbers[] = {1,2,6,3,5};
+        int key=6;
+        System.out.println("nu is largest : " + bin(numbers,key));
+    }
+}

Arrays/bubblesort.java

@@ -0,0 +1,27 @@
+public class bubblesort {
+    public static void bub(int arr[])
+    {
+        for(int turn=0;turn<arr.length;turn++){
+            for(int j=0;j<arr.length-1-turn;j++){
+                if(arr[j]>arr[j+1]){
+                    int temp=arr[j];
+                    arr[j]=arr[j+1];
+                    arr[j+1]=temp;
+                }
+            }
+        }
+    }
+    public static void printarr(int arr[]){
+        for(int i=0;i<arr.length;i++){
+            System.out.print(arr[i]+" ");
+        }
+        System.out.println();
+    }
+
+    public static void main(String args[]){
+    int arr[] = {1,4,1,3,2,4,3,7};
+
+    bub(arr);
+    printarr(arr);
+    }
+}

Arrays/countingsort.java

@@ -0,0 +1,36 @@
+public class countingsort {
+    public static void printarr(int arr[]){
+        for(int i=0;i<arr.length;i++){
+            System.out.print(arr[i]+" ");
+        }
+        System.out.println();
+    }
+
+    public static void count(int arr[]){
+        int largest=Integer.MIN_VALUE;
+    for(int i=0;i<arr.length;i++){
+        largest=Math.max(largest,arr[i]);
+    }
+             int count[]=new int[largest+1];
+             for(int i=0;i<arr.length;i++){
+                count[arr[i]]++;
+             }
+             //sorting
+             int j=0;
+             for(int i=0;i<count.length;i++){
+                while(count[i]>0){
+                    arr[j]=i;
+                    j++;
+                    count[i]--;
+                }
+
+             }
+    }
+
+        public static void main(String args[]){
+        int arr[] = {1,4,1,3,2,4,3,7};
+
+        count(arr);
+        printarr(arr);
+        }
+}

Arrays/eams.java

@@ -0,0 +1,16 @@
+import java.util.*;
+public class eams {
+    public static void update(int marks[]){
+        for( int i=0;i<marks.length;i++){
+            marks[i]= marks[i] + 1;
+        }
+    }
+    public static void main(String args[]){
+        int marks[]={99,98,97};
+        update(marks);
+        for( int i=0;i<marks.length;i++){
+           System.out.print(marks[i] + " ");
+        }
+        System.out.println();
+    }
+}

Arrays/fifa.java

@@ -0,0 +1,5 @@
+public class fifa {
+    public static void main(String args[]){
+    System.out.print("hello");
+    }
+}

Arrays/hiiii.java

@@ -0,0 +1,3 @@
+public class hiiii {
+
+}

Arrays/insertionsort.java

@@ -0,0 +1,26 @@
+public class insertionsort {
+    public static void printarr(int arr[]){
+        for(int i=0;i<arr.length;i++){
+            System.out.print(arr[i]+" ");
+        }
+        System.out.println();
+    }
+
+public static void insertion(int arr[]){
+    for(int i=1;i<arr.length;i++){
+        int curr=arr[i];
+        int prev=i-1;
+        while(prev>=0 && arr[prev]>curr){
+            arr[prev+1]=arr[prev];
+            prev--;
+        }
+        //insertion
+        arr[prev+1]=curr;
+     }
+}
+    public static void main(String args[]){
+    int arr[] = {1,4,1,3,2,4,3,7};
+    insertion(arr);
+    printarr(arr);
+    }
+}

Arrays/jajmo.java

@@ -0,0 +1,3 @@
+public class jajmo {
+
+}

Arrays/kadanes.java

@@ -0,0 +1,21 @@
+public class kadanes {
+    public static void kad(int numbers[])
+    {
+        int cs=0;
+        int ms=Integer.MIN_VALUE;
+        for(int i=0; i<numbers.length;i++){
+            cs += numbers[i];
+            if(cs<0){
+                cs=0;
+            }
+            ms=Math.max(cs,ms);
+
+        }
+
+        System.out.print("maxsubarray sum is :" + ms);
+    }
+    public static void main(String args[]){
+        int numbers[] = {-2,-3,4,-1,-2,1,5,-3};
+        kad(numbers);
+    }
+}

Arrays/largest.java

@@ -0,0 +1,20 @@
+import java.util.*;
+public class largest {
+    public static int getlargest(int numbers[]){
+        int largest = Integer.MIN_VALUE;
+        for(int i =0;i<numbers.length;i++){
+            if(largest<numbers[i]){
+
+                largest=numbers[i];
+            }
+        }
+        return largest;
+
+    }
+    public static void main(String args[]){
+        int numbers[] = {1,2,6,3,5};
+        System.out.println("nu is largest : " + getlargest(numbers));
+
+
+    }
+}

Arrays/linearsearch.java

@@ -0,0 +1,21 @@
+public class linearsearch {
+    public static int linea(int numbers[],int key){
+        for(int i =0;i<numbers.length;i++){
+            if(numbers[i]==key){
+                return i;
+            }
+        }
+        return -1;
+    }
+    public static void main(String args[]){
+        int numbers[]={2,4,6,8,10,12,14,16};
+        int key=10;
+        int index=linea(numbers,key);
+        if(index==-1){
+            System.out.print("not");
+        }
+        else{
+            System.out.print("key is at index " + index);
+        }
+    }
+}

Arrays/maxsubsum.java

@@ -0,0 +1,29 @@
+public class maxsubsum {
+    public static void sum(int numbers[])
+    {
+        int currsum=0;
+        int maxsum=Integer.MIN_VALUE;
+
+        for(int i =0;i<numbers.length;i++){
+            int start=i;
+            for(int j=i;j<numbers.length;j++){
+                int end=j;
+                currsum=0;
+                for(int k=start;k<=end;k++){
+                    currsum += numbers[k];
+                    }
+                    System.out.println(currsum);
+                    if(maxsum<currsum){
+                        maxsum=currsum;
+                    }
+
+            }
+
+        }
+        System.out.print("maxsum" + maxsum);
+    }
+    public static void main(String args[]){
+        int numbers[] = {1,-2,6,-1,3};
+        sum(numbers);
+    }
+}

Arrays/pairs.java

@@ -0,0 +1,15 @@
+public class pairs {
+    public static void prpai(int numbers[]){
+        for(int i =0;i<numbers.length;i++){
+            int curr=numbers[i];
+            for(int j=i+1;j<numbers.length;j++){
+                System.out.print("(" + curr + "," + numbers[j] + ")");
+            }
+            System.out.println();
+        }
+    }
+    public static void main(String args[]){
+        int numbers[] = {2,4,6,8,10};
+        prpai(numbers);
+    }
+}

Arrays/prefix.java

@@ -0,0 +1,32 @@
+public class prefix {
+    public static void maxsub(int numbers[])
+    {
+        int currsum=0;
+        int maxsum=Integer.MIN_VALUE;
+        int prefix[]=new int[numbers.length];
+        prefix[0]=numbers[0];
+        for(int i=1; i<prefix.length;i++){
+            prefix[i]=prefix[i-1]+numbers[i];
+        }
+
+        for(int i =0;i<numbers.length;i++){
+            int start=i;
+            for(int j=i;j<numbers.length;j++){
+                int end=j;
+                currsum = start ==0?prefix[end]:prefix[end]-prefix[start-1];
+
+
+                    if(maxsum<currsum){
+                        maxsum=currsum;
+                    }
+
+            }
+
+        }
+        System.out.print("maxsum" +  maxsum);
+    }
+    public static void main(String args[]){
+        int numbers[] = {1,-2,6,-1,3};
+        maxsub(numbers);
+    }
+}

Arrays/reverse.java

@@ -0,0 +1,20 @@
+public class reverse {
+    public static void reve(int numbers[]){
+        int first=0,last = numbers.length-1;
+        while(first<last){
+            int temp=numbers[last];
+            numbers[last]=numbers[first];
+            numbers[first]=temp;
+            first++;
+            last--;
+         }
+    }
+    public static void main(String args[]){
+        int numbers[]={2,4,6,8,10};
+        reve(numbers);
+        for(int i=0;i<numbers.length;i++){
+            System.out.print(numbers[i]+" ");
+        }
+        System.out.println();
+    }
+}

Arrays/selectionsort.java

@@ -0,0 +1,27 @@
+public class selectionsort {
+    public static void printarr(int arr[]){
+        for(int i=0;i<arr.length;i++){
+            System.out.print(arr[i]+" ");
+        }
+        System.out.println();
+    }
+    public static void select(int arr[]){
+        for(int i=0;i<arr.length-1;i++){
+            int minpos=i;
+            for(int j=i+1;j<arr.length;j++){
+                if(arr[minpos]>arr[j]){
+                    minpos=j;
+                }
+            }
+            int temp=arr[minpos];
+                    arr[minpos]=arr[i];
+                    arr[i]=temp;
+        }
+}
+    public static void main(String args[]){
+    int arr[] = {1,4,1,3,2,4,3,7};
+    select(arr);
+
+    printarr(arr);
+    }
+}