Scribd Logo
Upload

Welcome to Scribd!

  • 2 views

    Searching, Sorting

    Uploaded by

    Rekha Singh
    The document contains C code implementations of four sorting algorithms: linear search, binary search, selection sort, and insertion sort. It provides the time complexity of each algorithm: linear search and selection sort have O(n) time complexity, binary search has O(log n) time complexity, and selection sort and insertion sort both have O(n^2) time complexity. The code includes functions to implement the sorting logic and swap elements in the arrays.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Searching, Sorting

    Uploaded by

    Rekha Singh
    2 views3 pages
    The document contains C code implementations of four sorting algorithms: linear search, binary search, selection sort, and insertion sort. It provides the time complexity of each algorithm: linear search and selection sort have O(n) time complexity, binary search has O(log n) time complexity, and selection sort and insertion sort both have O(n^2) time complexity. The code includes functions to implement the sorting logic and swap elements in the arrays.

    Original Description:

    c programs

    Original Title

    SEARCHING,SORTING

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document contains C code implementations of four sorting algorithms: linear search, binary search, selection sort, and insertion sort. It provides the time complexity of each algorithm: linear search and selection sort have O(n) time complexity, binary search has O(log n) time complexity, and selection sort and insertion sort both have O(n^2) time complexity. The code includes functions to implement the sorting logic and swap elements in the arrays.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    2 views3 pages

    Searching, Sorting

    Uploaded by

    Rekha Singh
    The document contains C code implementations of four sorting algorithms: linear search, binary search, selection sort, and insertion sort. It provides the time complexity of each algorithm: linear search and selection sort have O(n) time complexity, binary search has O(log n) time complexity, and selection sort and insertion sort both have O(n^2) time complexity. The code includes functions to implement the sorting logic and swap elements in the arrays.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    of 3

    //LINEAR SEARCH //O(n) time complexity.

    // #include<stdio.h>
    // int main(){
    // int arr[10000];
    // int n,key;
    // scanf("%d %d",&n,&key);
    // for(int i=0;i<n;i++){
    // scanf("%d",&arr[i]);
    // }
    // for(int i=0;i<n;i++){
    // if(arr[i]==key){
    // printf("Element found at index %d",i);
    // return 0;
    // }
    // }
    // printf("-1");
    // return 0;
    // }

    //BINARY SEARCH //O(logn) base2 time complexity


    // #include<stdio.h>
    // int binarySearch(int arr[],int n,int key){
    // int s=0;
    // int e=n-1;
    // while(s<=e){
    // int mid=(s+e)/2;
    // if(arr[mid]==key){return mid;}
    // else if(arr[mid]>key){e=mid-1;}
    // else{s=mid+1;}
    // }
    // return -1;
    // }
    // int main(){
    // int arr[100000];
    // int n;
    // scanf("%d",&n);
    // for(int i=0;i<n;i++){
    // scanf("%d",&arr[i]);
    // }
    // int key;
    // scanf("%d",&key);
    // printf("%d",binarySearch(arr,n,key));
    // return 0;
    // }

    //SELECTION SORT //O(n^2) time complexity.


    // #include<stdio.h>
    // #include<limits.h>
    // #include<stdlib.h>
    // #include<math.h>
    // void selectionSort(int arr[],int n);
    // void swap(int arr[],int i,int j);
    // int main(){
    // int n;
    // scanf("%d",&n);
    // int arr[1000];
    // for(int i=0;i<n;i++){
    // scanf("%d",&arr[i]);
    // }
    // selectionSort(arr,n);
    // for(int i=0;i<n;i++){
    // printf("%d ",arr[i]);
    // }
    // return 0;
    // }
    // void selectionSort(int arr[],int n){
    // for(int i=0;i<n-1;i++){
    // int smallest=i;
    // for(int j=i+1;j<n;j++){
    // if(arr[j]<arr[smallest]){
    // smallest=j;
    // }
    // }
    // swap(arr,i,smallest);
    // }
    // }
    // void swap(int arr[],int i,int j){
    // int temp=arr[i];
    // arr[i]=arr[j];
    // arr[j]=temp;
    // }

    //INSERTION SORT //O(n^2) time complexity.


    // #include<stdio.h>
    // void swap(int arr[],int i,int j);
    // int main(){
    // int arr[10000];
    // int n;
    // scanf("%d",&n);
    // for(int i=0;i<n;i++){
    // scanf("%d",&arr[i]);
    // }
    // for(int i=1;i<=n-1;i++){
    // if(arr[i]>=arr[i-1]){}
    // else{
    // for(int j=0;j<=i-1;j++){
    // if(arr[i]<=arr[0]){
    // swap(arr,i,0);
    // }
    // if(arr[j]<=arr[i] && arr[i]<=arr[j+1]){
    // swap(arr,i,j+1);
    // }
    // }
    // }
    // }
    // for(int i=0;i<n;i++){
    // printf("%d ",arr[i]);
    // }
    // return 0;
    // }
    // void swap(int arr[],int i,int j){
    // int temp=arr[i];
    // arr[i]=arr[j];
    // arr[j]=temp;
    // }

    You might also like