Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
What is the running time function in terms of n? What is the big-oh of the running time function?

What is the running time function in terms of n? What is the big-oh of the running time function?

Database System Concepts
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
icon
Related questions
Question

What is the running time function in terms of n?

What is the big-oh of the running time function?

Consider the following algorithm that counts the total number of characters (assume lower case characters) that have a duplicate within a string, excluding spaces. (i.e. "gigi the gato" would result is 9 (g x 3 + i x 2 +tx 2) Start an array of 26 counters. Each character in the alphabet (there are 26) has a position in the array. Position 0 is the counter for a, position 1 is the counter for b, and so forth. 01 FOR each alphabet letter FOR each character on the string 02 03 INCREMENT character count on array of counters 04 ENDFOR 05 ENDFOR 06 FOR each character on the array of counters 07 IF count > 1 THEN 08 DISPLAY character + count 09 ENDIF 10 ENDFOR Assume that (a) the string has n characters and that, and (b) the increment on line 3 is the operation that counts towards the algorithm's running time.
Transcribed Image Text:Consider the following algorithm that counts the total number of characters (assume lower case characters) that have a duplicate within a string, excluding spaces. (i.e. "gigi the gato" would result is 9 (g x 3 + i x 2 +tx 2) Start an array of 26 counters. Each character in the alphabet (there are 26) has a position in the array. Position 0 is the counter for a, position 1 is the counter for b, and so forth. 01 FOR each alphabet letter FOR each character on the string 02 03 INCREMENT character count on array of counters 04 ENDFOR 05 ENDFOR 06 FOR each character on the array of counters 07 IF count > 1 THEN 08 DISPLAY character + count 09 ENDIF 10 ENDFOR Assume that (a) the string has n characters and that, and (b) the increment on line 3 is the operation that counts towards the algorithm's running time.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Computational Systems
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
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS