Shivaji Chalise shivajichalise

## insertionsort.cpp
#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;

## bubblesort.cpp
#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];

## pu.asm
printSpace macro
    mov dl, ' '
    mov ah, 2
    int 21h
endm

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

## addTwoPolynomials.cpp
#include <iostream>
using namespace std;

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

## connect-linux-ethernet-lan-ssh.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                shivajichalise
                / connect-linux-ethernet-lan-ssh.md
            
            
              Created
              January 24, 2022 11:36
                — forked from atweiden/connect-linux-ethernet-lan-ssh.md
            
              
                directly connect two linux machines using an ethernet cable
              
          
    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).


## singlyLinkedList.cpp
#include <iostream>
using namespace std;

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

  Node() {
    data = 0;

## circularQueue.cpp
#include <iostream>
using namespace std;

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

## cpp--binary-operator-overloading.cpp
#include <iostream>
using namespace std;

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

## cpp-object-counter-using-CRTP.cpp
/*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)
*/

## cpp-file-handling-and-crud.cpp
/*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;
	#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;
	printSpace macro
	mov dl, ' '
	mov ah, 2
	int 21h
	endm

	disp macro msg
	mov cx, 12h
	lea di, msg
	#include <iostream>
	using namespace std;

	class Node {
	public:
	int coeff;
	int power;
	Node *next;
	};
	#include <iostream>
	using namespace std;

	class CircularQueue{
	private:
	int front;
	int rear;
	int arr[5];
	int itemCount;
	public:
	#include <iostream>
	using namespace std;

	class Complex{
	private:
	int real, imag;
	public:
	Complex(){
	real = 0;
	imag = 0;
	/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)
	*/
	/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;