Purchase Solution

Describe an Algorithm

Not what you're looking for?

Ask Custom Question

The question is attached and there are some clarifications

1. The integers are NOT sorted and you CANNOT sort them. You need to see if the numbers would match the pattern if you were to sort them.
2. a and b can be any integer and we don't know the values in advance.

Attachments
Purchase this Solution
Solution Summary

The solution describes an algorithm.

Solution Preview

The basic idea is to find a and b in O(n) time.
Here is the description of the algorithm, with input array A[1..n] of n integers.
Step 1: Find the smallest element y1 in A[1..n], this will take O(n) time.
Step 2: Find the largest element y2 in A[1..n], this will take O(n) time
If y1=y2, then return true. ...

Purchase this Solution
Free BrainMass Quizzes
C++ Operators

This quiz tests a student's knowledge about C++ operators.

Basic Networking Questions

This quiz consists of some basic networking questions.

Basic UNIX commands

Use this quiz to check your knowledge of a few common UNIX commands. The quiz covers some of the most essential UNIX commands and their basic usage. If you can pass this quiz then you are clearly on your way to becoming an effective UNIX command line user.

Inserting and deleting in a linked list

This quiz tests your understanding of how to insert and delete elements in a linked list. Understanding of the use of linked lists, and the related performance aspects, is an important fundamental skill of computer science data structures.

Word 2010: Tables

Have you never worked with Tables in Word 2010? Maybe it has been a while since you have used a Table in Word and you need to brush up on your skills. Several keywords and popular options are discussed as you go through this quiz.

View More Free Quizzes
Related BrainMass Solutions

  • Automata and Computability

    Problem 34 Problem: Describe the error in the following fallacious "proof" that P  NP. Consider an algorithm for SAT: "On input , try all possible assignments to the variables. Accept if any satisfy ."

  • Algorithm Problem

    Suppose a maximum flow for G has been computed, but an edge is now removed form E. Describe how the maximum flow can be efficiently updated. Analyze your algorithm. Let the removed edge by (u, v).

  • Optimization

    Describe the algorithm of gradiant of optimal for this function J. Algorithm: Given , by the algorithm of gradiant, we can find as follows.

  • Quadrature

    (d) In general, there are 3 conditions for stopping an iterative algorithm, describe each of them, and give an example of each by considering the problem of finding a solution of f(x) = 0. See the attached file. File attached has the solution.

  • Pseudocode for a Simple Task such as Turkey Sandwich.

    The difficult part of the algorithm was to describe the process of putting the cheddar and sliced_turkey. Another difficulty was dealing with different quantities; lb, oz, slices etc.

  • Describing Algorithms

    Describe an algorithm that will determine whether the numbers would be an arithmetic progression if they were sorted. Note: An arithmetic progression is a set of numbers of the form {a + bj | j = 0, 1, 2, ... n - 1} where a and b are both integers.

  • Algorithm to determine the depth of a comparison network

    107824 Describe an efficient algorithm to determine the depth of a comparison network with given representation. Mr. Johnson draws an n-input comparison network with m comparators according to the following conventions.

  • Optimization for Genetic Algorithms

    88234 Optimization for Genetic Algorithms This is reserve for a Specific OTA you can solve the problem using genetic algorithm(GA),but do you think you can get near the solution in the the "Result_2_Xugang" PDF file i sent.please describe why this

  • Discrete Math:Recursion

    Describe an induction process. How does induction process differ from a process of simple repetition? 3.

View More Related Solutions