Skip to content
Home
Marketing
Marketing – vCMO
Expertise
Development
Software Development
Salesforce Development
WordPress Plugin Development
Full-Stack Web Development
Automation
Business Coach
About Matthew Maennche
Resources
C++ Solution Map
Java Solution Map
Python Solution Map
Visual Basic Solution Map
FAQ
Contact
Log In
Blog
Learn To Code
1668 Posts
Java
831 Posts
C++
578 Posts
Visual Basic
232 Posts
Aprender a codificar
101 Posts
Java
52 Posts
Python
30 Posts
Pitón
30 Posts
C ++
19 Posts
Kodlamayı Öğren
11 Posts
Business
10 Posts
Java
9 Posts
General
8 Posts
PHP
5 Posts
Web Development
1685 Posts
Classic ASP
4 Posts
piton
2 Posts
FPDF
2 Posts
Javascript
2 Posts
BuddyPress
2 Posts
Content Management
2 Posts
CRM's
1 Post
HTML
1 Post
SQL
1 Post
Uncategorized
1 Post
Sin categorizar
1 Post
Random
1 Post
Microsoft Dynamics CRM
1 Post
Search
In this exercise, you will write some code that reads n unique (no duplicates!) non-negative integers, each one less than fifty (50). Your code will print them in sorted order without using any nested loops — potentially very efficient! We’ll walk you through this: First, assume you are given an int variable n, that contains the number of integers to read from standard input. Also assume you are given an array, named wasReadIn, of fifty (50) bool elements and initialize all the elements to false. Third, read in the n integers from the input, and each time you read an integer, use it as an index into the bool array, and assign that element to be true — thus “marking” in the array which numbers have been read. Lastly the “punchline”: write a loop that traverses the bool array: every time it finds an element that is true it prints out the element ‘s INDEX — which was one of the integers read in. Place all the numbers on a single line, separated by a single spaces. Note: this technique is not limited to 50 elements — it works just as well for larger values. Thus, for example you could have an array of 1,000,000 elements (that’s right — one million!) and use it to sort numbers up to 1,000,000 in value!
View Solution
Scroll To Top