sudhanshuptl

7c54feb6bab5404ba3ab660a3fd04e77c1212b055d8e1cbf34a42049aa82c47a9ee0577f3575c1c7a25c235e0982677c2801f2f253372d16f9ae60804a20ffc8

sudhanshuptl

#include<stdio.h>
#define SIZE 10

void print(int arr[]);
void mergeSort(int arr[],int base,int end);
void merge(int arr[],int base,int mid, int end);

int main(){
    int arr[SIZE]={5,32,7,2,8,7,9,6,43,65};
    print(arr);

sudhanshuptl

# Bubble sort in python
__author__ ='Sudhashu Patel'

class BubbleSort:
    def __init__(self, ls=[5,3,6,2,4,7,4,3]):
        self.ls = ls
        self.length = len(self.ls)

    def sort(self, reverse=False):
        if reverse:

sudhanshuptl

sudhanshu|patel||1234
Chandan|kumar|54645
Ashutosh|Dwivedi|34654

sudhanshuptl

#include<stdio.h>
#include<string.h>
#include<stdlib.h>

/*Global Variabls*/
char *GlobalPointer=NULL;

/* Prototypes */
char *ParseLine(char *arr, char *delimiter);

sudhanshuptl

#include<stdio.h>
#include<string.h>

int main(){
    FILE *fp; //file pointer
    char line[30];
    char *token;

    //open file

sudhanshuptl

/* Sudhanshu Patel [email protected] */
/*
Min Heap implementation in c
*/
#include<stdio.h>
#include<stdlib.h>
/*
 Array Implementation of MinHeap data Structure
*/

sudhanshuptl

__author__ == 'Sudhanshu Patel'
'''
1. Height should be h or h-1
2. max heap : parent node have hire value than all of its children

'''

class Heap_Array(object):
    # Array Implementation of max Heap
    # parent of a node is (i-1)/2 and child of a node is 2*i+1 and 2*i+2

sudhanshuptl

/* Sudhanshu Patel [email protected] */
#include<stdio.h>
#include<stdlib.h>


struct Node{
    int data;
    struct Node *next;
};
typedef struct Node Node;

sudhanshuptl

from abc import ABC, ABCMeta, abstractclassmethod

'''
Abstract classes are classes that contain one or more abstract methods. An abstract method is a method that is declared,
 but contains no implementation. Abstract classes may not be instantiated, and require subclasses to provide 
 implementations for the abstract methods.
'''