title: Approximate Comparison of one huge nested list with elements of another huge nested list
body: <p>I have two nested lists one with around <code>10K x 6</code> elements.Other nested list has <code>28K * 15</code> elements.</p>
  
  <p>This is the pseudo logic I'm implementing using nested loops for doing approximate comparison</p>
  
  <pre><code>if nested_list_1[iter_1][0] and nested_list_1[iter_2][3] appoximate_ratio &gt; 85:
      if nested_list_1[iter_1][2] and nested_list_1[iter_2][4] appoximate_ratio &gt; 85:
          save_to_another_list
  </code></pre>
  
  <p>I can use nested loops to iterate over each element and do the approximate comparison. But it is taking a lot of time. Is there a way to minimize the consumption time?</p>
  
  <pre><code>for i in range(len(nested_list_1)): #length 10000
      data_1_part_1 = nested_list_1[i][0] 
      data_1_part_2 = nested_list_1[i][1] 
  
      for j in range(len(nested_list_2)): #length 28000
          data_2_part_1 = nested_list_2[j][9] 
          data_2_part_2 = nested_list_2[j][15]
  
          if fuzzy_ratio(data_2_part_1,data_1_part_1) &gt; 85:
  
              if fuzzy_ratio(data_2_part_2,data_1_part_2) &gt; 85:
  
                  writing_csv_file(nested_list_1[i])
  </code></pre>