Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Lets play a magic game. Pick any 4 digits integer, for example n = 1965. Perform following operations. Sort the digits in the number in descending order you will get m = 9651. Sort the digits in the number in ascending order you will get k= 1569. Let n = m-k = 9651-1569=8082. After repeating above three steps certain times, you will find n = 6174, and it will stay 6174 for ever! In other words if you start above three steps with initial n = 6174, you will find n is still 6174 at step 3! We call it number black hole. Write a C++ program to demonstrate this. Your program should let user to be able to test it as many times as the user wants as long as the user enters a 4-digits positive integer and your program should quits if the user enters anything else.

Lets play a magic game. Pick any 4 digits integer, for example n = 1965. Perform following operations. Sort the digits in the number in descending order you will get m = 9651. Sort the digits in the number in ascending order you will get k= 1569. Let n = m-k = 9651-1569=8082. After repeating above three steps certain times, you will find n = 6174, and it will stay 6174 for ever! In other words if you start above three steps with initial n = 6174, you will find n is still 6174 at step 3! We call it number black hole. Write a C++ program to demonstrate this. Your program should let user to be able to test it as many times as the user wants as long as the user enters a 4-digits positive integer and your program should quits if the user enters anything else.

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
Lets play a magic game. Pick any 4 digits integer, for example n = 1965. Perform following operations. Sort the digits in the number in descending order you will get m = 9651. • Sort the digits in the number in ascending order you will get k = 1569. • Let n = m-k = 9651-1569=8082. After repeating above three steps certain times, you will find n = 6174, and it will stay 6174 for ever! In other words if you start above three steps with initial n = 6174, you will find n is still 6174 at step 3! We call it number black hole. Write a C++ program to demonstrate this. Your program should let user to be able to test it as many times as the user wants as long as the user enters a 4-digits positive integer and your program should quits if the user enters anything else. Sample Design: I/Lab2.cpp // add statement to include iostream // add statement to use namespace std // declare all functions except main function here int getNumberOfDigits (int n); //returns how many digits in positive number n int* int2DynamicArray (int n, int numDigits); //convert n to an dynamic array int dynamicArray2int (int* intPointer, int numDigits); int sortDescending (int* intPointer, int numDigits) ; sortAscending (int* intPointer, int numDigits); getMegicHole (int n); int int int main () { int n = 1234, m, k, magicHole; int pi Cout << "Lab2: Team number# your real names " << endl; while (1) { //give input hints and get inputn from user //quit if it is not a 4 digits integer // magicHole = getMegicHole (n); //loop if it is not n. return 0; #Implement all functions you have declared here.
Transcribed Image Text:Lets play a magic game. Pick any 4 digits integer, for example n = 1965. Perform following operations. Sort the digits in the number in descending order you will get m = 9651. • Sort the digits in the number in ascending order you will get k = 1569. • Let n = m-k = 9651-1569=8082. After repeating above three steps certain times, you will find n = 6174, and it will stay 6174 for ever! In other words if you start above three steps with initial n = 6174, you will find n is still 6174 at step 3! We call it number black hole. Write a C++ program to demonstrate this. Your program should let user to be able to test it as many times as the user wants as long as the user enters a 4-digits positive integer and your program should quits if the user enters anything else. Sample Design: I/Lab2.cpp // add statement to include iostream // add statement to use namespace std // declare all functions except main function here int getNumberOfDigits (int n); //returns how many digits in positive number n int* int2DynamicArray (int n, int numDigits); //convert n to an dynamic array int dynamicArray2int (int* intPointer, int numDigits); int sortDescending (int* intPointer, int numDigits) ; sortAscending (int* intPointer, int numDigits); getMegicHole (int n); int int int main () { int n = 1234, m, k, magicHole; int pi Cout << "Lab2: Team number# your real names " << endl; while (1) { //give input hints and get inputn from user //quit if it is not a 4 digits integer // magicHole = getMegicHole (n); //loop if it is not n. return 0; #Implement all functions you have declared here.
Expert Solution
steps

Step by step

Solved in 3 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS