Skip to content

Commit 855d390

Browse files
rajatgoyal715rajatgoyal715
committed
Update Sorting solutions as per HSC
1 parent 95fe616 commit 855d390

14 files changed

Lines changed: 129 additions & 153 deletions

‎Algorithms/Sorting/BigSorting.java‎

Lines changed: 8 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,12 @@
1-
import java.util.*;
21
import java.io.*;
2+
import java.util.*;
3+
import java.text.*;
4+
import java.math.*;
5+
import java.util.regex.*;
6+
7+
public class Solution {
38

4-
class BigSorting {
5-
static String[] bigSorting(String[] arr) {
9+
static String[] bigSorting(String[] arr) {
610
Arrays.sort(arr, new Comparator<String>(){
711
public int compare(String s1, String s2){
812
int l1 = s1.length(), l2 = s2.length();
@@ -38,4 +42,4 @@ public static void main(String[] args) {
3842

3943
in.close();
4044
}
41-
}
45+
}

‎Algorithms/Sorting/ClosestNumbers.java‎

Lines changed: 3 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -1,13 +1,7 @@
1-
package Sorting;
2-
3-
import java.util.*;
41
import java.io.*;
2+
import java.util.*;
53

6-
/*
7-
* @author -- rajatgoyal715
8-
*/
9-
10-
public class ClosestNumbers {
4+
public class Solution {
115
public static void main(String[] args) {
126
Scanner sc = new Scanner(System.in);
137
int n = sc.nextInt();
@@ -30,4 +24,4 @@ else if(diff==min)
3024
}
3125
System.out.println(list);
3226
}
33-
}
27+
}

Algorithms/Sorting/CorrectnessAndTheLoopInvariant.java renamed to Algorithms/Sorting/CorrectnessandtheLoopInvariant.java

Lines changed: 5 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -1,13 +1,8 @@
1-
package Sorting;
2-
3-
import java.util.*;
41
import java.io.*;
2+
import java.util.*;
53

6-
/*
7-
* @author -- rajatgoyal715
8-
*/
4+
public class Solution {
95

10-
public class CorrectnessAndTheLoopInvariant {
116
public static void insertionSort(int[] A){
127
for(int i = 1; i < A.length; i++){
138
int value = A[i];
@@ -18,15 +13,16 @@ public static void insertionSort(int[] A){
1813
}
1914
A[j + 1] = value;
2015
}
16+
2117
printArray(A);
2218
}
2319

24-
public static void printArray(int[] ar) {
20+
21+
static void printArray(int[] ar) {
2522
for(int n: ar){
2623
System.out.print(n+" ");
2724
}
2825
}
29-
3026
public static void main(String[] args) {
3127
Scanner in = new Scanner(System.in);
3228
int n = in.nextInt();

‎Algorithms/Sorting/CountingSort1.java‎

Lines changed: 6 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -1,13 +1,11 @@
1-
package Sorting;
2-
3-
import java.util.*;
41
import java.io.*;
2+
import java.util.*;
3+
import java.text.*;
4+
import java.math.*;
5+
import java.util.regex.*;
56

6-
/*
7-
* @author -- rajatgoyal715
8-
*/
7+
public class Solution {
98

10-
public class CountingSort1 {
119
public static void main(String[] args) {
1210
Scanner sc = new Scanner(System.in);
1311
int N = sc.nextInt();
@@ -20,4 +18,4 @@ public static void main(String[] args) {
2018
System.out.print(c[i] + " ");
2119
}
2220
}
23-
}
21+
}

‎Algorithms/Sorting/CountingSort2.java‎

Lines changed: 6 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -1,13 +1,11 @@
1-
package Sorting;
2-
3-
import java.util.*;
41
import java.io.*;
2+
import java.util.*;
3+
import java.text.*;
4+
import java.math.*;
5+
import java.util.regex.*;
56

6-
/*
7-
* @author -- rajatgoyal715
8-
*/
7+
public class Solution {
98

10-
public class CountingSort2 {
119
public static void main(String[] args) {
1210
Scanner sc = new Scanner(System.in);
1311
int N = sc.nextInt();
@@ -23,4 +21,4 @@ public static void main(String[] args) {
2321
}
2422
}
2523
}
26-
}
24+
}

Algorithms/Sorting/FindTheMedian.java renamed to Algorithms/Sorting/FindtheMedian.java

Lines changed: 6 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -1,13 +1,11 @@
1-
package Sorting;
2-
3-
import java.util.*;
41
import java.io.*;
2+
import java.util.*;
3+
import java.text.*;
4+
import java.math.*;
5+
import java.util.regex.*;
56

6-
/*
7-
* @author -- rajatgoyal715
8-
*/
7+
public class Solution {
98

10-
public class FindTheMedian {
119
public static void main(String[] args) {
1210
Scanner sc = new Scanner(System.in);
1311
int n = sc.nextInt();
@@ -18,4 +16,4 @@ public static void main(String[] args) {
1816
Arrays.sort(a);
1917
System.out.println(a[n/2]);
2018
}
21-
}
19+
}

‎Algorithms/Sorting/InsertionSort-Part1.java‎

Lines changed: 33 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,33 @@
1+
import java.util.Scanner;
2+
3+
public class Solution {
4+
/* Tail starts here */
5+
public static void main(String[] args) {
6+
Scanner in = new Scanner(System.in);
7+
int s = in.nextInt();
8+
int[] ar = new int[s];
9+
for(int i=0;i<s;i++){
10+
ar[i]=in.nextInt();
11+
}
12+
int i = s-2;
13+
int temp = ar[s-1];
14+
while(i>=0 && ar[i]>temp){
15+
ar[i+1] = ar[i];
16+
i--;
17+
printArray(ar);
18+
}
19+
ar[i+1] = temp;
20+
printArray(ar);
21+
}
22+
23+
24+
private static void printArray(int[] ar) {
25+
for(int n: ar){
26+
System.out.print(n+" ");
27+
}
28+
System.out.println("");
29+
}
30+
31+
32+
}
33+

Algorithms/Sorting/InsertionSortPart2.java renamed to Algorithms/Sorting/InsertionSort-Part2.java

Lines changed: 12 additions & 19 deletions
Original file line numberDiff line numberDiff line change
@@ -1,23 +1,17 @@
1-
package Sorting;
1+
import java.util.Scanner;
22

3-
import java.util.*;
4-
import java.io.*;
5-
6-
/*
7-
* @author -- rajatgoyal715
8-
*/
9-
10-
public class InsertionSortPart2 {
3+
public class Solution {
4+
115
public static void main(String[] args) {
126
Scanner in = new Scanner(System.in);
13-
int s = in.nextInt();
14-
int[] ar = new int[s];
15-
for(int i=0;i<s;i++){
7+
int s = in.nextInt();
8+
int[] ar = new int[s];
9+
for(int i=0;i<s;i++){
1610
ar[i]=in.nextInt();
17-
}
18-
insertionSortPart2(ar);
11+
}
12+
insertionSortPart2(ar);
13+
1914
}
20-
2115
public static void insertionSortPart2(int[] ar)
2216
{
2317
int s = ar.length;
@@ -37,11 +31,10 @@ public static void insertionSortPart2(int[] ar)
3731
i++;
3832
}
3933
}
40-
4134
private static void printArray(int[] ar) {
42-
for(int n: ar){
43-
System.out.print(n+" ");
44-
}
35+
for(int n: ar){
36+
System.out.print(n+" ");
37+
}
4538
System.out.println("");
4639
}
4740
}

‎Algorithms/Sorting/InsertionSortPart1.java‎

Lines changed: 0 additions & 35 deletions
This file was deleted.

Algorithms/Sorting/IntroToTutorialChallenges.java renamed to Algorithms/Sorting/IntrotoTutorialChallenges.java

Lines changed: 3 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -1,13 +1,7 @@
1-
package Sorting;
1+
import java.util.Scanner;
22

3-
import java.util.*;
4-
import java.io.*;
3+
public class Solution {
54

6-
/*
7-
* @author -- rajatgoyal715
8-
*/
9-
10-
public class IntroToTutorialChallenges {
115
public static void main(String[] args) {
126
Scanner sc = new Scanner(System.in);
137
int num = sc.nextInt();
@@ -21,4 +15,4 @@ public static void main(String[] args) {
2115
}
2216
System.out.println(i);
2317
}
24-
}
18+
}

0 commit comments

Comments
 (0)