Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 428

The DOI matches its Crossref record.

Introduction to Algorithms

Fortney, Jon Pierre·2020·Discrete Mathematics for Computer Science

Abstract

This chapter looks at a number of different algorithms to get some practice in tracing and trying to understand algorithms. Algorithms play an extremely important role in both computer science and mathematics. Algorithms are detailed instructions on how to carry out some specific task. Computer programs are implementations of algorithms, so it is very important that computer science majors and programmers have a good understanding of how algorithms work. Designing an algorithm is one of the first steps in writing a computer program. In order to make algorithms easier for understand they are written in a form of English called pseudocode. Algorithms use something called control structures to tell the algorithm what to do at different times. These are instructions that control how the algorithm works. Conditional controls give conditions for the execution of an algorithm step. Loop controls tell how many times a step in the algorithm should be executed.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1201/9781003091479-1

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 428

Metadata

Authors
Fortney, J. P.
Venue
Discrete Mathematics for Computer Science
Published
2020-12-23
Pages
1-18
OpenAlex
W3111526966
Cited by
428
References
0
FWCI
40.73
Type
book chapter
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Introduction to Algorithms. https://app.cochat.ai/papers/10.1201/9781003091479-1
The paper
Fortney, J. P. (2020). Introduction to Algorithms. Discrete Mathematics for Computer Science. https://doi.org/10.1201/9781003091479-1

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.