René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"第 88 期(算法-排序)：经典排序算法之插入排序","articleBody":"## 插入排序\r\n\r\n插入排序（Insertion sort）是一种简单直观且稳定的排序算法。\r\n\r\n- **原理：** 将每次插入的数和之前已经完成排序的序列进行重新排序。\r\n- **复杂度：** 时间复杂度：O(n²)，空间复杂度：O(1)\r\n- **稳定性：** 选插入排序是稳定的排序算法。\r\n\r\n![insertionSort](https://user-images.githubusercontent.com/9009389/63158457-dd562000-c04b-11e9-8b93-b6ae8ab19fda.gif)\r\n\r\n```js\r\nfunction insertionSort(arr) {\r\n  // 注意这里是从 arr[1] 开始的\r\n  for (var i = 1; i \u003c arr.length; i++) {\r\n    var preIndex = i - 1;\r\n    var current = arr[i];\r\n    \r\n    while (preIndex \u003e= 0 \u0026\u0026 arr[preIndex] \u003e current) {\r\n      arr[preIndex + 1] = arr[preIndex];\r\n      preIndex--;\r\n    }\r\n\r\n    arr[preIndex + 1] = current;\r\n  }\r\n\r\n  return arr;\r\n}\r\n```","author":{"url":"https://github.com/wingmeng","@type":"Person","name":"wingmeng"},"datePublished":"2019-08-16T09:33:08.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":0},"url":"https://github.com/91/fe-practice-hard/issues/91"}