fix sorting logic

app.py

@@ -401,22 +401,29 @@ def create_html_output(job_result: Dict, resume_results: List[Dict]) -> str:
         while i < len(sorted_resumes):
             current = sorted_resumes[i]
             similar_exp = [current]
+            indices_to_remove = []
             j = i + 1
             
             # Find all resumes with similar experience to the current one
             while j < len(sorted_resumes) and sorted_resumes[j]['match_count'] == current['match_count']:
                 if abs(sorted_resumes[j]['total_experience'] - current['total_experience']) <= 1:
                     similar_exp.append(sorted_resumes[j])
-                    sorted_resumes.pop(j)
-                else:
-                    j += 1
+                    indices_to_remove.append(j)
+                j += 1
             
             # Sort by quality score if there are resumes with similar experience
             if len(similar_exp) > 1:
                 similar_exp.sort(key=lambda x: -x['quality_score'])
             
             final_sorted.extend(similar_exp)
-            i = j if len(similar_exp) == 1 else i + 1
+            
+            # Create a new list without the removed indices
+            sorted_resumes = [r for idx, r in enumerate(sorted_resumes) if idx != i and idx not in indices_to_remove]
+            
+            # We don't need to increment i since we've created a new list without the processed items
+            # but if the list is empty, we need to break out of the loop
+            if not sorted_resumes:
+                break
         
         # Add sorted rows to summary table
         for resume_data in final_sorted: