# Obsidian-Pseudocode - [Obsidian-Pseudocode](#obsidian-pseudocode) - [Features](#features) - [Future Features](#future-features) - [Usage](#usage) - [Basic](#basic) - [Preamble style customization](#preamble-style-customization) - [Export to a compilable LaTeX file](#export-to-a-compilable-latex-file) - [Installation](#installation) - [Credits](#credits) This is a plugin for [Obsidian](https://obsidian.md/) that allows you to render LaTeX-style pseudocode inside a code block. The plugin is based on [pseudocode.js](https://github.com/SaswatPadhi/pseudocode.js), a JavaScript library that typesets pseudocode beautifully to HTML. ## Features - Intuitive grammar: The plugin takes a LaTeX-style input that supports the algorithmic constructs from LaTeX's algorithm packages. With or without LaTeX experience, a user should find the grammar fairly intuitive. - Print quality: The HTML output produced by the plugin is (almost) identical with the pretty algorithms printed on publications that are typeset by LaTeX. - Math formula support: Inserting math formulas in the pseudocode is as easy as LaTeX. Just enclose math expression in `$...$` or `\(...\)`. - Auto-completion inside `pseudo` code block. (Release 1.1.0) - [Preamble style (macros) customization.](#preamble-style-customization) (Release 1.2.0) - [Export a LaTeX file that can be compiled, including any required additional macros.](#export-to-a-compilable-latex-file) (Release 1.3.0) ### Future Features - [ ] Syntax highlighting. ## Usage ### Basic To use the plugin, simply create a code block in your Obsidian note and add your pseudocode inside it. Then, add the language specifier `pseudo` (short for "pseudocode") to the code block. The plugin will automatically render the pseudocode as LaTeX. **Rocommend: use the command `Pseudocode: Insert a new pseudocode block` to start.** Here is an example: ``` ```pseudo \begin{algorithm} \caption{Quicksort} \begin{algorithmic} \Procedure{Quicksort}{$A, p, r$} \If{$p < r$} \State $q \gets $ \Call{Partition}{$A, p, r$} \State \Call{Quicksort}{$A, p, q - 1$} \State \Call{Quicksort}{$A, q + 1, r$} \EndIf \EndProcedure \Procedure{Partition}{$A, p, r$} \State $x \gets A[r]$ \State $i \gets p - 1$ \For{$j \gets p$ \To $r - 1$} \If{$A[j] < x$} \State $i \gets i + 1$ \State exchange $A[i]$ with $A[j]$ \EndIf \State exchange $A[i]$ with $A[r]$ \EndFor \EndProcedure \end{algorithmic} \end{algorithm} ``` ``` This will be rendered as: