JAVA链表部分排序算法实现

冒泡排序算法

import java.util.LinkedList;

public class maoPaoSuanFa {
	public static void main(String[] args) {
		LinkedList<Integer> list = new LinkedList<Integer>();
		for(int i = 0; i < 10; i ++) {
			int j = (int) (Math.random() * 100 + 1);
			list.add(j);
		}
		System.out.println("原链表");
		System.out.println(list);
		for(int i = 0; i < list.size()-1; i++) {
			for(int j = 0;j < list.size() - 1 - i;j++) {
				if(list.get(j) > list.get(j+1)) {
					int tmp = list.get(j + 1);
					list.set(j+1, list.get(j));
					list.set(j, tmp);
				}
			}
		}
		System.out.println("冒泡排序后的队列");
		System.out.println(list);
	}
}

运行结果

原链表
[100, 56, 71, 63, 5, 72, 64, 58, 68, 7]
冒泡排序后的队列
[5, 7, 56, 58, 63, 64, 68, 71, 72, 100]

---

选择排序算法

import java.util.LinkedList;
public class xuanZePaiXu {

	public static void main(String[] args) {
		LinkedList<Integer> list = new LinkedList<Integer>();
		for(int i = 0; i < 10; i ++) {
			int j = (int) (Math.random() * 100 + 1);
			list.add(j);
		}
		System.out.println("原链表");
		System.out.println(list);
		for(int i = 0; i < list.size()-1;i ++) {
			 int minindex = i;
			for(int j = i + 1; j < list.size(); j ++) {
				if((list.get(j)) < (list.get(minindex))) {
					minindex = j;
				}
			}
			int tmp = list.get(i);
			list.set(i,list.get(minindex));
			list.set(minindex,tmp);
		}
		System.out.println("选择排序后的单链表");
		System.out.println(list);
	}
}

运行结果

原链表
[34, 72, 57, 5, 33, 44, 54, 5, 25, 93]
选择排序后的单链表
[5, 5, 25, 33, 34, 44, 54, 57, 72, 93]

---

插入排序算法

import java.util.LinkedList;

public class chaRuPaiXu {
	public static void main(String[] args) {
		LinkedList<Integer> list = new LinkedList<Integer>();
		for(int i = 0; i < 10; i ++) {
			int j = (int) (Math.random() * 100 + 1);
			list.add(j);
		}
		System.out.println("原链表");
		System.out.println(list);
		for(int i = 1; i < list.size(); i ++) {
			int preindex = i - 1;
			int tmp = list.get(i);
			while(preindex > -1 && list.get(preindex) > tmp) {
				list.set(preindex + 1, list.get(preindex));
				preindex--;
			}
			list.set(preindex + 1, tmp);
		}
		System.out.println("插入排序后的链表");
		System.out.println(list);
	}
}

运行结果

原链表
[39, 66, 79, 71, 40, 67, 88, 91, 10, 73]
插入排序后的链表
[10, 39, 40, 66, 67, 71, 73, 79, 88, 91]

---

希尔排序算法

import java.util.LinkedList;

public class XiErPaiXu {
public static void main(String[] args) {
	LinkedList<Integer> list = new LinkedList<Integer>();
	for(int i = 0; i < 10; i ++) {
		int j = (int) (Math.random() * 100 + 1);
		list.add(j);
	}
	System.out.println("原链表");
	System.out.println(list);
	for(int jiange = (int) Math.floor((list.size()) / 2); jiange > 0; jiange = (int) Math.floor(jiange / 2)){
		for(int i = jiange ;i < list.size();i ++) {
			int j = i;
			int current = list.get(i);
		while(j - jiange >= 0 && current < list.get(j - jiange)) {
			list.set(j, list.get(j - jiange));
			j = j - jiange;
		}
		list.set(j, current);
		}
	}
	System.out.println("希尔排序后的链表");
	System.out.println(list);
}
}

运行结果

原链表
[35, 40, 88, 86, 30, 37, 88, 32, 99, 9]
希尔排序后的链表
[9, 30, 32, 35, 37, 40, 86, 88, 88, 99]