shivajichalise

#include <iostream>
using namespace std;
#define MAX 10

void insertionSort(int arr[]) {
  int key, j;
  for (int i = 1; i < MAX; i++) {
    key = arr[i];
    j = i - 1;

shivajichalise

#include <iostream>
using namespace std;
#define MAX 10

void bubbleSort(int arr[]) {
  for (int i = 0; i < MAX; i++) {
    for (int j = 0; j < (MAX - i - 1); j++) {
      if (arr[j] > arr[j + 1]) {
        int temp = arr[j];
        arr[j] = arr[j + 1];

shivajichalise

printSpace macro
    mov dl, ' '
    mov ah, 2
    int 21h
endm

disp macro msg
    mov cx, 12h             
    lea di, msg

shivajichalise

#include <iostream>
using namespace std;

class Node {
public:
  int coeff;
  int power;
  Node *next;
};

shivajichalise

ssh/rsync from one Linux machine to another with a standard ethernet cable

Overview

• Install ifplugd and openssh on both machines.
• Optionally install inxi on both machines (recommended).

shivajichalise

#include <iostream>
using namespace std;

class Node {
public:
  int data;
  Node *next;

  Node() {
    data = 0;

shivajichalise

#include <iostream>
using namespace std;

class CircularQueue{
    private:
        int front;
        int rear;
        int arr[5];
        int itemCount;
    public:

shivajichalise

#include <iostream>
using namespace std;

class Complex{
    private:
        int real, imag;
    public:
        Complex(){
            real = 0;
            imag = 0;

shivajichalise

/*CRTP -> Curiously recurring template pattern*/
/*
  CRTP is when a class A has a base class which is a template specialization for the class A itself.
  
  eg:
  template <class T> 
  class X{...};
  class A : public X<A> {...};
  (source: https://stackoverflow.com/questions/4173254/what-is-the-curiously-recurring-template-pattern-crtp)
*/

shivajichalise

/*NOTE: IAM NOT A C++ PRO and THIS CODE CAN BE IMPROVED BY ALOT*/

#include <iostream>
#include <fstream>
#include <iomanip>
#include <string>
#include <cstdio>
#include <stdio.h>
#include <stdlib.h>
using namespace std;