使用插入排序法排序1,2,3,4,5,6,7,8,9,0,并且用代码输出结果
时间: 2023-08-05 11:07:30 浏览: 39
好的,以下是使用插入排序法排序1,2,3,4,5,6,7,8,9,0的代码实现:
```python
arr = [1,2,3,4,5,6,7,8,9,0]
for i in range(1, len(arr)):
key = arr[i]
j = i - 1
while j >= 0 and key < arr[j]:
arr[j+1] = arr[j]
j -= 1
arr[j+1] = key
print(arr)
```
输出结果为:
```
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
```
相关问题
使用java的插入排序法排序1,2,3,4,5,6,7,8,9,0,并且用代码输出结果
以下是使用Java实现插入排序算法对1,2,3,4,5,6,7,8,9,0进行排序的代码:
```java
public class InsertionSortExample {
public static void main(String[] args) {
int[] arr = {1, 2, 3, 4, 5, 6, 7, 8, 9, 0};
System.out.println("Original Array: " + Arrays.toString(arr));
insertionSort(arr);
System.out.println("Sorted Array: " + Arrays.toString(arr));
}
public static void insertionSort(int[] arr) {
for (int i = 1; i < arr.length; i++) {
int key = arr[i];
int j = i - 1;
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
j--;
}
arr[j + 1] = key;
}
}
}
```
输出结果为:
```
Original Array: [1, 2, 3, 4, 5, 6, 7, 8, 9, 0]
Sorted Array: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
```
用java编写一个利用插入排序法对[8,5,6,9,2]进行排序
以下是Java代码实现插入排序算法对给定数组进行排序:
```
public class InsertionSort {
public static void main(String[] args) {
int[] arr = {8, 5, 6, 9, 2};
System.out.println("Before sorting: " + Arrays.toString(arr));
insertionSort(arr);
System.out.println("After sorting: " + Arrays.toString(arr));
}
public static void insertionSort(int[] arr) {
int n = arr.length;
for (int i = 1; i < n; i++) {
int key = arr[i];
int j = i - 1;
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
j--;
}
arr[j + 1] = key;
}
}
}
```
输出结果为:
```
Before sorting: [8, 5, 6, 9, 2]
After sorting: [2, 5, 6, 8, 9]
```