Skip to main content

Engineering Computer Science C++ How to Program (10th Edition)

To explain the effect of applying the unique algorithm to a sorted sequence of elements in a range. The unique algorithm works best with a sorted sequence as it removes duplicate elements only if they are consecutive. Suppose a sequence is 3 4 4 8 9 8 20. Then it will have the following elements after applying a unique algorithm. 3 4 8 9 20. And if the sequence is not sorted: 13 4 4 8 13 8 20 Then it will have the following elements after applying a unique algorithm (only removes consecutive duplicate 4, not 13 and 8). 13 4 8 13 8 20 Example // Include header files #include <iostream> #include<vector> #include <algorithm> using namespace std; // start main function int main() { vector < int > num1 = { 2, 2, 9, 9, 12, 13, 16, 17 }; vector < int > ::iteratorip; cout<< "Sorted Array"; cout<< "\nBefore using unique"; for (int i = 0; i< num1.size(); i++) cout<< ' ' << num1.at(i); ip = unique(num1.begin(), num1.end()); num1.resize(distance(num1.begin(), ip)); cout<< "\nAfter using unique"; for (ip = num1.begin(); ip != num1.end(); ip++) cout<< ' ' << * ip; vector < int > num2 = { 2, 2, 9, 10, 9, 12, 14, 12, 17 }; cout<< "\nUnsorted Array"; cout<< "\nBefore using unique"; for (int i = 0; i< num2.size(); i++) cout<< ' ' << num2.at(i); ip = unique(num2.begin(), num2.end()); num2.resize(distance(num2.begin(), ip)); cout<< "\nAfter using unique"; for (ip = num2.begin(); ip != num2.end(); ip++) cout<< ' ' << * ip; return 0; } Sample Output: Line 15: When a unique statement is used on a sorted array, then all the duplicate items are removed. Instead of entering items in a sorted manner, we can also use the “sort()” function to sort the vector elements. Line 25: When a unique statement is used on an unsorted array, then all the duplicate items are not removed, only those elements which are consecutive are made unique.

To explain the effect of applying the unique algorithm to a sorted sequence of elements in a range. The unique algorithm works best with a sorted sequence as it removes duplicate elements only if they are consecutive. Suppose a sequence is 3 4 4 8 9 8 20. Then it will have the following elements after applying a unique algorithm. 3 4 8 9 20. And if the sequence is not sorted: 13 4 4 8 13 8 20 Then it will have the following elements after applying a unique algorithm (only removes consecutive duplicate 4, not 13 and 8). 13 4 8 13 8 20 Example // Include header files #include <iostream> #include<vector> #include <algorithm> using namespace std; // start main function int main() { vector < int > num1 = { 2, 2, 9, 9, 12, 13, 16, 17 }; vector < int > ::iteratorip; cout<< "Sorted Array"; cout<< "\nBefore using unique"; for (int i = 0; i< num1.size(); i++) cout<< ' ' << num1.at(i); ip = unique(num1.begin(), num1.end()); num1.resize(distance(num1.begin(), ip)); cout<< "\nAfter using unique"; for (ip = num1.begin(); ip != num1.end(); ip++) cout<< ' ' << * ip; vector < int > num2 = { 2, 2, 9, 10, 9, 12, 14, 12, 17 }; cout<< "\nUnsorted Array"; cout<< "\nBefore using unique"; for (int i = 0; i< num2.size(); i++) cout<< ' ' << num2.at(i); ip = unique(num2.begin(), num2.end()); num2.resize(distance(num2.begin(), ip)); cout<< "\nAfter using unique"; for (ip = num2.begin(); ip != num2.end(); ip++) cout<< ' ' << * ip; return 0; } Sample Output: Line 15: When a unique statement is used on a sorted array, then all the duplicate items are removed. Instead of entering items in a sorted manner, we can also use the “sort()” function to sort the vector elements. Line 25: When a unique statement is used on an unsorted array, then all the duplicate items are not removed, only those elements which are consecutive are made unique.

Solution Summary: The author explains the effect of applying the unique algorithm to a sorted sequence of elements.

C++ How to Program (10th Edition)

C++ How to Program (10th Edition)

10th Edition

ISBN: 9780134448237

Author: Paul J. Deitel, Harvey Deitel

Publisher: PEARSON

See similar textbooks

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

Blurred answer

Chapter 16, Problem 16.6E

Chapter 16, Problem 16.8E

Students have asked these similar questions

What is the largest number of elements that will be examined if you do a sequential search of 4000 names?

What is the maximum number of elements that will be inspected if a sequential search of 4000 names is performed?

The efficiency of selection sort is not affected by the original order of the elements. True False

Chapter 16 Solutions

C++ How to Program (10th Edition)

Ch. 16 - Exercises 16.4 State whether each of the following...Ch. 16 - Fill in the blanks in each of the following...Ch. 16 - Prob. 16.6E Ch. 16 - Prob. 16.7E Ch. 16 - (Duplicate Elimination) Read 20 integers into an...Ch. 16 - (Duplicate Elimination) Modify Exercise 16.8 to...Ch. 16 - Prob. 16.10E Ch. 16 - (Merging Ordered Lists) Write a program that uses...Ch. 16 - Prob. 16.12E Ch. 16 - Prob. 16.13E

Ch. 16 - Prob. 16.14E

Knowledge Booster

Background pattern image

Similar questions

SEE MORE QUESTIONS

Recommended textbooks for you

EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage

Text book image

EBK JAVA PROGRAMMING

Computer Science

ISBN:9781337671385

Author:FARRELL

Publisher:CENGAGE LEARNING - CONSIGNMENT

Text book image

Programming Logic & Design Comprehensive

Computer Science

ISBN:9781337669405

Author:FARRELL

Publisher:Cengage

SEE MORE TEXTBOOKS