M. Saqib

Selection Sort Video – Algorithm Explanation

Selection Sort Algorithm

Selection sort is an in-place comparison-based algorithm in which the list is divided into two parts, the sorted part at the left end and the unsorted part at the right end. Initially, the sorted part is empty and the unsorted part is the entire list.

See also: Shell Sort, Quick Sort, Bubble Sort, Insertion Sort

YouTube Video: https://youtu.be/MmmS0PC4hTs

Categories: Videos
Tags: SortingVideos
M. Saqib: Saqib is Master-level Senior Software Engineer with over 14 years of experience in designing and developing large-scale software and web applications. He has more than eight years experience of leading software development teams. Saqib provides consultancy to develop software systems and web services for Fortune 500 companies. He has hands-on experience in C/C++ Java, JavaScript, PHP and .NET Technologies. Saqib owns and write contents on mycplus.com since 2004.
Related Post
  1. Mastering Data Structures: An Essential Skillset for Programming Students

    Data structures are fundamental concepts for any software application and programming in general. It is an incredibly valuable skill set to serve you in your…

  2. Breaking Down Complex Algorithms: A Beginner’s Guide for Students

    Algorithmic logic is crucial for computer science. It might sound complex for a beginner, but it is manageable upon further inspection. It is based on…

  3. What is Screencasting and Why Use It?

    The modern market offers a rich array of programs to edit video and audio and capture the screen activity. Some of them are open-source, while…

  4. Quicksort Video – Algorithm Explanation

    Quicksort is an efficient sorting algorithm based on Divide and Conquer rule. It works by selecting a 'pivot' element from the array and partitioning the…

  5. Quicksort Implementation in C

    Quicksort is a widely used sorting algorithm known for its efficiency and simplicity. Developed by Tony Hoare in 1960, this sorting technique follows the "divide…