三、直接插入排序
2021-05-19 00:29
标签：temp eth sort abc public 抽象类 抽象 style acl 三、直接插入排序 标签：temp eth sort abc public 抽象类 抽象 style acl 原文地址：https://www.cnblogs.com/beanbag/p/9743803.html1、Java语言实现
抽象类
public abstract class Sorter {
public abstract void sort(int [] array);
}
实现类
public class StraightInsertionSorter extends Sorter {
@Override
public void sort(int[] array) {
for (int i = 1; i ) {
int temp = array[i];
if (array[i] ]) {
int j = i - 1;
while (j >= 0 && temp array[j]) {
array[j + 1] = array[j];
j--;
}
array[j + 1] = temp;
}
}
}
}
测试
public class Test {
public static void main(String[] args) {
int[] arr = {94, 12, 34, 76, 26, 9, 0, 37, 55, 76, 37, 5, 68, 83, 90, 37, 12, 65, 76, 49};
//int[] arr = {5, 2, 0, 1, 3, 4};
Sorter sorter = new StraightInsertionSorter();
sorter.sort(arr);
System.out.println(Arrays.toString(arr));
}
}
2、python语言实现
from abc import ABCMeta, abstractmethod
class Sorter:
__metaclass__ = ABCMeta
@abstractmethod
def sort(self, array):
pass
# 第一种写法
# class StraightInsertionSorter(Sorter):
# def sort(self,array):
# i = 1
# length = len(array)
# while i
# temp = array[i]
# if array[i]
# j = i - 1
# while j >= 0 and temp
# array[j + 1] = array[j]
# j -= 1
# array[j + 1] = temp
# i += 1
# 第二种写法
class StraightInsertionSorter(Sorter):
def sort(self, array):
i = 0
length = len(array)
while i :
k = i
j = i
while j length:
if array[j] array[k]:
k = j
j = j + 1
if k != i:
array[k], array[i] = array[i], array[k]
i = i + 1
if __name__ == ‘__main__‘:
arr = [5, 4, 2, 1, 3, 0, 6]
print(arr)
straightInsertionSorter = StraightInsertionSorter()
straightInsertionSorter.sort(arr)
print(arr)