PR6

 Write a Python program to store first year percentage of students in array. Write function for

sorting array of floating point numbers in ascending order using Quick Sort.

OBJECTIVES:

1. To understand concept of Quick Sort.

2. To study the Quick Sort technique.

3. To study the application Quick Sort method.


# Quick Sort function without using any built-in methods or classes

def quick_sort(arr, low, high):

    if low < high:

        # Partitioning index

        pi = partition(arr, low, high)

        

        # Recursively sort elements before and after partition

        quick_sort(arr, low, pi - 1)

        quick_sort(arr, pi + 1, high)


# Function to partition the array for Quick Sort

def partition(arr, low, high):

    pivot = arr[high]  # Taking the last element as the pivot

    i = low - 1  # Index of smaller element


    # Traverse through the array and rearrange elements

    for j in range(low, high):

        if arr[j] < pivot:

            i += 1

            # Swap arr[i] and arr[j]

            temp = arr[i]

            arr[i] = arr[j]

            arr[j] = temp


    # Swap arr[i + 1] and arr[high] (pivot element)

    temp = arr[i + 1]

    arr[i + 1] = arr[high]

    arr[high] = temp

    

    return i + 1


# Main program to take user input, sort using quick sort and display top 5 scores

n = int(input("Enter the number of students: "))  # Number of students


percentages = []

print("Enter the percentages of students:")

for i in range(n):

    percentage = float(input(f"Percentage of student {i + 1}: "))

    percentages.append(percentage)


# Display the original list

print("\nOriginal percentages:")

for percentage in percentages:

    print(percentage, end=" ")


# Quick Sort the array

quick_sort(percentages, 0, n - 1)


# Display top 5 scores after sorting in ascending order

print("\n\nTop 5 scores after Quick Sort (ascending order):")

for i in range(min(5, n)):

    print(percentages[-(i + 1)], end=" ")


Comments

Post a Comment

Popular posts from this blog

Pr13

 Pizza parlor accepting maximum M orders. Orders are served in first come first served basis. Order once placed cannot be cancelled. Write C++ program to simulate the system using circular queue using array. Objectives:- 1. To understand concept of circular queue. #include <iostream> #include <string> using namespace std; class PizzaParlor { private:     string* orders;    // Array to store pizza orders     int front;         // Front pointer (for serving orders)     int rear;          // Rear pointer (for placing orders)     int capacity;      // Maximum capacity (M orders)     int size;          // Current number of orders public:     // Constructor to initialize the queue with a given capacity     PizzaParlor(int M) {         capacity = M;         orders = new ...
Read more

pr7

 Department of Computer Engineering has student's club named 'Pinnacle Club'. Students of Second, third and final year of department can be granted membership on request. Similarly one may cancel the membership of club. First node is reserved for president of club and last node is reserved for secretary of club. Write C++ program to maintain club member‘s information using singly linked list. Store student PRN and Name. Write functions to a) Add and delete the members as well as president or even secretary. b) Compute total number of members of club c) Display members d) Display list in reverse order using recursion e) Two linked lists exists for two divisions. Concatenate two lists #include <iostream> #include <string> using namespace std; // Define a structure for a student node struct Student {     string prn;     string name;     Student* next; }; // Define a class for managing the club's members class PinnacleClub { private:   ...
Read more