初级排序算法实现

最新推荐文章于 2024-01-29 10:54:52 发布

爱胡椒的小白兔呢

最新推荐文章于 2024-01-29 10:54:52 发布

阅读量275

点赞数

CC 4.0 BY-SA版权

分类专栏：算法文章标签：算法

本文链接：https://blog.youkuaiyun.com/sunshine0_0/article/details/57402790

算法专栏收录该内容

18 篇文章

订阅专栏

本文介绍了排序算法的基础——选择排序，详细讲解了其工作原理，并通过实例演示了选择排序的过程，帮助初学者理解并掌握这一基础排序算法。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

一、选择排序：

public class Selection 
{
	public static void sort(Comparable[] a)
	{
		int N = a.length;
		for (int i = 0; i < N; i++)
		{
			int min = i;
			for (int j = i + 1; j < N; j++)
				if (less(a[j], a[min])) 
					min = j;
			exch(a, i, min);
		}
	}
	public static boolean less(Comparable v, Comparable w)
	{
		return v.compareTo(w) < 0;
	}
	public static void exch(Comparable[] a, int i, int j)
	{
		Comparable t = a[i];
		a[i] = a[j];
		a[j] = t;
		
	}
	private static void show(Comparable[] a)
	{
		for (int i = 0; i < a.length; i++)
			System.out.print(a[i] + " ");
		System.out.println();
	}
	public static boolean isSorted(Comparable[] a)
	{
		for (int i = 1; i < a.length; i++)
			if (less(a[i], a[i - 1])) return false;
		return true;
	}
	public static void main(String[] args)
	{
		// TODO Auto-generated method stub
		String[] a = {"abc", "bbb", "ad", "fa", "ccc"};
		sort(a);
		assert isSorted(a);
		show(a);
	}

}

二、插入排序：

public class Insertion 
{
	public static void sort(Comparable[] a)
	{
		int N = a.length;
		for (int i = 1; i < N; i++)
			for (int j = i; j > 0 && less(a[j], a[j-1]); j--)
				exch(a, j, j-1);
	}
	public static boolean less(Comparable v, Comparable w)
	{
		return v.compareTo(w) < 0;
	}
	public static void exch(Comparable[] a, int i, int j)
	{
		Comparable t = a[i];
		a[i] = a[j];
		a[j] = t;
		
	}
	private static void show(Comparable[] a)
	{
		for (int i = 0; i < a.length; i++)
			System.out.print(a[i] + " ");
		System.out.println();
	}
	public static boolean isSorted(Comparable[] a)
	{
		for (int i = 1; i < a.length; i++)
			if (less(a[i], a[i - 1])) return false;
		return true;
	}
	public static void main(String[] args)
	{
		// TODO Auto-generated method stub
		String[] a = {"abc", "bbb", "ad", "fa", "ccc"};
		sort(a);
		assert isSorted(a);
		show(a);
	}
}

三、希尔排序：

public class Shell 
{
	public static void sort(Comparable[] a)
	{
		int N = a.length;
		int h = 1;
		while (h < N/3) h = h * 3 + 1;
		while (h >= 1)
		{
		for (int i = h; i < N; i++)
			for (int j = i; j >= h && less(a[j], a[j-h]); j -= h)
				exch(a, j, j-h);
		h = h/3;
		}
	}
	public static boolean less(Comparable v, Comparable w)
	{
		return v.compareTo(w) < 0;
	}
	public static void exch(Comparable[] a, int i, int j)
	{
		Comparable t = a[i];
		a[i] = a[j];
		a[j] = t;
		
	}
	private static void show(Comparable[] a)
	{
		for (int i = 0; i < a.length; i++)
			System.out.print(a[i] + " ");
		System.out.println();
	}
	public static boolean isSorted(Comparable[] a)
	{
		for (int i = 1; i < a.length; i++)
			if (less(a[i], a[i - 1])) return false;
		return true;
	}
	public static void main(String[] args)
	{
		// TODO Auto-generated method stub
		String[] a = {"abc", "bbb", "ad", "fa", "ccc"};
		sort(a);
		assert isSorted(a);
		show(a);
	}
}