Question $4($Pseudo$-$Code of Two$-$Opt Algorithm$)(24$ points$)(8$ points each$)$

$2-$opt Pseudo Code $($Time Critical Part$)$

$\frac{\frac{?}{?}}{?}$ city $[$i$]$ is $i^{th}$ city $($permutation array$)$

#define dist$($a$,$b$)$ dmat$[$city$[$a$]][$city$[$b$]]$

do $\{$

minchange $=0$;

Distance matrix: $O(n^2)$ time and space

for $j++O(n^2)=$dist$(i,j)+$dist$(i+1,j+1)(j,j+1)=O(1)mini=i$;minj$=j$