Suppose you are given a task to rank the students. You have gotten the marks and id of the students. Now your task is to rank the students based on their marks using only insertion sort. Here is the pseudocode for insertion sort for ascending order. You need to change it to descending order. for i+0 to n – 1 temp + A[i + 1] j = i while j >= 0 if(A[j] > temp) A[j + 1] +A[j] else break j = j - 1 end for A[j + 1] + temp end for Implement this pseudocode to complete your task. First line will contain an integer N. The next line will contain N number of id of the students. The next line will contain the N number of the marks of corresponding students. Output will be ranking the id based on their marks (descending order). Input 1: Input 2: 1234 56 50 60 80 20 10 30 11 45 34 22 12 | 40 50 20 10 10 Output 1: 45 11 34 22 12 Output 2: 321645

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
Use python. Provide unique solution.
Suppose you are given a task to rank the students. You have gotten the marks and id of
the students. Now your task is to rank the students based on their marks using only
insertion sort.
Here is the pseudocode for insertion sort for ascending order. You need to change it to
descending order.
for i+0 to n – 1
temp – A[i + 1]
j = i
while j >= 0
if(A[j] > temp)
A[j + 1] +A[j]
else
break
j = j – 1
end for
A[j + 1] + temp
end for
Implement this pseudocode to complete your task.
First line will contain an integer N. The next line will contain N number of id of the
students. The next line will contain the N number of the marks of corresponding
students. Output will be ranking the id based on their marks (descending order).
Input 1:
Input 2:
6
1234 56
11 45 34 22 12
40 50 20 10 10
50 60 80 20 10 30
Output 1:
45 11 34 22 12
Output 2:
32164 5
Transcribed Image Text:Suppose you are given a task to rank the students. You have gotten the marks and id of the students. Now your task is to rank the students based on their marks using only insertion sort. Here is the pseudocode for insertion sort for ascending order. You need to change it to descending order. for i+0 to n – 1 temp – A[i + 1] j = i while j >= 0 if(A[j] > temp) A[j + 1] +A[j] else break j = j – 1 end for A[j + 1] + temp end for Implement this pseudocode to complete your task. First line will contain an integer N. The next line will contain N number of id of the students. The next line will contain the N number of the marks of corresponding students. Output will be ranking the id based on their marks (descending order). Input 1: Input 2: 6 1234 56 11 45 34 22 12 40 50 20 10 10 50 60 80 20 10 30 Output 1: 45 11 34 22 12 Output 2: 32164 5
Expert Solution
steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Knowledge Booster
Mergesort
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