algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 12:58:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

add chapter_sorting by dart (#366)

Browse Source 
* add chapter_sorting by dart

* fixed style of dart and bug mentioned before

* alter min value of dart

* Update radix_sort.dart

---------

Co-authored-by: Yudong Jin <krahets@163.com>
This commit is contained in:
Leo.Cai
2023-02-19 01:03:42 +08:00
committed by GitHub
parent 53f45984f9
commit d249c8802e
8 changed files with 349 additions and 21 deletions
Download Patch File Download Diff File Expand all files Collapse all files

30
codes/c/chapter_sorting/bubble_sort.c
View File

@ -9,13 +9,10 @@
/* 冒泡排序 */
void bubbleSort(int nums[], int size) {
// 外循环：待排序元素数量为 n-1, n-2, ..., 1
for (int i = 0; i < size - 1; i++)
{
for (int i = 0; i < size - 1; i++) {
// 内循环：冒泡操作
for (int j = 0; j < size - 1 - i; j++)
{
if (nums[j] > nums[j + 1])
{
for (int j = 0; j < size - 1 - i; j++) {
if (nums[j] > nums[j + 1]) {
int temp = nums[j];
nums[j] = nums[j + 1];
nums[j + 1] = temp;
@ -27,14 +24,11 @@ void bubbleSort(int nums[], int size) {
/* 冒泡排序（标志优化）*/
void bubbleSortWithFlag(int nums[], int size) {
// 外循环：待排序元素数量为 n-1, n-2, ..., 1
for (int i = 0; i < size - 1; i++)
{
for (int i = 0; i < size - 1; i++) {
bool flag = false;
// 内循环：冒泡操作
for (int j = 0; j < size - 1 - i; j++)
{
if (nums[j] > nums[j + 1])
{
for (int j = 0; j < size - 1 - i; j++) {
if (nums[j] > nums[j + 1]) {
int temp = nums[j];
nums[j] = nums[j + 1];
nums[j + 1] = temp;
@ -46,22 +40,20 @@ void bubbleSortWithFlag(int nums[], int size) {
}
}
/* Driver Code */
int main() {
int nums[6] = {4, 1, 3, 1, 5, 2};
printf("冒泡排序后: ");
bubbleSort(nums, 6);
for (int i = 0; i < 6; i++)
{
for (int i = 0; i < 6; i++) {
printf("%d ", nums[i]);
}
int nums1[6] = {4, 1, 3, 1, 5, 2};
printf("\n优化版冒泡排序后: ");
bubbleSortWithFlag(nums, 6);
for (int i = 0; i < 6; i++)
{
printf("%d ", nums[i]);
bubbleSortWithFlag(nums1, 6);
for (int i = 0; i < 6; i++) {
printf("%d ", nums1[i]);
}
printf("\n");