assess the complexity of two_peak terms of n (in theory - hand calculation) def findMax(arr,mid,max): max_index = 0 for i in range(4): if (max < arr[i][mid]): max = arr[i][mid] max_index = i return max,max_index def findPeakRec(arr,mid): max = 0 max, max_index = findMax(arr, mid, max) if (mid == 0 or mid == 4 - 1): return max if (max >= arr[max_index][mid - 1] and max >= arr[max_index][mid + 1]): return max if (max < arr[max_index][mid - 1]): return findPeakRec(arr, mid - ceil(mid / 2.0)) if (max < arr[max_index][mid+1]): return findPeakRec(arr,mid + ceil(mid / 2.0)) def two_peak(arr): return findPeakRec(arr, 4 // 2)
assess the complexity of two_peak terms of n (in theory - hand calculation) def findMax(arr,mid,max): max_index = 0 for i in range(4): if (max < arr[i][mid]): max = arr[i][mid] max_index = i return max,max_index def findPeakRec(arr,mid): max = 0 max, max_index = findMax(arr, mid, max) if (mid == 0 or mid == 4 - 1): return max if (max >= arr[max_index][mid - 1] and max >= arr[max_index][mid + 1]): return max if (max < arr[max_index][mid - 1]): return findPeakRec(arr, mid - ceil(mid / 2.0)) if (max < arr[max_index][mid+1]): return findPeakRec(arr,mid + ceil(mid / 2.0)) def two_peak(arr): return findPeakRec(arr, 4 // 2)
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
assess the complexity of two_peak
terms of n (in theory - hand calculation)
def findMax(arr,mid,max):
max_index = 0
for i in range(4):
if (max < arr[i][mid]):
max = arr[i][mid]
max_index = i
return max,max_index
def findPeakRec(arr,mid):
max = 0
max, max_index = findMax(arr, mid, max)
if (mid == 0 or mid == 4 - 1):
return max
if (max >= arr[max_index][mid - 1] and
max >= arr[max_index][mid + 1]):
return max
if (max < arr[max_index][mid - 1]):
return findPeakRec(arr, mid - ceil(mid / 2.0))
if (max < arr[max_index][mid+1]):
return findPeakRec(arr,mid + ceil(mid / 2.0))
def two_peak(arr):
return findPeakRec(arr, 4 // 2)
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
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
- Recommended textbooks for youDatabase System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSONDatabase System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag…Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education