Coding

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: ...

 OBJECT ORIENTED PROGRAMMING ● Object-Oriented Programming is a methodology or paradigm to design a  program using classes and objects. It simplifies the software development  and maintenance by providing some concepts defined below : ● Class is a user-defined data type which defines its properties and its  functions. Class is the only logical representation of the data. For  example, Human being is a class. The body parts of a human being are its  properties, and the actions performed by the body parts are known as  functions. The class does not occupy any memory space till the time an  object is instantiated. C++ Syntax (for class) : class student{ public: int id; // data member int mobile; string name; int add(int x, int y){ // member functions return x + y; } }; ● Object is a run-time entity. It is an instance of the class. An object can  represent a person, place or any other item. An object can operate on  both data members and ...

 Time and Space complexity                                  Time Complexity Time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the length of the input. Types of notations 1. O-notation: It is used to denote asymptotic upper bound. For a given function g(n), we denote it by O(g(n)). Pronounced as “big-oh of g of n”. It also known as worst case time complexity as it denotes the upper bound in which algorithm terminates. 2. Ω-notation: It is used to denote asymptotic lower bound. For a given function g(n), we denote it by Ω(g(n)). Pronounced as “big-omega of g of n”. It also known as best case time complexity as it denotes the lower bound in which algorithm terminates. 3. !-notation: It is used to denote the average time of a program. Comparison of functions on the basis of time complexity It follows the following order in case of time complexit...

 Coding questions on functions Ques1. Write a program to print all prime numbers between 2 given numbers. #include<iostream> #include<math.h> using namespace std; bool isPrime(int num){ for(int i=2;i<=sqrt(num);i++){ if(num%i==0){ return false; } } return true; } int main(){ int a,b; cin>>a>>b; for(int i=a;i<=b;i++){ if(isPrime(i)){ cout<<i<<endl; } } return 0; } Ques2. Write a program to print Fibonacci sequence. #include<iostream> using namespace std; void fib(int n){ int t1=0; int t2=1; int nextTerm; for(int i=1;i<=n;i++){ cout<<t1<<endl; nextTerm=t1+t2; t1=t2; t2=nextTerm; } return; } int main(){ int n; cin>>n; fib(n); return 0; } Ques3. Write a program to find the factorial of a given number. #include<iostream> using namespace std; int fact(int n){ int factorial=1; for(int i=2;i<=n;i++){ factorial*=i; } return factorial; } int main(){ int n; cin>>n; int ans = fact(n); cout<<ans<<end...

 Functions A function is a block of code that performs a specific task. Why are functions used? 1.If some functionality is performed at multiple places in software, then rather than writing the same code, again and again, we create a function and call it everywhere. This helps reduce code redundancy. 2. Functions make maintenance of code easy as we have to change at one place if we make future changes to the functionality. 3.Functions make the code more readable and easy to understand. The syntax for function declaration is return- type function_name (parameter 1, parameter􀏮 …… parameter n){ //function_body } return-type The return type of a function is the data type of the variable that that function returns. For eg. if we write a function that adds 2 integers and returns their sum then the return type of this function will be ‘int’ as we will returning sum that is an integer value. When a function does not return any value, in that case the return type of the function is ‘void’....

How to check if a number is prime in C++  Prime Numbers Prime numbers are numbers which have only 2 distinct factors i.e 1 and the number itself. Eg. 2,3,5,7,19 etc. Ques1. Write a program to check if a number is prime or not. #include <iostream> #include<cmath> using namespace std; int main() { int n; cin>>n; bool flag=0; for(int i=2;i<=sqrt(n);i++){ if(n%i==0){ cout<<"Non-prime"<<endl; flag=1; break; } } if(flag==0){ cout<<"prime"<<endl; } return 0; } How to generate Armstrong numbers in C++ Armstrong Numbers Armstrong numbers are numbers which have their sum of cube of individual digits equal to the number itself. E.g 153 = 1^3 + 5^3 + 3^3 = 1 + 125 + 27 = 153. #include <iostream> #include<math.h> using namespace std; int main() { int n; cin>>n; int sum=0; int originaln=n; while(n>0){ int lastdigit= n%10; sum+= pow(lastdigit,3); n=n/10; } if(sum==originaln){ cout<<"Armstrong number"...