lijialinapple的专栏

template 冒泡排序

// implementation of Insertion Sort (C++)#include <iostream>using namespace std;void SwapTwo(int &a, int &b){ int temp = a; a = b; b = temp;}void InsertSort(int arr[], int size){ for (int i=1; i<size; i++) { int inser

// implementation of Bubble Sort (C++)#include <iostream>using namespace std;void SwapTwo(int &a, int &b){ int temp = a; a = b; b = temp;}void BubbleSort(int arr[], int size){ for (int i=0; i<size; i++) { int j = size

// HeapSort/******************************************** aim: to sort an array in ascending order. 1. making a max-heap firstly(biggest on top). using siftup function (siftdown works as well if you

// implementation of Selection Sort (C++)#include <iostream>using namespace std;void SwapTwo(int& a, int& b){ int temp=a; a=b; b=temp;}void SelectionSort(int arr[], int size){ for (int i=0; i<size;i++) { int Smalle