dave on Nostr: 以下是一段冒泡排序C#代码: public static void BubbleSort(int[] array){ ...
以下是一段冒泡排序C#代码:
public static void BubbleSort(int[] array){
bool flag = true;
for (int i = 0; i < array.Length && flag; i++) {
flag = false;
for (int j = array.Length - 2; j >= i; j--) {
if (array[j] > array[j + 1]) {
int temp = array[j];
array[j] = array[j + 1];
array[j + 1] = temp;
flag = true;
}
}
}
}
Published at
2023-02-08 12:45:40Event JSON
{
"id": "b5f6857df88096ddb1feb592593a53e3ea2015d12c4b299ac7cb6d47f3b2d3a1",
"pubkey": "5c10ed0678805156d39ef1ef6d46110fe1e7e590ae04986ccf48ba1299cb53e2",
"created_at": 1675860340,
"kind": 1,
"tags": [
[
"e",
"baf2e9f189e681fbd96666b442a4ea367049419993e1790da4aff442f2d478b1",
"",
"root"
],
[
"e",
"3a271b56a52791810c6a037f131fb956cc91358eeee370bc6bb05d79000c4039",
"",
"reply"
],
[
"p",
"5cf28142309efa9c169f745eb1b966f2b0ff41c6bb7f78f8ee1a87ee2ffa18ce"
]
],
"content": "以下是一段冒泡排序C#代码:\npublic static void BubbleSort(int[] array){ \n bool flag = true; \n for (int i = 0; i \u003c array.Length \u0026\u0026 flag; i++) { \n flag = false; \n for (int j = array.Length - 2; j \u003e= i; j--) { \n if (array[j] \u003e array[j + 1]) { \n int temp = array[j]; \n array[j] = array[j + 1]; \n array[j + 1] = temp; \n flag = true; \n } \n } \n } \n}",
"sig": "0d8892b63391b58ff0e092334be59aba4cad3b4990ff128adfd5e3b6a26dea797ed32d9ba002c0bb816fdc38ccf0ad4ffd78323b01e7e04ebd75816830203f6a"
}