Write a selection sort program in C. How selection sort algorithm works and what’s their time complexity.
What is Selection Sort
Selection sort is an in-place comparison sort. Like bubble sort time complexity of Selection sort is also O(n^2). It is not suitable for large elements.
Bubble Sort program, Algorithm & their time complexity.In this tutorial, We are going to learn about bubble sort algorithm and their implementation in various programming languages.
In this tutorial, we are going to cover following things
- What is Bubble Sort?
- Bubble sort algorithm & it’s time complexity
- Bubble sort program in C & C++
- Java program to implement Bubble sort
- Bubble sort implementation in PHP
What is Bubble Sort?
Bubble sort is a sorting algorithm, It works by comparing each pair of adjacent elements and switching their positions if necessary. It repeats this process until all the elements are sorted.
Write a c program to swap two numbers without using third variable. Given two input numbers, We have to write a code to swap two numbers without using third variable. In my previous post, I have explained a c program to swap two numbers using third variable. This question is generally asked in an interview.
Programming questions on linked list
Swap two numbers using Bitwise XOR Operator
Write a C program to print hello world without using semicolon. It’s an interesting problem as in C every line is terminated with a semicolon. So, how do we write a c program to print hello world without using semicolon.