Please Login To Continue
Sorting an Array - Selection Sort
Lesson 11 of 63 • 18 upvotes • 12:45mins
Anjali Luthra
This lesson explains the working of Selection Sort. How the numbers are compared and moved to bring them in increasing order. Complexity of algorithm is O(n^2)
Data Structures and Algorithms: Programming
63 lessons • 10h 36m
1
Introduction to Data Structures and Algorithms
9:09mins
2
Introduction to 1D Arrays
13:28mins
3
Initializing and Traversing an Array
9:09mins
4
Application of an Array
14:45mins
5
Deleting an element from an array
10:52mins
6
Inserting an element in an Array
8:21mins
7
Searching in an array
8:29mins
8
C program for Linear Search
9:39mins
9
Binary Search in Arrays
12:17mins
10
Binary Search Program in C language
7:53mins
11
Sorting an Array - Selection Sort
12:45mins
12
Sorting an Array using BUBBLE Sort
12:04mins
13
Sorting using Shell Sort
7:10mins
14
Sorting an Array using Insertion Sort
12:31mins
15
C program for Selection Sort
6:16mins
16
Merging two arrays
12:20mins
17
Program to merge arrays
7:27mins
18
Two Dimensional Array - Matrices
11:33mins
19
Transpose of a Matrix
9:31mins
20
Adding or subtracting two matrices
7:17mins
21
Multiplication of two matrices
12:05mins
22
C program to multiply two matrices
10:30mins
23
Multidimensional Arrays
8:34mins
24
Introduction to Strings(Array of Characters)
10:39mins
25
Calculate length of a string
9:29mins
26
Processing Strings - Counting vowels
10:36mins
27
Checking if string is a Palindrome or not.
8:29mins
28
Array of Strings or 2D array of characters
9:24mins
29
String.h library functions
10:40mins
30
Pointers in C - Introduction
12:01mins
31
Call by Value Vs Call By Reference/Pointers
13:37mins
32
Examples of Call By Reference
8:40mins
33
Arrays and Pointers relationship
9:44mins
34
Passing arrays as arguments to functions
10:32mins
35
Dynamic Memory Allocation
8:48mins
36
Introduction to stacks and its applications
8:49mins
37
Implementing Stack using arrays in C language
13:06mins
38
Checking Parenthesis in Arithmetic expressions using Stack
12:22mins
39
Infix to postfix conversion or reverse polish notation
14:07mins
40
Infix to Postfix conversion containing Parenthesis
9:36mins
41
Evaluation of Postfix expression using Stack
9:20mins
42
Introduction to Queue and its Application
13:20mins
43
Implementation of Queue using Arrays : Linear Queue
12:50mins
44
Implementation of Queue using Circular Array
11:44mins
45
Introduction to Linked List and Dynamic Memory Allocation
10:21mins
46
Inserting a node at the end of linked list.
12:23mins
47
Traversing a Linked List
8:28mins
48
Adding a Node at the Beginning of a linked list.
7:46mins
49
Inserting Node at a given position in linked list
10:04mins
50
Deleting a Node from Beginning of a Linked List
8:03mins
51
Deleting a Node from End of a Linked List
7:16mins
52
Deletion from a given position in the Linked List
9:05mins
53
Searching a Value in a Single Linked List
7:43mins
54
Sorting a Linked List
7:55mins
55
Merging two linked lists
11:00mins
56
Implementing Stacks using Linked List
8:05mins
57
Implementing Queue using Linked List
9:06mins
58
Circular Linked List
10:24mins
59
Insertion into a Circular Linked List
11:51mins
60
Deletion from a Circular Linked List
9:09mins
61
Introduction to Double Linked List
8:31mins
62
Insertion at End in Double Linked List
8:26mins
63
Insertion at Beginning of a Double Linked List
8:05mins
Crack Programming with Unacademy
Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Daily live classes
Ask doubts
