Given a string representing an array of strings, you will need to sort the given array with the following rules: • Strings should first be sorted based on their rate of occurrence, i.e. strings that are more frequent should appear earlier in the list • If two strings are tied in their occurrence, then they should be sorted by their alphabetical order Each string will be contained by single-quotations which are not part of the word. Additionally, all words will be lower-case. Spelling does NOT matter, nor do the words have to be "valid" or real words. Input will be given exactly as it appears, including brackets, quotations, spaces, and commas, all on a single line of input
Given a string representing an array of strings, you will need to sort the given array with the following rules: • Strings should first be sorted based on their rate of occurrence, i.e. strings that are more frequent should appear earlier in the list • If two strings are tied in their occurrence, then they should be sorted by their alphabetical order Each string will be contained by single-quotations which are not part of the word. Additionally, all words will be lower-case. Spelling does NOT matter, nor do the words have to be "valid" or real words. Input will be given exactly as it appears, including brackets, quotations, spaces, and commas, all on a single line of input
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
Given a string representing an array of strings, you will need to sort the given array with
the following rules:
• Strings should first be sorted based on their rate of occurrence, i.e. strings that are more frequent should appear earlier in the list
• If two strings are tied in their occurrence, then they should be sorted by their alphabetical order
Each string will be contained by single-quotations which are not part of the word. Additionally, all words will be lower-case. Spelling does NOT matter, nor do the words have to be "valid" or real words. Input will be given exactly as it appears, including brackets, quotations, spaces, and commas, all on a single line of input (I have spread them over many lines to aid reading, they are all on one line). Your output should consist of the words in their proper order followed by their frequency, as below. Feel free to use any methods we have learned in class to answer this, along with the vector or list STL and string data type.
Case 1: Input 1: ['bin', 'can', 'box', 'box', 'can']
Output1: ['box 2','can 2','bin 1']
Case 2: Input 2: ['case', 'cave', 'rave', 'cave', 'base', 'base', 'rave', 'case', 'case', 'hair', 'search', 'birch', 'birch', 'single']
Output 2: ['case 3', ' base 2', 'birch 2', 'cave 2', 'rave 2', 'hair 1', 'search 1', 'single 1']
Case 3: Input 3: ['a', 'aa', 'a', 'aa', 'compare', 'compar', 'copay', 'compar', 'compare', 'b', 'b', 'morewords', 'morewords', 'morewords', 'somewords', 'supercalifragilisticexpialidocious', 'honorificabilitudinitatibus',
'honorificabilitudinitatibus', 'compare', 'compar', 'a', 'aa', 'base', 'base',
'bear', 'bear']
Output 3: ['a 3', 'aa 3', 'compar 3', 'compare 3', 'morewords 3', 'b 2', 'base 2',
'bear 2', ' honorificabilitudinitatibus 2', 'copay 1', 'somewords 1',
'supercalifragilisticexpialidocious 1']
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 3 steps with 4 images
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.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