C++ Confusion Buster: Your Easy Guide to C++ !
Selection Sort Algorithm code [C++] :
// Shyam Sunder Kanth// Insta : still_23.6_8//? Selection Sort#include<iostream>using namespace std;int main(){int arr[5] = {55,12,35,47,99};int len = sizeof(arr)/ sizeof(arr[0]);for(int a = 0;a<len;a++){for(int b = a+1;b<len;b++){if(arr[b]<arr[a]){swap(arr[a],arr[b]);}}}for(int i=0;i<len;i++){cout<<arr[i]<<" ";}return 0;}
Hey, thanks for watching our video about Selection Sort Algorithm ! In this video we’ll walk you through:
- Concept
- How It works ?
- Implementation
- Code
All codes are available at my GitHub account, check them out here:
https://github.com/shyamkanth/Placements
Check out other videos from DS Revealed playlist: https://www.youtube.com/playlist?list=PLNXqJgOsTCZOB60T9HDhMf_o8RXbNWgqS
Check out our channel here: https://www.youtube.com/@DevelopersByte
Find us at: https://shyamkanth.github.io/
Timestamps:
0:00 Intro
01:21 Concept
04:08 How it works
05:50 Implementation
15:44 Code
18:36 Outro
About our channel:
Our channel is about Revealing the secrets of Data Structure. We cover lots of cool stuff such as Codes, Concepts and Implementations.
Check out our channel here: https://www.youtube.com/@DevelopersByte
Don’t forget to subscribe!
Follow me on social media:
Get updates or reach out to Get updates on our Social Media Profiles!
GitHub: https://github.com/shyamkanth/
Instagram: https://instagram.com/still_23.6_8
Instagram personal: https://instagram.com/itz_sammmii
No comments:
Post a Comment