# Describe a worst-case linear time algorithm that decides if a given sequence of integers (a1, a2,...,an) is a permutation...

This problem has been solved!

Do you need an answer to a question different from the above? Ask your question!

## Question:

**Related Book For**

## Introduction to Algorithms

ISBN: 978-0262033848

3rd edition

Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest

**View Solution**

Create a free account to access the answer

**Cannot find your solution?**

Post a FREE question now and get an answer within minutes.
* Average response time.

**Question Details**

Chapter #

**17**Section: Problem

Problem: 1

**Posted Date:**September 09, 2023 03:37:46