Answered: w int[a.length]; for(int i = 0;…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

public class ArraySection {

static void arraySection(int a[], int b[]) {
int k = 0;
int [] c = new int[a.length];
for(int i = 0; i < a.length; i++) {
for(int j = 0; j < b.length; j++)
if(a[i] == b[j])
c[k++] = a[i];

}
for(int i = 0; i < k; i++)
System.out.println(c[i]);
System.out.println();
}
public static void main(String[] args) {

int a[] = { 1, 2, 3, 4, 5 };
int b[] = { 0, 2, 4,5 };


arraySection(a,b);

}
}

Calculate the algorithm step number and algorithm time complexity of the above program?

Expert Solution

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions