Fresh pull request for sorting algorithms #26
Merged
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
|
@Ahel2000 do we need the .java files? You already added code in the markdown files. @arnabsen1729 opinion? |
Comment on lines
1
to
34
|
|
||
| /** | ||
| * Write a description of class Insertion here. | ||
| * | ||
| * @author (your name) | ||
| * @version (a version number or a date) | ||
| */ | ||
| public class Insertion | ||
| { | ||
| public static void sort(Comparable a[]) | ||
| { | ||
| // initialise instance variables | ||
| for(int i=0;i<a.length;i++){ | ||
| for(int j=i;j>0;j--){ | ||
| if(less(a[j],a[j-1])){ | ||
| exch(a,j,j-1); | ||
| } | ||
| else{ | ||
| break; | ||
| } | ||
| } | ||
| } | ||
| } | ||
|
|
||
| public static boolean less(Comparable v , Comparable w){ | ||
| return v.compareTo(w)<0 ; | ||
| } | ||
|
|
||
| public static void exch(Comparable a[], int i, int j){ | ||
| Comparable swap=a[i]; | ||
| a[i]=a[j]; | ||
| a[j]=swap; | ||
| } | ||
| } |
|
|
||
| Given an array ``arr = [a1,a2,a3,a4,a5...,an] `` , we need to sort the array the array with the help of Insertion Sort algorithm. | ||
|
|
||
| --------------- |
|
|
||
|
|
||
|
|
||
| ----------- |
There was a problem hiding this comment.
here as well remove these with <hr>
Comment on lines
1
to
57
| public class Merge{ | ||
| public static Comparable[] theArray; | ||
| public static Comparable[] sort(Comparable[] a){ | ||
| theArray= new Comparable[a.length]; | ||
| theArray=a; | ||
| for(int i=0;i<a.length;i++){ | ||
| System.out.print(theArray[i]+" "); | ||
| } | ||
| System.out.println(); | ||
| Comparable[] workplace=new Comparable[a.length]; | ||
| mergesort(workplace,0,a.length-1); | ||
| for(int i=0;i<a.length;i++){ | ||
| System.out.print(theArray[i]+" "); | ||
| } | ||
| System.out.println(); | ||
| return theArray; | ||
| } | ||
|
|
||
| public static void mergesort(Comparable[] workplace,int lowerbound,int upperbound){ | ||
| if(lowerbound==upperbound){ | ||
| return; | ||
| } | ||
| else{ | ||
| int mid=(lowerbound+upperbound)/2; | ||
| mergesort(workplace,lowerbound,mid); | ||
| mergesort(workplace,mid+1,upperbound); | ||
| merge(workplace,lowerbound,mid+1,upperbound); | ||
| } | ||
| } | ||
|
|
||
| public static void merge(Comparable[] workplace,int lowPtr,int highPtr,int upperbound) | ||
| { | ||
| int low=lowPtr; | ||
| int mid=highPtr-1; | ||
| int j=0; | ||
| int n=upperbound-low+1; | ||
| while(low<=mid && highPtr<=upperbound){ | ||
| if(theArray[low].compareTo(theArray[highPtr])<0){ | ||
| workplace[j++]=theArray[low++]; | ||
| }else{ | ||
| workplace[j++]=theArray[highPtr++]; | ||
| } | ||
| } | ||
|
|
||
| while(low<=mid){ | ||
| workplace[j++]=theArray[low++]; | ||
| } | ||
|
|
||
| while(highPtr<=upperbound){ | ||
| workplace[j++]=theArray[highPtr++]; | ||
| } | ||
|
|
||
| for(j=0;j<n;j++){ | ||
| theArray[lowPtr+j]=workplace[j]; | ||
| } | ||
| } | ||
| } |
|
I have made the changes @arnabsen1729 |
sadn1ck
reviewed
Nov 27, 2020
|
|
||
| ## Code for the Algorithm | ||
| <hr> | ||
| ### Code For Insertion Sort |
There was a problem hiding this comment.
Add some space here, markdown shenanigans
sadn1ck
suggested changes
Nov 27, 2020
There was a problem hiding this comment.
Check the comments, then I will merge. @arnabsen1729 have a look as well
|
@allcontributors add @Ahel2000 for contributing to documentation |
|
I've put up a pull request to add @Ahel2000! 🎉 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Description
Add insertion sort, selection sort and merge sort.
Issue #5
Type of change
Please delete options that are not relevant.
Added to SUMMARY.md (delete section if not needed)?
Have you added the page to SUMMARY.md if this is a new page and not a fix?