This script will probably only be of use to you if you study
at the @fh-wedel and have PS2 (Programmstrukturen 2), or you
go to another University which uses SVN for version control
and has you write Java code where you're not allowed to
commit either your workspace.xml or your out directory.
So any FH Wedel students, thank me later. :p
| /** | |
| Copyright 2022 Kevin Kandlbinder (https://kevink.dev) | |
| Licensed under the Apache License, Version 2.0 (the "License"); | |
| you may not use this file except in compliance with the License. | |
| You may obtain a copy of the License at | |
| http://www.apache.org/licenses/LICENSE-2.0 | |
| Unless required by applicable law or agreed to in writing, software |
| class bubbleSort { | |
| public static void bubbleSort(int array[]) { | |
| int n = array.length; | |
| for (int i = 0; i < n-1; i++) | |
| for (int j = 0; j < n-i-1; j++) | |
| if (array[j] > array[j+1]) | |
| { | |
| int swap = array[j]; | |
| array[j] = array[j+1]; | |
| array[j+1] = swap; |
| public class selectionSort{ | |
| public static void sortArray(int[] array){ | |
| for (int i=0;i<array.length ;i++ ) { | |
| printArray(array); | |
| int minimum = findMinimum(array, i, array.length-1); | |
| swap(array,i, minimum); | |
| } | |
| } |
| import java.util.Arrays; | |
| public class insertionSort { | |
| public static void main(String[] args) { | |
| int[] unsorted = {20, 66, 80, 33, 71, 1, 40, 64, 75, 14}; | |
| int[] sorted = insertionSort(unsorted); | |
| } |
Verifying my Blockstack ID is secured with the address 13et4C85oRNi4YBhSx3LJgKAhfPZJMRzdX https://explorer.blockstack.org/address/13et4C85oRNi4YBhSx3LJgKAhfPZJMRzdX
I hereby claim:
To claim this, I am signing this object:
