1- Add a new element in the index 2- Delete all occurrences of the element in the array Array.. (data structure in java)

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...
icon
Related questions
Question
import java.util.Scanner;
public class Task {
static Scanner cin=new Scanner(System.in);
int n;
1- Add a new
element in the
{
System.out.print("Enter n: ");
n=cin.nextInt();
}
intJarr=new int[100];
void read(){
for(int i=0;i<n;i++){
System.out.println("Enter list["+i+"]");
arrli)=cin.nextInt(;
}
}
void print0{
for(int i=0;i<n;i++){
System.out.printin(arrfi]+" ");
index
2- Delete all occurrences
of
the element in the array
Array..
(data structure in java)
}
void sort() {
int temp = 0;
for (int i = 0; i<n; i++) {
for (int j = i+1;j< n; j++) {
temp = arrli);
if (arrli) > arrlil) {
arrti] = arrli);
arrlj] = temp;
for (int i = 0; i <n; i++) {
System.out.print(arrli] + " ");
}
int Searsh() {
int num;
System.out.println("Enter number search");
num = cin.nextint()B
int low=0;
int right =n-1;
while (low<= right){
int mid=(low+right)/2;
if(arr[mid]==num){
return mid;
}
else if(arr[mid] > num){
right=mid-1;
}
else {
low=mid+1;
}
return -1;
}
Transcribed Image Text:import java.util.Scanner; public class Task { static Scanner cin=new Scanner(System.in); int n; 1- Add a new element in the { System.out.print("Enter n: "); n=cin.nextInt(); } intJarr=new int[100]; void read(){ for(int i=0;i<n;i++){ System.out.println("Enter list["+i+"]"); arrli)=cin.nextInt(; } } void print0{ for(int i=0;i<n;i++){ System.out.printin(arrfi]+" "); index 2- Delete all occurrences of the element in the array Array.. (data structure in java) } void sort() { int temp = 0; for (int i = 0; i<n; i++) { for (int j = i+1;j< n; j++) { temp = arrli); if (arrli) > arrlil) { arrti] = arrli); arrlj] = temp; for (int i = 0; i <n; i++) { System.out.print(arrli] + " "); } int Searsh() { int num; System.out.println("Enter number search"); num = cin.nextint()B int low=0; int right =n-1; while (low<= right){ int mid=(low+right)/2; if(arr[mid]==num){ return mid; } else if(arr[mid] > num){ right=mid-1; } else { low=mid+1; } return -1; }
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

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