#include #include int main() { } int size = 0, randNum = 0, larger, smaller; int *randArr; printf("Input scanf_s("%d", randArr = (int *) malloc(size sizeof(int)); for (int i = 0; i < size; i++) { randNum = rand() % 38 - 19; randArr[i] = randNum; } for the size of an array: "); &size); (int j = 0; j < size - 1; j++) { for (int k = 0; k < size - j - 1; k++){ if (randArr[k] < randArr[k + 1]){ continue; } } else if (randArr [k]> randArr[k + 1]) { larger = randArr[k + 1]; smaller randArr[k]; return 0; randArr[k] = larger; randArr[k + 1] = smaller; } else if (randArr[k] == randArr[k + 1]) { continue; } } for (int 1 = 0; 1< size; 1++) { } printf("Array value: %d\n", randArr[1]);

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

C LANGUAGE ONLY. ANSWER ASAP

Topic: pointers and dynamic memory allocation

Make another version of the code below without copying it or using the same structure

Thanks!

#include <stdio.h>
#include <stdlib.h>
int main() {
}
int size= 0, randNum = 0, larger, smaller;
int *randArr;
printf("Input the size of an array: ");
scanf_s("%d", &size);
randArr = (int *) malloc(size sizeof(int));
for (int i = 0; i < size; i++) {
randNum = rand() % 38 - 19;
randArr[i] = randNum;
}
for
(int j = 0; j < size - 1; j++) {
for (int k = 0; k< size - j - 1; k++) {
if (randArr[k] < randArr[k + 1]) {
continue;
}
*
}
else if (randArr[k] > randArr[k + 1]) {
randArr[k + 1];
return 0;
larger
smaller randArr[k];
randArr[k] = larger;
randArr[k + 1] = smaller;
}
else if (randArr[k] ==
continue;
}
}
for (int = 0; l< size; 1++) {
}
randArr[k + 1]) {
printf("Array value: %d\n", randArr[1]);
Transcribed Image Text:#include <stdio.h> #include <stdlib.h> int main() { } int size= 0, randNum = 0, larger, smaller; int *randArr; printf("Input the size of an array: "); scanf_s("%d", &size); randArr = (int *) malloc(size sizeof(int)); for (int i = 0; i < size; i++) { randNum = rand() % 38 - 19; randArr[i] = randNum; } for (int j = 0; j < size - 1; j++) { for (int k = 0; k< size - j - 1; k++) { if (randArr[k] < randArr[k + 1]) { continue; } * } else if (randArr[k] > randArr[k + 1]) { randArr[k + 1]; return 0; larger smaller randArr[k]; randArr[k] = larger; randArr[k + 1] = smaller; } else if (randArr[k] == continue; } } for (int = 0; l< size; 1++) { } randArr[k + 1]) { printf("Array value: %d\n", randArr[1]);
Expert Solution
steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Knowledge Booster
Passing Array as Argument
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