insta:- https://instagram.com/sachin_dreamboy?igshid=1nrvcyyt8v4z
https://docs.google.com/forms/d/e/1FAIpQLSfWR-vQOKSkNGS3Mrcg9lOJOe_gBRYVarrZ1zkrDnAPL3eryw/viewform?usp=sf_link
Sorting Techniques 1. Selection Sort: Idea: The inner loop selects the minimum element in the unsorted array and places the elements in increasing order. Time complexity: O(N 2 ) #include <iostream> using namespace std; int main() { int n; cin>>n; int arr[n]; for(int i=0;i<n;i++){ cin>>arr[i]; } for(int i=0;i<n-1;i++){ for(int j=i+1;j<n;j++){ if(arr[j]<arr[i]){ int temp =arr[j]; arr[j]=arr[i]; arr[i]=temp; } } }for(int i=0;i<n;i++){ cout<<arr[i]<<" "; } return 0; } 2. Bubble Sort: Idea: ...
Comments
Post a Comment