Sort the following sets of elements using selection sort show the Content of element every pass. 34,56,12, 8,92,9,44,23 Data structure using c++


Sort the following sets of elements using selection sort show the Content of element  every pass.

34,56,12, 8,92,9,44,23


Data structure using c++



To sort the given set of elements using the selection sort algorithm and display the content of the elements at each pass, you can use the following C++ code:


cpp

Copy code

#include <iostream>

#include <vector>


using namespace std;


void selectionSort(vector<int>& arr) {

    int n = arr.size();


    for (int i = 0; i < n - 1; i++) {

        int minIndex = i;


        for (int j = i + 1; j < n; j++) {

            if (arr[j] < arr[minIndex]) {

                minIndex = j;

            }

        }


        // Swap the minimum element with the current element

        swap(arr[i], arr[minIndex]);


        // Display the content of the elements at each pass

        cout << "Pass " << i + 1 << ": ";

        for (int k = 0; k < n; k++) {

            cout << arr[k] << " ";

        }

        cout << endl;

    }

}


int main() {

    vector<int> elements = {34, 56, 12, 8, 92, 9, 44, 23};


    cout << "Original elements: ";

    for (int element : elements) {

        cout << element << " ";

    }

    cout << endl << endl;


    selectionSort(elements);


    cout << endl << "Sorted elements: ";

    for (int element : elements) {

        cout << element << " ";

    }

    cout << endl;


    return 0;

}

When you run this code, it will output the content of the elements at each pass of the selection sort algorithm:


yaml

Copy code

Original elements: 34 56 12 8 92 9 44 23


Pass 1: 8 56 12 34 92 9 44 23

Pass 2: 8 9 12 34 92 56 44 23

Pass 3: 8 9 12 34 92 56 44 23

Pass 4: 8 9 12 23 92 56 44 34

Pass 5: 8 9 12 23 34 56 44 92

Pass 6: 8 9 12 23 34 44 56 92

Pass 7: 8 9 12 23 34 44 56 92


Sorted elements: 8 9 12 23 34 44 56 92

As shown, the content of the elements is displayed at each pass of the selection sort algorithm, and the sorted elements are shown at the end.







Comments

Post a Comment

Popular posts from this blog

Load a Pandas dataframe with a selected dataset. Identify and count the missing values in a dataframe. Clean the data after removing noise as follows: a. Drop duplicate rows. b. Detect the outliers and remove the rows having outliers c. Identify the most correlated positively correlated attributes and negatively correlated attributes

  Load a Pandas dataframe with a selected dataset. Identify and count the missing values in a dataframe. Clean the data after removing noise as follows: a. Drop duplicate rows. b. Detect the outliers and remove the rows having outliers c. Identify the most correlated positively correlated attributes and negatively correlated attributes CODE import pandas as pd # Load the dataset df = pd.read_csv('your_dataset.csv') # Identify and count missing values missing_values = df.isnull().sum() print("Missing values:") print(missing_values) # Drop duplicate rows df = df.drop_duplicates() # Detect outliers and remove rows with outliers def remove_outliers(df, column):     Q1 = df[column].quantile(0.25)     Q3 = df[column].quantile(0.75)     IQR = Q3 - Q1     lower_bound = Q1 - 1.5 * IQR     upper_bound = Q3 + 1.5 * IQR     return df[(df[column] >= lower_bound) & (df[column] <= upper_bound)] columns_to_check = ['column1', 'c...
Read more

what is KDD? Explain about data mining as a step in the process of knowledge discovery

 KDD stands for Knowledge Discovery in Databases, and it represents the overall process of discovering useful knowledge from large volumes of data. Data mining is a crucial step within the KDD process. Let's break down the stages of the KDD process, highlighting the role of data mining: Data Selection: This initial step involves selecting and retrieving relevant data from various sources. The data may come from databases, data warehouses, or other repositories. The goal is to gather the necessary information for analysis. Data Preprocessing: Once the data is collected, it often needs to be cleaned and preprocessed to handle missing values, outliers, and irrelevant information. This step ensures that the data is in a suitable format for analysis. Data Transformation: Data transformation involves converting the data into a suitable format for mining. This may include normalization, aggregation, or other transformations to make the data more suitable for the chosen data mining algorit...
Read more

The weights of 8 boys in kilograms: 45, 39, 53, 45, 43, 48, 50, 45. Find the median

  The weights of 8 boys in kilograms: 45, 39, 53, 45, 43, 48, 50, 45. Find the median To find the median, we need to arrange the weights in ascending order. Here are the weights of the 8 boys in kilograms: 39, 43, 45, 45, 45, 48, 50, 53 To find the median, we look for the middle value. Since there are 8 weights, the median is the average of the two middle values. In this case, the two middle values are 45 and 45. Therefore, the median weight is: (45 + 45) / 2 = 90 / 2 = 45 So, the median weight of the 8 boys is 45 kilograms. OR Here's how you can find the median of the given weights using Python: CODE:- weights = [45, 39, 53, 45, 43, 48, 50, 45] sorted_weights = sorted(weights) length = len(sorted_weights) if length % 2 == 0:     median = (sorted_weights[length // 2 - 1] + sorted_weights[length // 2]) / 2 else:     median = sorted_weights[length // 2] print("The median weight is:", median) When you run this code, it will output: The median weight is: 45.0 So, th...
Read more