Skip to content

Instantly share code, notes, and snippets.

View adwiteeya3's full-sized avatar

Adwiteeya adwiteeya3

View GitHub Profile
# Detailed Missing Values Report
def missing_data_report(df):
total = df.isnull().sum().sort_values(ascending=False)
percent = (df.isnull().sum()/df.isnull().count()*100).sort_values(ascending=False)
missing_df = pd.concat([total, percent], axis=1, keys=['Total Missing', 'Percent Missing (%)'])
return missing_df[missing_df['Total Missing'] > 0]
print("\nMissing Data Report:")
print(missing_data_report(df))
@adwiteeya3
adwiteeya3 / EDA.py
Last active December 9, 2025 14:29
DataScienceSeries : EDA
#####################################################
# Setting the Stage: Our Dataset
#####################################################
import pandas as pd
import numpy as np
import seaborn as sns
import matplotlib.pyplot as plt
import plotly.express as px
import plotly.graph_objects as go
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
@adwiteeya3
adwiteeya3 / Quick Sort.c
Created October 24, 2020 09:03
C program for Quick sort
/* C implementation QuickSort */
#include <stdio.h>
// A utility function to swap two elements
void swap(int *a, int *b)
{
int t = *a;
*a = *b;
*b = t;
}
@adwiteeya3
adwiteeya3 / Merge Sort.c
Created October 22, 2020 18:32
C program for Merge Sort
/* C program for Merge Sort */
#include <stdio.h>
#include <stdlib.h>
// Merges two subarrays of arr[].
// First subarray is arr[l..m]
// Second subarray is arr[m+1..r]
void merge(int arr[], int l, int m, int r)
{
int i, j, k;
@adwiteeya3
adwiteeya3 / Bubble Sort.c
Last active April 26, 2022 10:43
C program for Bubble Sort
// C program for implementation of Bubble sort
#include <stdio.h>
void swap(int *xp, int *yp)
{
int temp = *xp;
*xp = *yp;
*yp = temp;
}
@adwiteeya3
adwiteeya3 / Selection sort.c
Created October 21, 2020 11:02
C program for selection sort
// C program for implementation of selection sort
#include <stdio.h>
void swap(int *xp, int *yp)
{
int temp = *xp;
*xp = *yp;
*yp = temp;
}
@adwiteeya3
adwiteeya3 / Insertion Sort.c
Last active July 13, 2023 07:46
C program for insertion sort
// C program for insertion sort
#include <math.h>
#include <stdio.h>
/* Function to sort an array using insertion sort*/
void insertionSort(int arr[], int n)
{
int i, key, j;
for (i = 1; i < n; i++)
{