Airtribe_DSA_12/Class5.java at main · vipuljain28/Airtribe_DSA_12 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
public class Class5 {

    public static int capacityToShip(int []arr,int days)
    {
        int s=0;
        int e=0;
        for(int x:arr)
        {
            s=Math.max(s,x);
            e=e+x;
        }

        while(s<e)
        {
            int midVal=(s+e)/2;
            if(isPossible(arr,days,midVal))
                e=midVal;
            else
                s=midVal+1;
        }
        return s;
    }
    public static boolean isPossible(int []arr,int days,int cap)
    {
        int dayUsed=1;
        int currWt=0;

        for(int wt:arr)
        {
            currWt+=wt;
            if(currWt>cap)
            {
                dayUsed++;
                currWt=wt;
            }
        }
        if(dayUsed>days)
            return false;
        else
            return true;

    }

    public static int [] mergeSort(int []arr,int s,int e)
    {
        if(s==e)
            return new int[]{arr[s]};
        int midIdx=(s+e)/2;
        int []lsa=mergeSort(arr,s,midIdx);
        int []rsa=mergeSort(arr,midIdx+1,e);
        int []fsa=merge2SortedArray(lsa, rsa);
        return fsa;
    }
    public static int [] merge2SortedArray(int []arr1,int []arr2)
    {
        int []ans=new int[arr1.length+arr2.length];
        int i=0;
        int j=0;
        int k=0;
        while(i<arr1.length && j<arr2.length)
        {
            if(arr1[i]<arr2[j])
            {
                ans[k]=arr1[i];
                i++;
                k++;
            }
            else
            {
                ans[k]=arr2[j];
                k++;
                j++;
            }
        }
        while(i<arr1.length)
        {
            ans[k]=arr1[i];
            i++;
            k++;
        }
        while(j<arr2.length)
        {
            ans[k]=arr2[j];
            k++;
            j++;
        }
        return ans;
    }


    public static void quickSort(int []arr,int s,int e)
    {
        if(s>e)
            return;
        int pivotEle=arr[e];
        int pi=partation(arr, s, e, pivotEle);
        quickSort(arr,s,pi-1);
        quickSort(arr, pi+1, e);
    }
    public static int partation(int arr[],int s,int e,int pivotEle)
    {
        int i=s;
        int j=s;
        while(i<=e)
        {
            if(arr[i]<=pivotEle)
            {
                swap(arr,i,j);
                i++;
                j++;
            }
            else
                i++;
        }
        return j-1;
    }
    public static void swap(int []arr,int i,int j)
    {
        int temp=arr[i];
        arr[i]=arr[j];
        arr[j]=temp;
    }

    public static void InsertionSort(int []arr)
    {
        for(int i=1;i<arr.length;i++)
        {
            int ele=arr[i];
            int j=i-1;
            while(j>=0 && arr[j]>ele)
            {
                arr[j+1]=arr[j];
                j--;
            }
            arr[j+1]=ele;
        }
    }
    public static void main(String[] args) {
        int []arr={5,2,8,10,1,0,11,14};
        // quickSort(arr,0,arr.length-1);
        InsertionSort(arr);
        for(int x:arr)
            System.out.print(x+" ");
    }
}