给一个数组,如A[]={1,3,5,46,11,22,37,45,44,78,67,98},用除了冒泡排序外的任意一种方法把此数组按降序排列。
时间: 2024-06-13 16:08:24 浏览: 10
以下是使用Python的sorted()函数将数组按降序排列的方法:
```python
A = [1, 3, 5, 46, 11, 22, 37, 45, 44, 78, 67, 98]
A_sorted = sorted(A, reverse=True)
print(A_sorted)
```
输出结果为:
```
[98, 78, 67, 46, 45, 44, 37, 22, 11, 5, 3, 1]
```
其中,sorted()函数的第一个参数为要排序的数组,第二个参数reverse=True表示按降序排列。
相关问题
给一个数组,如A[]={1,3,5,46,11,22,37,45,44,78,67,98},把此数组按降序用快速排序用c++
以下是C++实现快速排序的代码,可以将给定数组按照降序排列:
```c++
#include<iostream>
using namespace std;
void quickSort(int A[], int left, int right) {
if (left >= right) {
return;
}
int i = left, j = right, pivot = A[left];
while (i < j) {
while (i < j && A[j] <= pivot) {
j--;
}
A[i] = A[j];
while (i < j && A[i] >= pivot) {
i++;
}
A[j] = A[i];
}
A[i] = pivot;
quickSort(A, left, i - 1);
quickSort(A, i + 1, right);
}
int main() {
int A[] = {1, 3, 5, 46, 11, 22, 37, 45, 44, 78, 67, 98};
int n = sizeof(A) / sizeof(A[0]);
quickSort(A, 0, n - 1);
for (int i = n - 1; i >= 0; i--) {
cout << A[i] << " ";
}
return 0;
}
```
给一个数组,如A[]={1,3,5,46,11,22,37,45,44,78,67,98},把此数组按从大到小用快速排序用c++
以下是C++实现快速排序的代码,可以将给定数组按从大到小排序:
```c++
#include <iostream>
using namespace std;
void quickSort(int arr[], int left, int right) {
int i = left, j = right;
int tmp;
int pivot = arr[(left + right) / 2];
while (i <= j) {
while (arr[i] > pivot)
i++;
while (arr[j] < pivot)
j--;
if (i <= j) {
tmp = arr[i];
arr[i] = arr[j];
arr[j] = tmp;
i++;
j--;
}
}
if (left < j)
quickSort(arr, left, j);
if (i < right)
quickSort(arr, i, right);
}
int main() {
int A[] = {1, 3, 5, 46, 11, 22, 37, 45, 44, 78, 67, 98};
int n = sizeof(A) / sizeof(A[0]);
quickSort(A, 0, n - 1);
cout << "Sorted array in descending order: ";
for (int i = n - 1; i >= 0; i--)
cout << A[i] << " ";
return 0;
}
```