https://blog.csdn.net/HA_Andrewzh-cnhttps://blog.csdn.net/https://blog.csdn.net/HA_Andrew/article/details/132052284https://blog.csdn.net/HA_Andrew/article/details/132052284HA_AndrewWed, 02 Aug 2023 03:30:00 +0800https://blog.csdn.net/HA_Andrew/article/details/132011752https://blog.csdn.net/HA_Andrew/article/details/132011752HA_AndrewMon, 31 Jul 2023 01:45:00 +0800https://blog.csdn.net/HA_Andrew/article/details/131948280https://blog.csdn.net/HA_Andrew/article/details/131948280HA_AndrewWed, 26 Jul 2023 21:41:19 +0800https://blog.csdn.net/HA_Andrew/article/details/131922518https://blog.csdn.net/HA_Andrew/article/details/131922518HA_AndrewTue, 25 Jul 2023 22:15:00 +0800https://blog.csdn.net/HA_Andrew/article/details/131906265https://blog.csdn.net/HA_Andrew/article/details/131906265HA_AndrewMon, 24 Jul 2023 22:25:03 +0800https://blog.csdn.net/HA_Andrew/article/details/131566074https://blog.csdn.net/HA_Andrew/article/details/131566074HA_AndrewThu, 06 Jul 2023 00:00:20 +0800https://blog.csdn.net/HA_Andrew/article/details/131098043https://blog.csdn.net/HA_Andrew/article/details/131098043HA_AndrewWed, 07 Jun 2023 23:26:03 +0800https://blog.csdn.net/HA_Andrew/article/details/130853834https://blog.csdn.net/HA_Andrew/article/details/130853834HA_AndrewWed, 24 May 2023 19:51:28 +0800https://blog.csdn.net/HA_Andrew/article/details/130758356https://blog.csdn.net/HA_Andrew/article/details/130758356HA_AndrewFri, 19 May 2023 01:32:59 +0800https://blog.csdn.net/HA_Andrew/article/details/130737444https://blog.csdn.net/HA_Andrew/article/details/130737444HA_AndrewWed, 17 May 2023 23:50:14 +0800https://blog.csdn.net/HA_Andrew/article/details/130713811https://blog.csdn.net/HA_Andrew/article/details/130713811HA_AndrewTue, 16 May 2023 21:11:39 +0800https://blog.csdn.net/HA_Andrew/article/details/130695778https://blog.csdn.net/HA_Andrew/article/details/130695778HA_AndrewTue, 16 May 2023 00:54:08 +0800https://blog.csdn.net/HA_Andrew/article/details/130633523https://blog.csdn.net/HA_Andrew/article/details/130633523HA_AndrewFri, 12 May 2023 00:40:48 +0800https://blog.csdn.net/HA_Andrew/article/details/130610292https://blog.csdn.net/HA_Andrew/article/details/130610292HA_AndrewWed, 10 May 2023 21:27:41 +0800https://blog.csdn.net/HA_Andrew/article/details/130589521https://blog.csdn.net/HA_Andrew/article/details/130589521HA_AndrewTue, 09 May 2023 21:39:35 +0800https://blog.csdn.net/HA_Andrew/article/details/130374807https://blog.csdn.net/HA_Andrew/article/details/130374807HA_AndrewTue, 25 Apr 2023 21:42:54 +0800https://blog.csdn.net/HA_Andrew/article/details/130351129https://blog.csdn.net/HA_Andrew/article/details/130351129HA_AndrewMon, 24 Apr 2023 21:35:13 +0800https://blog.csdn.net/HA_Andrew/article/details/130333454https://blog.csdn.net/HA_Andrew/article/details/130333454HA_AndrewMon, 24 Apr 2023 00:15:09 +0800https://blog.csdn.net/HA_Andrew/article/details/129820640https://blog.csdn.net/HA_Andrew/article/details/129820640HA_AndrewTue, 28 Mar 2023 20:44:11 +0800if(条件) 条件是价格的比较 (p+j)->price (p+j+1)->price。交换的是*(p+j) 和*(p+j+1) 对应的整体信息。3> 注意中间变量t的类型，应该是结构体类型。例如： (p+j)表示整个车的地址。*(p+j)表示整个车的信息。1>调用函数在堆区申请空间。思路：和正常的冒泡是一样的。2> 交换的是整个车的信息。3>调用函数对价格排序。2>调用函数实现输入。]]>https://blog.csdn.net/HA_Andrew/article/details/129801020https://blog.csdn.net/HA_Andrew/article/details/129801020HA_AndrewMon, 27 Mar 2023 20:52:38 +0800 定义函数，实现连接后字符串的冒泡排序【是对字符串的每一个字符进行排序】1.在堆区申请2个字符类型的大小为20字节的空间。3> 定义函数，计算两个字符串的长度【非函数】1> 定义函数，实现在堆区申请空间。2> 定义函数，输入两个字符串。4> 定义函数，实现字符串连接。7> 调用函数释放空间。6> 实现字符串逆置。]]>