logo
publist
写文章

简介

该用户还未填写简介

擅长的技术栈

可提供的服务

暂无可提供的服务

简单选择排序算法代码实现

#include<iostream>using namespace std;void selcet(int arry[]);int length;int main() {int a[] = { 1,-17,13,15,-19,10,99,123,124,1000 };length = sizeof(a) / sizeof(int);for (int i = 0; i < leng

#排序算法#蓝桥杯#c++
运算符重载

#include<iostream>using namespace std;class complex{public:complex() {real = 0;imag = 0;}void display();complex(int a, int b) :real(a), imag(b) {}friend complex operator +(complex& c1, compl

#c++
到底了