Scribd Logo
Upload

Welcome to Scribd!

  • 18 views

    Bubble Sort

    Uploaded by

    PIRADEEP R
    This document contains code snippets for three different sorting algorithms: bubble sort, selection sort, and selection sort. The bubble sort code iterates through an array and swaps adjacent elements that are out of order. The selection sort code finds the minimum element in the unsorted portion of the array and swaps it into place. The second selection sort code functions similarly but stores the index of the minimum element rather than swapping immediately.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Bubble Sort

    Uploaded by

    PIRADEEP R
    18 views5 pages
    This document contains code snippets for three different sorting algorithms: bubble sort, selection sort, and selection sort. The bubble sort code iterates through an array and swaps adjacent elements that are out of order. The selection sort code finds the minimum element in the unsorted portion of the array and swaps it into place. The second selection sort code functions similarly but stores the index of the minimum element rather than swapping immediately.

    Original Title

    BUBBLE_SORT

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains code snippets for three different sorting algorithms: bubble sort, selection sort, and selection sort. The bubble sort code iterates through an array and swaps adjacent elements that are out of order. The selection sort code finds the minimum element in the unsorted portion of the array and swaps it into place. The second selection sort code functions similarly but stores the index of the minimum element rather than swapping immediately.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    18 views5 pages

    Bubble Sort

    Uploaded by

    PIRADEEP R
    This document contains code snippets for three different sorting algorithms: bubble sort, selection sort, and selection sort. The bubble sort code iterates through an array and swaps adjacent elements that are out of order. The selection sort code finds the minimum element in the unsorted portion of the array and swaps it into place. The second selection sort code functions similarly but stores the index of the minimum element rather than swapping immediately.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 5

    BUBBLE SORTING

    #include<stdio.h>

    #include<conio.h>

    void main()

    int array[100], n, i, j, swap;

    printf("Enter number of elementsn");

    scanf("%d", &n);

    printf("Enter %d Numbers:n", n);

    for(i = 0; i < n; i++)

    scanf("%d", &array[i]);

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

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

    if(array[j] > array[j+1])

    swap=array[j];

    array[j]=array[j+1];

    array[j+1]=swap;

    }
    }

    printf("Sorted Array:n");

    for(i = 0; i < n; i++)

    printf("%dn", array[i]);

    getch();

    SELECTION SORTING
    #include<stdio.h>
    #include<conio.h>

    void main(){

    int size,i,j,temp,list[100];
    clrscr();

    printf("Enter the size of the List: ");


    scanf("%d",&size);

    printf("Enter %d integer values: ",size);


    for(i=0; i<size; i++)
    scanf("%d",&list[i]);

    //Selection sort logic

    for(i=0; i<size; i++){


    for(j=i+1; j<size; j++){
    if(list[i] > list[j])
    {
    temp=list[i];
    list[i]=list[j];
    list[j]=temp;
    }
    }
    }

    printf("List after sorting is: ");


    for(i=0; i<size; i++)
    printf(" %d",list[i]);

    getch();
    }
    SELECTION SORT

    include <stdio.h>

    include<conio.h>

    int main()

    int a[100], n, i, j, position, swap;

    printf("Enter number of elementsn");

    scanf("%d", &n);

    printf("Enter %d Numbersn", n);

    for (i = 0; i < n; i++)

    scanf("%d", &a[i]);
    for(i = 0; i < n - 1; i++)

    position=i;

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

    if(a[position] > a[j])

    position=j;

    if(position != i)

    swap=a[i];

    a[i]=a[position];

    a[position=swap;

    printf("Sorted Array:n");

    for(i = 0; i < n; i++)

    printf("%dn", a[i]);

    return 0;

    You might also like