Part 1 Create a file named problemi.c with a comparison function int compare_int(const void selemi, const void selen2); The comparison function, when used with asort), should sort integers in ascending order with a slight twist: all odd numbers must come before any even number. Part 2 In main, prompt the user to enter an integer representing the size of an array of integers. Allocate memory for the array and have the user enter the values for the array. Once the values are read, use asort) to sort the data using the comparison function you defined in part 1. Print the values of the array before AND after the call to asort in the format shown in the example run. Enter the size of the array: 10 Enter 10 values: 10 2 3 8 5 91476 10 2 3 8 5 9 1476 13579246 8 10

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

Answer the given question with a proper explanation and step-by-step solution.

in c

Part 1
Create a file named problemi.c with a comparison function int compare_int(const void selemi, const void
welen2); The comparison function, when used with asort), should sort integers in ascending order with a slight
twist: all odd numbers must come before any even number.
Part 2
In main, prompt the user to enter an integer representing the size of an array of Integers. Allocate memory for the
array and have the user enter the values for the array. Once the values are read, use asort) to sort the data using
the comparison function you defined in part 1.
Print the values of the array before AND after the call to asort in the format shown in the example run.
Enter the size of the array: 10
Enter 10 values: 10 2 385 91 476
10 2 3 8 5 9 1476
13579 2 4 6 8 10
Transcribed Image Text:Part 1 Create a file named problemi.c with a comparison function int compare_int(const void selemi, const void welen2); The comparison function, when used with asort), should sort integers in ascending order with a slight twist: all odd numbers must come before any even number. Part 2 In main, prompt the user to enter an integer representing the size of an array of Integers. Allocate memory for the array and have the user enter the values for the array. Once the values are read, use asort) to sort the data using the comparison function you defined in part 1. Print the values of the array before AND after the call to asort in the format shown in the example run. Enter the size of the array: 10 Enter 10 values: 10 2 385 91 476 10 2 3 8 5 9 1476 13579 2 4 6 8 10
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
File Input and Output Operations
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
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