Skip to content

Instantly share code, notes, and snippets.

View SajidK25's full-sized avatar
🏠
Working from home

Sajid Khan SajidK25

🏠
Working from home
View GitHub Profile
@SajidK25
SajidK25 / binarySearch.dart
Last active August 23, 2021 05:51
Binary Search Implementation using Dart programming language
int binarySearch(L,left,right,x){
if(left>right){
return -1;
}
int mid=(left+right)~/2;
if(L[mid]==x){
return mid;
}
if(L[mid]<x){
return binarySearch(L,mid+1,right,x);
@SajidK25
SajidK25 / insertionSort.dart
Last active December 10, 2018 10:56
Insertion sort [ Ascending and descending ] Implementation using Dart programming language
void insertionSort_asc(var L){
int n=L.length;
for(var i=1;i<n;i++){
var item=L[i];
var j=i-1;
while(j>=0 && L[j]>item){
L[j+1]=L[j];
j=j-1;
L[j+1]=item;
}
@SajidK25
SajidK25 / bubble_sort.dart
Created December 10, 2018 20:24
Bubble Sort Implementation using Dart Programming Language
void bubbleSort(var L) {
var n = L.length;
for (var i = 0; i < n; i++) {
for (var j = 0; j < n - i - 1; j++) {
if (L[j] > L[j + 1]) {
var temp = L[j];
L[j] = L[j + 1];
L[j + 1] = temp;
}
}
@SajidK25
SajidK25 / selectionSort.dart
Created December 11, 2018 10:36
Selection Sort Implementation using Dart Programming Language
void selectionSort(var L) {
var n = L.length;
for (var i = 0; i < n - 1; i++) {
var index_min = i;
for (var j = i + 1; j < n; j++) {
if (L[j] < L[index_min]) {
index_min = j;
}
}
if (index_min != i) {
@SajidK25
SajidK25 / Stack.dart
Last active December 12, 2018 20:47
Simple Stack [LIFO] behaviour Implementation using Dart Programming Language
class Stack {
List items;
Stack(this.items);
@override
String toString() => 'List :$items';
void push(int item) {
this.items.add(item);
}
@SajidK25
SajidK25 / heap.dart
Created December 13, 2018 12:14
Heap, Build a Max-heap and Convert Binary tree into a Heap using Dart programming Language
int left(int i) {
return 2 * i;
}
int right(int i) {
return 2 * i - 1;
}
int parant(int i) {
return i;
def addition_function
puts "Which numbers would you like to add?"
@n1 = gets.chomp
@n2 = gets.chomp
@answer = @n1 + @n2
# @n1 + @n2 == @answer
puts "The sum is... #{@answer}"
end
def subtraction_function
using System;
using System.Collections.Generic;
namespace DCP_8_Get_the_Numbers
{
class Program
{
static void Main(string[] args)
{
int T=int.Parse(Console.ReadLine());
@SajidK25
SajidK25 / k8s-bookmarks-CKA-CKAD.html
Created September 26, 2021 05:30 — forked from Piotr1215/k8s-bookmarks-CKA-CKAD.html
K8s bookmarks for CKA, CKAD and CKS exams
<!DOCTYPE NETSCAPE-Bookmark-file-1>
<!-- This is an automatically generated file.
It will be read and overwritten.
DO NOT EDIT! -->
<META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=UTF-8">
<TITLE>Bookmarks</TITLE>
<H1>Bookmarks</H1>
<DL><p>
<DT><H3 ADD_DATE="1626629115" LAST_MODIFIED="1626629462" PERSONAL_TOOLBAR_FOLDER="true">Bookmarks bar</H3>
<DL><p>
@SajidK25
SajidK25 / git-pull-all
Created October 25, 2021 18:12 — forked from grimzy/git-pull-all
Git pull all remote branches
#!/usr/bin/env bash
git branch -r | grep -v '\->' | while read remote; do git branch --track "${remote#origin/}" "$remote"; done
git fetch --all
git pull --all