\section{Multi-objective search based refactoring}
\begin{frame}
    \frametitle{Algorithm : High-level pseudo-code of NSGA-II}
    \begin{columns}[c]
    \begin{column}{0.5\textwidth}
    \scalebox{0.8}{
    \begin{algorithm}[H]
        \LinesNumbered
        \TitleOfAlgo{NSGA-II}
        \SetKwData{Left}{left}\SetKwData{This}{this}\SetKwData{Up}{up}
        \SetKwFunction{Union}{Union}\SetKwFunction{FindCompress}{FindCompress}
        \SetKwInput{Entree}{Input}
        \SetKwInput{Sortie}{Output}
        \SetKw{Retour}{return}
        \SetKwFor{Pour}{for}{do}{done}
        \SetKwFor{Tq}{while}{do}{end}
        \SetKwFor{PourCh}{pour chaque}{faire}{fait}
        \SetKwFor{PourTous}{pour tout}{faire}{fait}
        \SetKwRepeat{Repeter}{répéter}{jusqu’à}
        \SetKwIF{Si}{SinonSi}{Sinon}{if}{then}{else if}{else}{{end if}}
        \SetKwSwitch{Match}{Case}{Other}{match}{ : }{cas}{autre cas}{{fin cas}}{{fin match}}
        {\only<1>{\color{umons-red}} $P_0 \leftarrow $ generate-pop-randomly() \\}
        {\only<2>{\color{umons-red}} $Q_0 \leftarrow$ create-new-pop($P_0$) }\\
        \Tq{{\only<5>{\color{umons-red}}stopping criteria not reached}}
        {
            {\only<3>{\color{umons-red}} $R_t \leftarrow P_t \cup Q_t $} \\
            {\only<4>{\color{umons-red}}
            $F \leftarrow \text{fast-non-dominated-sort}(R_t) $ \\
            $P_{t + 1} \leftarrow \emptyset \text{ and } i \leftarrow 1$ \\
            \Tq{$|P_{t+1}| + |F_i| \leq N$}
            {
                $\text{Apply crowding-distance-assignment}(F_i)$ \\
                $P_{t+1} \leftarrow P_{t+1} \cup F_i$ \\
                $i \leftarrow i+1$ \\
            }
            $Sort(F_i, \prec n)$ \\
            $P_{t+1} \leftarrow P_{t+1} \cup F_i[1 : (N - |P_{t+1}|)]$\\}
            $Q_{t+1} \leftarrow $ create-new-pop($P_{t+1}$)\\
            $t \leftarrow t+1$\\
        }
        \BlankLine
    \end{algorithm}}
    \end{column}
    \begin{column}{0.5\textwidth}
        \scalebox{0.9}{
        \vbox{
        \begin{itemize}
            \item \visible<1->{{\only<1>{\color{umons-red}}Create a random population $P_0$.}}
            \item \visible<2->{{\only<2>{\color{umons-red}}Generate a child population $Q_0$ from the population of parents $P_0$ using genetic operators such as crossover and mutations.}}
            \item \visible<3->{{\only<3>{\color{umons-red}}Merge both population ($Q_0$ and $P_0$) into an initial population $R_0$ of size $N$.}}
            \item \visible<4->{{\only<4>{\color{umons-red}}Select a subset of $R_0$ based on the dominance principle and crowing distance to create the next generation.}}
            \item \visible<5->{\only<5>{\color{umons-red}}Repeat this process until reaching the last iteration according to stop criteria.}
        \end{itemize}
    }}
    \end{column}
\end{columns}
\end{frame}