Answered: am needing an algorithm (some linear…

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

Concept explainers

Question

I am needing an algorithm (some linear sort) that runs in O(n^2) time that will compar the number in two sets of data (arrays) and return the numbers that equal each other

What algorithm would run this in O(n lg n) time?

Expert Solution

Step 1

What algorithm would run this in O(n.logn) time?

Answer:

we can use binary search for O(n.logn) and we can do this using O(n) as well

the following also will take the O(n) :

int printCommon(int arr1[], int len1, int arr2[], int len2) {

int i=0,j=0;

while(len1 > i && len2 > j){

if (arr1[i] < arr2[j]) {
i++;

}else if(arr2[j] < arr1[i]){
j++;

} else {

printf("\nCommon element is %d",arr1[i]);
i++;
j++;
}
}

}

Step by step

Solved in 2 steps with 1 images

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