Bubble Sort (冒泡排序 C++)

最新推荐文章于 2024-07-21 15:01:58 发布

瓦力冫

最新推荐文章于 2024-07-21 15:01:58 发布

阅读量2k

点赞数 1

分类专栏：数据结构 & 算法

本文链接：https://blog.csdn.net/fox64194167/article/details/8574107

版权

数据结构 & 算法专栏收录该内容

66 篇文章 7 订阅 ¥19.90 ¥99.00

订阅专栏

超级会员免费看

冒泡排序是一种简单的排序算法，通过不断交换相邻位置的元素，使得最大元素逐渐‘浮’到数组的右端。每一轮交换确保了最大元素正确的位置。

摘要由CSDN通过智能技术生成

"Bubble Sort" is a simple way to sort elements. This sort employs a "bubbling strategy" to get the largetest element to the right. In a bubbling pass, pairs of adjacent elements are compared, the elements are swapped in case the one on the left is greater than the one on the right. At the end of the bubbling pass, we are assured that the largest element is in the right-most position.

// Bubble.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <iostream>
  
using namespace std;

template <class T>
//one bubbling pass
bool Bubble(T a[], int n, int &flag){
	bool swapped = false;
	for(int i = 0; i < n

了解本专栏