Skip to content

Commit dc99da7

Browse files
lakshaycodesgitlakshaycodesgit
committed
new
1 parent 57b1540 commit dc99da7

6 files changed

Lines changed: 129 additions & 6 deletions

File tree

‎.idea/modules.xml‎

Lines changed: 1 addition & 0 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

Recursion/src/arrays/pattern.java renamed to Recursion/src/pattern.java

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,3 @@
1-
package arrays;
2-
31
public class pattern {
42
public static void main(String[] args) {
53
// star(4,0);

‎Sorting2/Sorting2.iml‎

Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
<?xml version="1.0" encoding="UTF-8"?>
2+
<module type="JAVA_MODULE" version="4">
3+
<component name="NewModuleRootManager" inherit-compiler-output="true">
4+
<exclude-output />
5+
<content url="file://$MODULE_DIR$">
6+
<sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
7+
</content>
8+
<orderEntry type="inheritedJdk" />
9+
<orderEntry type="sourceFolder" forTests="false" />
10+
</component>
11+
</module>

‎Sorting2/src/MergeSort.java‎

Lines changed: 88 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,88 @@
1+
import java.util.Arrays;
2+
3+
public class MergeSort {
4+
public static void main(String[] args) {
5+
int[] arr = {-1,2,6,5,4,7,8,9,11,0};
6+
System.out.println(Arrays.toString(sort(arr)));
7+
sortinplace(arr,0, arr.length);
8+
System.out.println(Arrays.toString(arr));
9+
10+
}
11+
12+
private static void sortinplace(int[] arr,int s , int e) {
13+
if(e-s==1)
14+
return;
15+
int mid = (e + s)/2;
16+
sortinplace(arr,s,mid);
17+
sortinplace(arr,mid,e);
18+
mergeplace(arr,s,mid,e);
19+
}
20+
private static void mergeplace(int[] arr , int s, int m , int e){
21+
int[] mix = new int[e-s];
22+
int i = s;
23+
int j = m;
24+
int k = 0;
25+
while(i<m && j<e){
26+
if(arr[i]>arr[j]) {
27+
mix[k] = arr[j];
28+
j++;
29+
}
30+
else {
31+
mix[k] = arr[i];
32+
i++;
33+
}
34+
k++;
35+
}
36+
while(i<m){
37+
mix[k]=arr[i];
38+
i++;
39+
k++;
40+
}
41+
while(j<e){
42+
mix[k]=arr[j];
43+
j++;
44+
k++;
45+
}
46+
47+
for(i = 0 ; i < mix.length ; i++){
48+
arr[s+i]=mix[i];
49+
}
50+
51+
}
52+
53+
private static int[] sort(int[] arr) {
54+
if(arr.length==1)
55+
return arr;
56+
int mid = arr.length/2;
57+
int[] left = sort(Arrays.copyOfRange(arr,0,mid));
58+
int[] right = sort(Arrays.copyOfRange(arr,mid,arr.length));
59+
return merge(left, right);
60+
}
61+
62+
private static int[] merge(int[] first, int[] second) {
63+
int[] mix = new int[first.length+second.length];
64+
int i=0,j=0,k=0;
65+
while(i<first.length && j<second.length){
66+
if(first[i]<second[j]) {
67+
mix[k] = first[i];
68+
i++;
69+
}
70+
else{
71+
mix[k]=second[j];
72+
j++;
73+
}
74+
k++;
75+
}
76+
while(i<first.length){
77+
mix[k]=first[i];
78+
i++;
79+
k++;
80+
}
81+
while(j<second.length){
82+
mix[k]=second[j];
83+
j++;
84+
k++;
85+
}
86+
return mix;
87+
}
88+
}

Recursion/src/arrays/bubblesort.java renamed to Sorting2/src/bubblesort.java

Lines changed: 2 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,18 +1,16 @@
1-
package arrays;
2-
31
import java.util.Arrays;
42

53
public class bubblesort {
64
public static void main(String[] args) {
75
int[] arr = {2,6,5,4,1,3,9,11,-1,0};
8-
System.out.println(Arrays.toString(sort(arr,arr.length,0)));
6+
System.out.println(Arrays.toString(sort(arr,arr.length-1,0)));
97
}
108
static int[] sort(int[] arr,int i,int j){
119
if(i==0){
1210
return arr;
1311
}
1412
if(j<i) {
15-
if (j< arr.length-1 && arr[j] > arr[j + 1]) {
13+
if (arr[j] > arr[j + 1]) {
1614
int temp = arr[j];
1715
arr[j] = arr[j + 1];
1816
arr[j + 1] = temp;

‎Sorting2/src/selectionsort.java‎

Lines changed: 27 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,27 @@
1+
import java.util.Arrays;
2+
3+
4+
public class selectionsort {
5+
public static void main(String[] args) {
6+
int[] arr = {-1,2,6,5,4,7,8,9,11,0};
7+
System.out.println(Arrays.toString(sort2(arr,arr.length-1,0, 0
8+
)));
9+
}
10+
11+
static int[] sort2(int[] arr, int i, int j,int max) {
12+
if(i==0)
13+
return arr;
14+
if(j<i){
15+
if(arr[j]>arr[max]) {
16+
max = j;
17+
}
18+
return sort2(arr,i,++j,max);
19+
}
20+
else{
21+
int temp = arr[max];
22+
arr[max] = arr[i];
23+
arr[i] = temp;
24+
return sort2(arr,--i,0,i);
25+
}
26+
}
27+
}

0 commit comments

Comments
 (0)