Data structures and algorithms in C++
Data structures and algorithms in C++
2nd Edition
ISBN: 9780470460443
Author: Goodrich
Publisher: WILEY
Expert Solution & Answer
Book Icon
Chapter 1, Problem 3C

Explanation of Solution

Program code:

//include the required header files

#include<iostream>

#include<vector>

//use std namespace

using namespace std;

//define main() function

int main()

{

//create vector a

vector<int> a;

//declare required integer variables

int n;

int inp;

int count;

//prompt the user to enter the number of elements

cout << "Enter number of elements:" << endl;

//scan for the value

cin >> n;

//prompt the user to enter the number

cout << "Enter numbers:" << endl;

//iterate a for loop

for (int i = 0; i<n; i++)

{

//scan for the values

cin >> inp;

//push in to the vector

a.push_back(inp);

}

//iterate a for loop

for (int i = 0; i<n; i++)

{

//set the count equal to 0

count = 0;

//iterate a for loop

for (int j=0; j<n; j++)

{

    //if the value of "j" is not equal to "i"

    if (j != i)

    {

        //if the value of at i and j are equal

        if (a[i] == a[j])

            //increment the count

            count++;

    }

    }

    //if the value of count is greater than 0

    if (count > 0)

        //break

        break;

}

...

Blurred answer
Students have asked these similar questions
What are the charts (with their title name) that could be use to illustrate the data? Please give picture examples.
A design for a synchronous divide-by-six Gray counter isrequired which meets the following specification.The system has 2 inputs, PAUSE and SKIP:• While PAUSE and SKIP are not asserted (logic 0), thecounter continually loops through the Gray coded binarysequence {0002, 0012, 0112, 0102, 1102, 1112}.• If PAUSE is asserted (logic 1) when the counter is onnumber 0102, it stays here until it becomes unasserted (atwhich point it continues counting as before).• While SKIP is asserted (logic 1), the counter misses outodd numbers, i.e. it loops through the sequence {0002,0112, 1102}.The system has 4 outputs, BIT3, BIT2, BIT1, and WAITING:• BIT3, BIT2, and BIT1 are unconditional outputsrepresenting the current number, where BIT3 is the mostsignificant-bit and BIT1 is the least-significant-bit.• An active-high conditional output WAITING should beasserted (logic 1) whenever the counter is paused at 0102.(a) Draw an ASM chart for a synchronous system to providethe functionality described above.(b)…
S A B D FL I C J E G H T K L Figure 1: Search tree 1. Uninformed search algorithms (6 points) Based on the search tree in Figure 1, provide the trace to find a path from the start node S to a goal node T for the following three uninformed search algorithms. When a node has multiple successors, use the left-to-right convention. a. Depth first search (2 points) b. Breadth first search (2 points) c. Iterative deepening search (2 points)

Chapter 1 Solutions

Data structures and algorithms in C++

Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education