Skip to content

Instantly share code, notes, and snippets.

View FireLord's full-sized avatar
🦾
Building Apps

Aman Kumar FireLord

🦾
Building Apps
View GitHub Profile
import SwiftUI
import AVKit
import UIKit
import CoreMedia
import AVFoundation
// MARK: - Notification & Helper Structs
extension Notification.Name {
static let startVideoExport = Notification.Name("startVideoExportNotification")
}
@FireLord
FireLord / .zshrc
Last active November 28, 2024 06:07
MacOS .zshrc
# If you come from bash you might have to change your $PATH.
# export PATH=$HOME/bin:$HOME/.local/bin:/usr/local/bin:$PATH
# Path to your Oh My Zsh installation.
export ZSH="$HOME/.oh-my-zsh"
# Set name of the theme to load --- if set to "random", it will
# load a random theme each time Oh My Zsh is loaded, in which case,
# to know which specific one was loaded, run: echo $RANDOM_THEME
# See https://github.com/ohmyzsh/ohmyzsh/wiki/Themes
#include <stdio.h>
#include <stdlib.h>
void bubble_sort(int a[], int n)
{
int temp, pass, i;
for (pass = 1; pass < n; pass++)
{
for (i = 0; i < n - pass; i++)
{
#include <stdio.h>
#include <stdlib.h>
int partioning(int A[],int LB,int UB)
{
int down,up,temp,pivot,i;
pivot=A[LB];
down=LB;
up=UB+1;
while(down<up)
#include <stdio.h>
#include <stdlib.h>
// Aman 35
typedef struct list
{
int info;
struct list *next;
} node;
#include <stdio.h>
int N;
int Linear_Search(int A[], int N, int value)
{
int i, flag = 1;
for (i = 0; i < N; i++)
{
if (A[i] == value)
#include <stdio.h>
#include <stdlib.h>
#define MAX 100
typedef struct stk
{
int TOP;
int A[MAX];
} stack;
@FireLord
FireLord / stack.c
Last active October 26, 2021 07:22
#include <stdio.h>
#include <stdlib.h>
#define MAX 5
typedef struct stk
{
int TOP;
int A[MAX];
}stack;
#include <stdio.h>
int a[4] = {0, 0, 1, 1};
int b[4] = {0, 1, 0, 1};
int c[4], d[4], e[4], f[4];
int i, j, k, n = 4;
int main()
{
printf("Table A: ");
#include <stdio.h>
int main()
{
int a[20], b[20], c[20];
int i, j, k = 0, m, n;
// first array
printf("Enter size of first array: ");
scanf("%d", &n);