Awesome-Mirrors/OSSU-computer-science
1
0
Fork 0
mirror of https://github.com/ossu/computer-science.git synced 2025-04-18 06:35:58 -04:00
Code Issues Packages Projects Releases Wiki Activity

Selection sort implementation

Browse Source
This commit is contained in:
Reborn 2025-03-19 12:07:54 +00:00
parent c250bdc218
commit 4ec587f5b7
9 changed files with 86 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
Course Activities/02 - Core CS/05 - Core theory/01 - Divide and Conquer, Sorting and Searching, and Randomized Algorithm/SelectionSort/.gitignore vendored Normal file
View File

@ -0,0 +1 @@
/.metadata/

10
Course Activities/02 - Core CS/05 - Core theory/01 - Divide and Conquer, Sorting and Searching, and Randomized Algorithm/SelectionSort/SelectionSort/.classpath Normal file
View File

@ -0,0 +1,10 @@
<?xml version="1.0" encoding="UTF-8"?>
<classpath>
<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER/org.eclipse.jdt.internal.debug.ui.launcher.StandardVMType/JavaSE-17">
<attributes>
<attribute name="module" value="true"/>
</attributes>
</classpathentry>
<classpathentry kind="src" path="src"/>
<classpathentry kind="output" path="bin"/>
</classpath>

1
Course Activities/02 - Core CS/05 - Core theory/01 - Divide and Conquer, Sorting and Searching, and Randomized Algorithm/SelectionSort/SelectionSort/.gitignore vendored Normal file
View File

@ -0,0 +1 @@
/bin/

17
Course Activities/02 - Core CS/05 - Core theory/01 - Divide and Conquer, Sorting and Searching, and Randomized Algorithm/SelectionSort/SelectionSort/.project Normal file
View File

@ -0,0 +1,17 @@
<?xml version="1.0" encoding="UTF-8"?>
<projectDescription>
<name>SelectionSort</name>
<comment></comment>
<projects>
</projects>
<buildSpec>
<buildCommand>
<name>org.eclipse.jdt.core.javabuilder</name>
<arguments>
</arguments>
</buildCommand>
</buildSpec>
<natures>
<nature>org.eclipse.jdt.core.javanature</nature>
</natures>
</projectDescription>

2
Course Activities/02 - Core CS/05 - Core theory/01 - Divide and Conquer, Sorting and Searching, and Randomized Algorithm/SelectionSort/SelectionSort/.settings/org.eclipse.core.resources.prefs Normal file
View File

@ -0,0 +1,2 @@
eclipse.preferences.version=1
encoding/<project>=UTF-8

11
Course Activities/02 - Core CS/05 - Core theory/01 - Divide and Conquer, Sorting and Searching, and Randomized Algorithm/SelectionSort/SelectionSort/.settings/org.eclipse.jdt.core.prefs Normal file
View File

@ -0,0 +1,11 @@
eclipse.preferences.version=1
org.eclipse.jdt.core.compiler.codegen.targetPlatform=17
org.eclipse.jdt.core.compiler.codegen.unusedLocal=preserve
org.eclipse.jdt.core.compiler.compliance=17
org.eclipse.jdt.core.compiler.debug.lineNumber=generate
org.eclipse.jdt.core.compiler.debug.localVariable=generate
org.eclipse.jdt.core.compiler.debug.sourceFile=generate
org.eclipse.jdt.core.compiler.problem.enablePreviewFeatures=disabled
org.eclipse.jdt.core.compiler.problem.reportPreviewFeatures=warning
org.eclipse.jdt.core.compiler.release=enabled
org.eclipse.jdt.core.compiler.source=17

15
Course Activities/02 - Core CS/05 - Core theory/01 - Divide and Conquer, Sorting and Searching, and Randomized Algorithm/SelectionSort/SelectionSort/src/SelectionSort/Main.java Normal file
View File

@ -0,0 +1,15 @@
package SelectionSort;
import java.util.Arrays;
//Selection sort is the algorithm to sort one spot at a time
//Comb the entire array, select the smallest and place it at the beginning
public class Main
{
public static void main(String[] args) {
int[] toSort = new int[] {1, 5, 9, 3, 54, 2, 34, 2134, 2, 443, 23, 12, 4, 663, 123, 42};
SelectionSort sorter = new SelectionSort();
int[] sorted = sorter.sort(toSort);
System.out.println(Arrays.toString(sorted));
}
}

21
Course Activities/02 - Core CS/05 - Core theory/01 - Divide and Conquer, Sorting and Searching, and Randomized Algorithm/SelectionSort/SelectionSort/src/SelectionSort/SelectionSort.java Normal file
View File

@ -0,0 +1,21 @@
package SelectionSort;
public class SelectionSort {
public int[] sort(int[] arr) {
for (int i=0; i<arr.length; i++) {
for (int j = i+1; j<arr.length;j++) {
boolean isCurrentSmallerThanSpot = arr[j] < arr[i];
if (isCurrentSmallerThanSpot) {
arr = swapPlaces(arr, i, j);
}
}
}
return arr;
}
private int[] swapPlaces(int[] arr, int i, int j) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
return arr;
}
}

8
Course Activities/02 - Core CS/05 - Core theory/01 - Divide and Conquer, Sorting and Searching, and Randomized Algorithm/SelectionSort/SelectionSort/src/module-info.java Normal file
View File

@ -0,0 +1,8 @@
/**
*
*/
/**
*
*/
module SelectionSort {
}