<commit_before>## Chapter 2 算法基础

### 2.1 插入排序

#### 2.1-1
>1. 31 41 59 26 41 58  
2. 31 41 59 26 41 58  
3. 26 31 41 59 41 58
4. 26 31 41 41 59 58
5. 26 31 41 41 58 59

#### 2.1-2
    INSERRT_SORT(A)
      for j=2 to A.length
      key = A[j]
      i = j-1
      while i>0 and A[i]<key
        A[i+1] = A[i]<commit_msg>Update question.md<commit_after>## Chapter 2 算法基础

### 2.1 插入排序

#### 2.1-1
>1. 31 41 59 26 41 58  
>2. 31 41 59 26 41 58  
>3. 26 31 41 59 41 58
>4. 26 31 41 41 59 58
>5. 26 31 41 41 58 59

#### 2.1-2
    INSERRT_SORT(A)
      for j=2 to A.length
      key = A[j]
      i = j-1
      while i>0 and A[i]<key
        A[i+1] = A[i]
{'fraction_non_alphanumeric': 0.14946070878274267, 'fraction_numerical': 0.24036979969183359, 'mean_word_length': 1.7196652719665273, 'pattern_counts': {'":': 0, '<': 5, '<?xml version=': 0, '>': 11, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '5076755', 'n_tokens_mistral': 441, 'n_tokens_neox': 316, 'n_words': 116}