query: alignment within algorithm environment
positive_passages.docid: 22947
positive_passages.text: Alignment in algorithmic environment
negative_passages.docid: 16528
negative_passages.text: autoref for algorithms
negative_passages.docid: 77390
negative_passages.text: Aligning equations while using cases in align environment
negative_passages.docid: 129299
negative_passages.text: Fibonacci sequence and Euclidean algorithm's connection.
negative_passages.docid: 18445
negative_passages.text: How to generalize symmetry for higher-dimensional arrays?
negative_passages.docid: 52002
negative_passages.text: Stable separation for two classes of elements in an array
negative_passages.docid: 48728
negative_passages.text: Number equations and preserving alignment of equal signs
negative_passages.docid: 154571
negative_passages.text: Algorithm to find elements best fitting in a particular amount
negative_passages.docid: 14249
negative_passages.text: Algorithm for finding similar images
negative_passages.docid: 59530
negative_passages.text: Efficiently finding the intersection of a variable number of sets of strings
negative_passages.docid: 119257
negative_passages.text: Which package to use for writing algorithms?
negative_passages.docid: 136381
negative_passages.text: Fast input/output in competitive programming
negative_passages.docid: 112018
negative_passages.text: Multiple alignments
negative_passages.docid: 151939
negative_passages.text: How to align a set of multiline equations
negative_passages.docid: 3420
negative_passages.text: Uniqueness of Extended Euclidean Algorithm
negative_passages.docid: 98637
negative_passages.text: writing an algorithm in a table
negative_passages.docid: 84513
negative_passages.text: How to align a set of very long equations