Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Fill in the code for problem.

Fill in the code for problem.

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

Fill in the code for problem.

#include<stdio.h> int main(){ int n; // number of elements in the list scanf("%i", &n); ?? list[??]; // list with duplicated elements // Input the elements for (int i = 0; i < ??; i++){ scanf("%??", &list[i]); } // Remove duplicates 1; // index 1; // index //why do we need two indeces? list[??]; int i int j int ref = int L[??]; // list without duplicated elements L[??] while (i<?? ) { list[??]; // Which will value be always in L? %3D if (list[i] ?? ref){ L[ ??] ref = list[??]; ??; list[??]; } ??; } // Printing results printf("BEFORE\n"); for (int i=0; i < ??; i++){ printf("%??", list[i]); } printf("\NAFTER\n"); for (int i= 0; i<??; i++){ printf("%??", L[i]); } printf("\n") ; return 0; }
Transcribed Image Text:#include<stdio.h> int main(){ int n; // number of elements in the list scanf("%i", &n); ?? list[??]; // list with duplicated elements // Input the elements for (int i = 0; i < ??; i++){ scanf("%??", &list[i]); } // Remove duplicates 1; // index 1; // index //why do we need two indeces? list[??]; int i int j int ref = int L[??]; // list without duplicated elements L[??] while (i<?? ) { list[??]; // Which will value be always in L? %3D if (list[i] ?? ref){ L[ ??] ref = list[??]; ??; list[??]; } ??; } // Printing results printf("BEFORE\n"); for (int i=0; i < ??; i++){ printf("%??", list[i]); } printf("\NAFTER\n"); for (int i= 0; i<??; i++){ printf("%??", L[i]); } printf("\n") ; return 0; }
You will receive an array whose size is variable. The user will give you the size of the array at the beginning. It will contain integers numbers in ascending order; however, it contains duplicates. Your job is to create a new array that does not contain duplicated elements. Then, you will print the input array and the new array. |(base) sebasjr@sebasjr-ubuntu:~$ ./a.out 10 0 1 1 2 2 3 3 4 5 5 BEFORE 0 1 1 2 2 3 3 4 5 5 AFTER 0 1 2 3 4 5 (base) sebasjr@sebasjr-ubuntu:~$ ./a.out 8 |-4 -3 -2 -1 0 1 2 3 BEFORE |-4 -3 -2 -1 0 1 2 3 AFTER |-4 -3 -2 -1 0 1 2 3
Transcribed Image Text:You will receive an array whose size is variable. The user will give you the size of the array at the beginning. It will contain integers numbers in ascending order; however, it contains duplicates. Your job is to create a new array that does not contain duplicated elements. Then, you will print the input array and the new array. |(base) sebasjr@sebasjr-ubuntu:~$ ./a.out 10 0 1 1 2 2 3 3 4 5 5 BEFORE 0 1 1 2 2 3 3 4 5 5 AFTER 0 1 2 3 4 5 (base) sebasjr@sebasjr-ubuntu:~$ ./a.out 8 |-4 -3 -2 -1 0 1 2 3 BEFORE |-4 -3 -2 -1 0 1 2 3 AFTER |-4 -3 -2 -1 0 1 2 3
Expert Solution
Step 1

Required corresponding code is filled according to comment in the code.

steps

Step by step

Solved in 3 steps with 1 images

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