[Tex/LaTex] Long algorithm doesn’t split into two pages

algorithms

I wrote an algorithm but it is long and it can't fit in one page but my problem is that it doesn't split into two page .. what happen is that a part of the algorithm appears in the first page and the rest disappears as shown in the figure below .. any solution?

enter image description here

and this is the code of the algorithm:

\begin{algorithm}
\caption{Calculating Score}\label{euclid}
\begin{algorithmic}[1]
\Procedure{CheckBetaamplitude}{}
\State $i \gets find(absolute()<maxamp)$
\State $n \gets length(i)$
\State $s(1) \gets n/length()$

\State $i \gets find(absolute()<maxamp)$
\State $n \gets length(i)$
\State $s(2) \gets n/length()$

\State $i \gets find(absolute()<maxamp)$
\State $n \gets length(i)$
\State $s(3) \gets n/length()$

\State $i \gets find(absolute()<maxamp)$
\State $n \gets length(i)$
\State $s(4) \gets n/length()$

\State $i \gets find(absolute()<maxamp)$
\State $n \gets length(i)$
\State $s(5) \gets n/length()$

\State $i \gets find(absolute()<maxamp)$
\State $n \gets length(i)$
\State $s(6) \gets n/length()$

\State $i \gets find(absolute()<maxamp)$
\State $n \gets length(i)$
\State $s(7) \gets n/length()$

\State $i \gets find(absolute()<maxamp)$
\State $n \gets length(i)$
\State $s(8) \gets n/length()$

\State $i \gets find(absolute()<maxamp)$
\State $n \gets length(i)$
\State $s(9) \gets n/length()$

\State $i \gets find(absolute()<maxamp)$
\State $n \gets length(i)$
\State $s(10) \gets n/length()$

\State $i \gets find(absolute()<maxamp)$
\State $n \gets length(i)$
\State $s(11) \gets n/length()$

\State $i \gets find(absolute()<maxamp)$
\State $n \gets length(i)$
\State $s(12) \gets n/length()$

\State $i \gets find(absolute()<maxamp)$
\State $n \gets length(i)$
\State $s(13) \gets n/length()$

\State $i \gets find(absolute()<maxamp)$
\State $n \gets length(i)$
\State $s(14) \gets n/length()$

\State $i \gets find(absolute()<maxamp)$
\State $n \gets length(i)$
\State $s(15) \gets n/length()$

\State $i \gets find(absolute()<maxamp)$
\State $n \gets length(i)$
\State $s(16) \gets n/length()$

\State $i \gets find(absolute()<maxamp)$
\State $n \gets length(i)$
\State $s(17) \gets n/length()$

\State $i \gets find(absolute()<maxamp)$
\State $n \gets length(i)$
\State $s(18) \gets n/length()$

\State $i \gets find(absolute()<maxamp)$
\State $n \gets length(i)$
\State $s(19) \gets n/length()$


\State $score4 \gets Average(s)$
\EndProcedure
\end{algorithmic}
\end{algorithm}

Best Answer

here you go :)

\begin{algorithm}
    \caption{Calculating Score}\label{euclid}
    \begin{algorithmic}[1]
    \Procedure{CheckBetaamplitude}{}
    \State $i \gets find(absolute()<maxamp)$
    \State $n \gets length(i)$
    \State $s(1) \gets n/length()$
    \State $i \gets find(absolute()<maxamp)$
    \State $n \gets length(i)$
    \State $s(2) \gets n/length()$
    \State $i \gets find(absolute()<maxamp)$
    \State $n \gets length(i)$
    \State $s(3) \gets n/length()$
    \State $i \gets find(absolute()<maxamp)$
    \State $n \gets length(i)$
    \State $s(4) \gets n/length()$
    \State $i \gets find(absolute()<maxamp)$
    \State $n \gets length(i)$
    \State $s(5) \gets n/length()$
    \State $i \gets find(absolute()<maxamp)$
    \State $n \gets length(i)$
    \State $s(6) \gets n/length()$
    \State $i \gets find(absolute()<maxamp)$
    \State $n \gets length(i)$
    \State $s(7) \gets n/length()$
    \State $i \gets find(absolute()<maxamp)$
    \State $n \gets length(i)$
    \State $s(8) \gets n/length()$
    \State $i \gets find(absolute()<maxamp)$
    \State $n \gets length(i)$
    \State $s(9) \gets n/length()$
    \State $i \gets find(absolute()<maxamp)$
    \State $n \gets length(i)$
    \State $s(10) \gets n/length()$
    \State $i \gets find(absolute()<maxamp)$
    \State $n \gets length(i)$
    \State $s(11) \gets n/length()$
    \EndProcedure
    \algstore{myalg}
    \end{algorithmic}
    \end{algorithm}
    \begin{algorithm}                     
    \begin{algorithmic} [1]              
    \algrestore{myalg}
    \State $i \gets find(absolute()<maxamp)$
    \State $n \gets length(i)$
    \State $s(12) \gets n/length()$
    \State $i \gets find(absolute()<maxamp)$
    \State $n \gets length(i)$
    \State $s(13) \gets n/length()$
    \State $i \gets find(absolute()<maxamp)$
    \State $n \gets length(i)$
    \State $s(14) \gets n/length()$
    \State $i \gets find(absolute()<maxamp)$
    \State $n \gets length(i)$
    \State $s(15) \gets n/length()$
    \State $i \gets find(absolute()<maxamp)$
    \State $n \gets length(i)$
    \State $s(16) \gets n/length()$
    \State $i \gets find(absolute()<maxamp)$
    \State $n \gets length(i)$
    \State $s(17) \gets n/length()$
    \State $i \gets find(absolute()<maxamp)$
    \State $n \gets length(i)$
    \State $s(18) \gets n/length()$
    \State $i \gets find(absolute()<maxamp)$
    \State $n \gets length(i)$
    \State $s(19) \gets n/length()$
    \State $score4 \gets Average(s)$
    \end{algorithmic}
    \end{algorithm}

Related Solutions

[Tex/LaTex] Place two algorithm into two column

Do you mean like this? I have used mulitcols inside algorithmic with a \columnbreak between the algorithms. Note there is only one caption command available.

Sample output

\documentclass{article}

\usepackage{algorithm,algorithmic,multicol}

\begin{document}

\begin{algorithm}[h]
  \caption{Resolve 1 and 3}
  \begin{multicols}{2}
    \begin{algorithmic}
      \scriptsize
      \STATE $ P_i $ sends $ id,t_1,t_2,P_j,h_j $ to TTP where $ P_j $ is the party that does not send $ V_j^{(2)} $ to $ P_i $, TTP does the following and sends the returned message to $P_i$:

      \IF{$ currenttime > t_1 $}
      \STATE \textbf{send} $ msg $ ``Abort Resolve 1"
      \ELSE
      \IF { Search($ id, t_1, t_2 $) == NULL }
      \STATE lst = Create($ id, t_1, t_2 $) 
      \STATE slst = Create($ id, t_1, t_2 $)
      \STATE lst.add($ P_i, (P_j,h_j) $) 
      \STATE \textbf{send} $ msg $ ``Come after $ t_2 $"
      \ELSE 
      \STATE logical lst.add($ P_i, (P_j,h_j $)) 
      \STATE \textbf{send} $ msg $ ``Come after $ t_2 $"
      \ENDIF
      \ENDIF
    \end{algorithmic}
    \columnbreak
    \begin{algorithmic}
      \scriptsize
      \STATE $ P_i $ comes either to receive decryption of a $ \{V^(2)_t\}_{t \in M} $ where $ M \subseteq N $ or his desired decryption shares from TTP's record.
      \STATE $ condition $  =  lst.isEmpty()
      \IF {$ condition $ is false }
      \STATE \textbf{send} msg `Code` 
      `Protocol is aborted"
      \ELSE
      \IF {$ P_i $ give $\{V^(2)_t\}_{t \in M} $}
      \FORALL {$ t $ in $ M $}
      \STATE \textbf{send} Decrypt($ sk, V^(2)_t $)
      \ENDFOR 
      \ELSE 
      \FORALL {$ t $ in $ slst $ as $ (P_i, shares_t) $}
      \STATE \textbf{send} $ shares_t $
      \ENDFOR
      \ENDIF
      \ENDIF
    \end{algorithmic}
  \end{multicols}
\end{algorithm}

\end{document}

[Tex/LaTex] How to split two steps in one algorithm box for LaTeX

Perhaps you can use \Statex from algpseudocode to "comment" a step or break:

\documentclass{article}

\usepackage{algorithm,algpseudocode}
\algnewcommand{\And}{\textbf{and}}

\begin{document}

\begin{algorithm}
  \caption{A two-step algorithm}
  \begin{algorithmic}[1]
    \Statex \textit{First step}
    \While{$X\ \And\ Y$}
      \State Statement~1
      \If{$Z$}
        \State Statement~2
      \EndIf
    \EndWhile
    \Statex \textit{Second step}
    \While{$Y\ \And\ X$}
      \State Statement~3
      \If{$Z$}
        \State Statement~4
      \EndIf
    \EndWhile
  \end{algorithmic}
\end{algorithm}

\end{document}

Best Answer

Related Solutions

[Tex/LaTex] Place two algorithm into two column

[Tex/LaTex] How to split two steps in one algorithm box for LaTeX

Related Question