Sortieren durch AUSTAUSCH
Struktogramm - Paarweiser Austausch (bubble sort)
INDEX I |
1 |
2 |
3 |
4 |
5 |
I |
Austausch |
J |
MIN |
ELEMENT E[I] |
17 |
9 |
10 |
6 |
12 |
1 |
1 |
|
|
|
17 |
17 |
10 |
6 |
12 |
|
0 |
1 |
9 |
|
9 |
17 |
10 |
6 |
12 |
|
1 |
|
|
|
9 |
17 |
17 |
6 |
12 |
|
|
2 |
10 |
|
9 |
10 |
17 |
6 |
12 |
|
2 |
|
|
|
9 |
10 |
17 |
17 |
12 |
|
|
3 |
6 |
|
9 |
10 |
6 |
17 |
12 |
|
3 |
|
|
|
9 |
10 |
6 |
17 |
17 |
|
|
4 |
12 |
|
9 |
10 |
6 |
12 |
17 |
|
4 |
|
|
|
9 |
10 |
6 |
12 |
17 |
2 |
0 |
1 |
|
|
9 |
10 |
10 |
12 |
17 |
|
|
2 |
6 |
|
9 |
6 |
10 |
12 |
17 |
|
1 |
|
|
|
9 |
6 |
10 |
12 |
17 |
|
|
3 |
|
|
9 |
9 |
10 |
12 |
17 |
3 |
0 |
1 |
6 |
|
6 |
9 |
10 |
12 |
17 |
4 |
1 |
2 |
|
|
6 |
9 |
10 |
12 |
17 |
|
0 |
1 |
|
|
|
|
|
|
|
5 |
|
|
|
Programm-Code (in Java)
/*
* Created on 11.01.2004
*/ import bubble_sort.Bubble_sort;
/**
* @author Florian Ercevic
*/
public class mainEx {
public static void main(String[] args) {
Bubble_sort BS = new Bubble_sort();
BS.fillArray();
System.out.println("unsortiert für Bubble Sort");
for(int i=1;i<6;i++)
{
System.out.print(BS.Array1[i]+" ");
}
BS.sortArray();
System.out.println();
System.out.println("sortiert nach Bubble Sort");
for(int i=1;i<6;i++)
{
System.out.print(BS.Array1[i]+" ");
}
System.out.println();
}
}
/*
* Created on 11.01.2004
*/
package bubble_sort;
/**
* @author Florian
*/
import java.util.Random;
public class Bubble_sort
{
Random generator = new Random();
int N=5;
public int [] Array1 = new int[N+1];
public int [] fillArray()
{
for(int i=1;i<N+1;i++)
{
Array1[i] = 1 + generator.nextInt(100);
}
return Array1;
}
public int [] sortArray()
{
int i=1, AUSTAUSCH=1, MIN=0;
while((AUSTAUSCH>0) && (i<N+1))
{
AUSTAUSCH=0;
for(int j=1;j<N-i+1;j++)
{
if(Array1[j]>Array1[j+1])
{
MIN=Array1[j+1];
Array1[j+1]=Array1[j];
Array1[j]=MIN;
AUSTAUSCH++;
}
}
i++;
}
return Array1;
}
}
