前言

记录写论文过程中需要重复用的一些小技巧：

一、如何在IEEE论文中添加伪代码pseudocode

pseudocode是经常需要在论文中使用的流程图，掌握如何写伪代码图是必须得。

1.引入库

代码如下（示例）：

# 头部添加不可少的包
\usepackage{algorithm}
\usepackage{algorithmic}
\makeatletter
\newcommand{\removelatexerror}{\let\@latex@error\@gobble}# 在正文中添加如下内容，即可生成伪代码图
\begin{figure}[!t]\label{alg:LSB}\renewcommand{\algorithmicrequire}{\textbf{Input:}}\renewcommand{\algorithmicensure}{\textbf{Output:}}\removelatexerror\begin{algorithm}[H]\caption{Local Search Based Algorithm}\begin{algorithmic}[1]\REQUIRE Candidate set $\mathbb{S}$, Initial set $\mathbb{X} = \varnothing$          %%input\ENSURE Optimum set $\mathbb{X}$  %%output\STATE Let $\mathbb{X} \leftarrow r$, if $\widetilde u({v})$ is the maximum over all singletons $r \in \mathbb{S}$.\WHILE {there exists an element $a \in R\backslash S$ such that $\widetilde u(S \cup \left\{ a \right\}) > \left( {1 + \frac{\varepsilon }{{{n^2}}}} \right)\widetilde u(S)$}\STATE let $S \leftarrow S \cup \left\{ a \right\}$.\ENDWHILE\WHILE{there exists an element $a \in S$ such that $\widetilde u(S\backslash \left\{ a \right\}) > \left( {1 + \frac{\varepsilon }{{{n^2}}}} \right)\widetilde u(S)$}\STATE let $S \leftarrow S\backslash \left\{ a \right\}$.\ENDWHILE\STATE Return the maximum of $\widetilde u(S)$ and $\widetilde u(R\backslash S)$, where the local optimal set is $S$ or $R\backslash S$.\end{algorithmic}\end{algorithm}
\end{figure}

总结

持续更新