Latex 算法跨页（algorithm，breakablealgorithm）

最新推荐文章于 2023-05-11 21:48:17 发布

起点站

最新推荐文章于 2023-05-11 21:48:17 发布

阅读量6.4k

点赞数

分类专栏：环境配置

本文链接：https://blog.csdn.net/hxg2006/article/details/104426033

版权

环境配置专栏收录该内容

5 篇文章 1 订阅

订阅专栏

出处： https://tex.stackexchange.com/questions/33866/algorithm-tag-and-page-break

Latex算法跨页显示例子：

\documentclass{article}
\usepackage{algorithm,algpseudocode,float}
\usepackage{lipsum}
\makeatletter
\newenvironment{breakablealgorithm}
{% \begin{breakablealgorithm}
   \begin{center}
       \refstepcounter{algorithm}% New algorithm
       \hrule height.8pt depth0pt \kern2pt% \@fs@pre for \@fs@ruled
       \renewcommand{\caption}[2][\relax]{% Make a new \caption
           {\raggedright\textbf{\ALG@name~\thealgorithm} ##2\par}%
           \ifx\relax##1\relax % #1 is \relax
           \addcontentsline{loa}{algorithm}{\protect\numberline{\thealgorithm}##2}%
           \else % #1 is not \relax
           \addcontentsline{loa}{algorithm}{\protect\numberline{\thealgorithm}##1}%
           \fi
           \kern2pt\hrule\kern2pt
       }
   }{% \end{breakablealgorithm}
       \kern2pt\hrule\relax% \@fs@post for \@fs@ruled
   \end{center}
}
\makeatother

\begin{document}

   \listofalgorithms

   \section{Some section}

   \lipsum[1]

   \begin{algorithm}[H]
       \caption{Euclid’s algorithm}\label{euclid}
       \begin{algorithmic}[1]
           \Procedure{Euclid}{$a,b$}\Comment{The g.c.d.\ of~$a$ and~$b$}
           \State $r \gets a \bmod b$
           \While{$r \neq 0$}\Comment{We have the answer if~$r$ is~$0$}
           \State $a \gets b$
           \State $b \gets r$
           \State $r \gets a \bmod b$
           \EndWhile
           \State \textbf{return} $b$\Comment{The g.c.d.\ is~$b$}
           \EndProcedure
       \end{algorithmic}
   \end{algorithm}

   \lipsum[2]

   \begin{breakablealgorithm}
       \caption{Euclid’s algorithm}
       \begin{algorithmic}[1]
           \Procedure{Euclid}{$a,b$}\Comment{The g.c.d.\ of~$a$ and~$b$}
           \State $r \gets a \bmod b$
           \While{$r \neq 0$}\Comment{We have the answer if~$r$ is~$0$}
           \State $a \gets b$
           \State $b \gets r$
           \State $r \gets a \bmod b$
           \EndWhile
           \State \textbf{return} $b$\Comment{The g.c.d.\ is~$b$}
           \EndProcedure
       \end{algorithmic}
   \end{breakablealgorithm}

\end{document}