{
  "type": "code_options",
  "author": "csdn.net",
  "source": "solution.md",
  "exercise_id": "63b2c8d6c3c34455b52e21d95fa44aa0",
  "keywords": "桶排序,算法初阶,线性时间排序,排序和顺序统计量",
  "title": "冒泡法排序大小",
  "desc": [
    {
      "content": "\n4286\n3185\n2895\n3550\n2745\n按从小到大排序",
      "language": "markdown"
    }
  ],
  "answer": [
    {
      "content": "",
      "language": "cpp"
    }
  ],
  "prepared": [
    [
      {
        "content": "",
        "language": "cpp"
      }
    ],
    [
      {
        "content": "",
        "language": "cpp"
      }
    ],
    [
      {
        "content": "",
        "language": "cpp"
      }
    ]
  ],
  "template": {
    "content": "#include <stdio.h>\n#define ARR_LEN 255 \n#define elemType int \nvoid bubbleSort (elemType arr[], int len) {\n\telemType temp;\n\tint i, j;\n\tfor (i=0; i<len-1; i++) \n\t\tfor (j=0; j<len-1-i; j++) { \n\t\t\tif (arr[j] > arr[j+1]) { \n\t\t\t\ttemp = arr[j];\n\t\t\t\tarr[j] = arr[j+1];\n\t\t\t\tarr[j+1] = temp;\n\t\t\t}\n\t\t}\n}\nint main (void) {\n\telemType arr[ARR_LEN] = {4286,3185,2895,3550,2745};\n\tint len = 5;\n\tint i;\n\tbubbleSort (arr, len);\n\tfor (i=0; i<len; i++)\n\t\tprintf (\"%d\\t\", arr[i]);\n\tputchar ('\\n');\n\treturn 0;\n}",
    "language": "cpp"
  },
  "node_id": "dailycode-121b4679b80f44f89234d09add8823ed",
  "license": "csdn.net",
  "created_at": 1637894160,
  "topic_link": "https://bbs.csdn.net/topics/600470243"
}