You are given an array called source, with length n, and a set of m arrays called target, each also with length n. The arrays contain only positive integers. The arrays are unsorted. For any number x, the smallest number in target[x] is guaranteed to be smaller than target[x+1]. All the numbers in target are unique. The following figure illustrates an example of valid source and target arrays for this case, where n=5 and m=6. source = [14, 13, 15, 11, 12] target[0] = [4, 2, 1, 3, 5] target[1] = [6, 8, 7, 10, 9] target[2] = [14, 15, 12, 11, 13] target[3] = [17, 20, 16, 18, 19] target[4] = [22, 21, 24, 23, 25] target[5] = [30, 29, 28, 27, 26] The smallest number in each array in target is styled with bold and italic. You can quickly see that the smallest number in target[0] is smaller than the smallest number in target[1], the smallest number in target[1] is smaller than the smallest number in target[2], and so on. You can also see that there is no duplicate number within the arrays in target. You are asked to design an algorithm to find if there is an array in b that has the same set of numbers as in a. In the above case, your algorithm should return true, because b[2] has the same set of numbers as in a. Write down the pseudocode of your proposed algorithm.
You are given an array called source, with length n, and a set of m arrays called target, each also with length n. The arrays contain only positive integers. The arrays are unsorted. For any number x, the smallest number in target[x] is guaranteed to be smaller than target[x+1]. All the numbers in target are unique. The following figure illustrates an example of valid source and target arrays for this case, where n=5 and m=6. source = [14, 13, 15, 11, 12] target[0] = [4, 2, 1, 3, 5] target[1] = [6, 8, 7, 10, 9] target[2] = [14, 15, 12, 11, 13] target[3] = [17, 20, 16, 18, 19] target[4] = [22, 21, 24, 23, 25] target[5] = [30, 29, 28, 27, 26] The smallest number in each array in target is styled with bold and italic. You can quickly see that the smallest number in target[0] is smaller than the smallest number in target[1], the smallest number in target[1] is smaller than the smallest number in target[2], and so on. You can also see that there is no duplicate number within the arrays in target. You are asked to design an algorithm to find if there is an array in b that has the same set of numbers as in a. In the above case, your algorithm should return true, because b[2] has the same set of numbers as in a. Write down the pseudocode of your proposed algorithm.
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
Related questions
Question
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 2 images
Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education