Skip to content

Instantly share code, notes, and snippets.

View pavinduLakshan's full-sized avatar
🎯
Focusing

Pavindu Lakshan pavinduLakshan

🎯
Focusing
63 followers · 17 following
View GitHub Profile
@pavinduLakshan
pavinduLakshan / PaymentModal.js
Last active October 24, 2020 01:28
import React from 'react';
import './payment_modal.css'
const PaymentModal = ({ orderId, name, amount }) => {
// Put the payment variables here
var payment = {
sandbox: true, // if the account is sandbox or real
merchant_id: '121XXXX', // Replace your Merchant ID
return_url: 'http://sample.com/return',
@pavinduLakshan
pavinduLakshan / index.html
Created May 7, 2020 00:31
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="utf-8" />
<link rel="icon" href="%PUBLIC_URL%/favicon.ico" />
<meta name="viewport" content="width=device-width, initial-scale=1" />
<meta name="theme-color" content="#000000" />
<meta
name="description"
content="Web site created using create-react-app"
@pavinduLakshan
pavinduLakshan / Stack.java
Created May 4, 2020 14:08
Class Stack {
private int arr[];
private int top;
private int size; // maximum no. of elements allowed in the stack
//Constructor
Stack (int size){
arr = new int[size]
size = size;
top = -1;
@pavinduLakshan
pavinduLakshan / pop_stack.java
Last active May 4, 2020 14:00
public int pop (){
if ( isEmpty() ){
System.out.println("No values to pop");
System.exit(1);
}
return arr[top--];
}
@pavinduLakshan
pavinduLakshan / push_stack.java
Last active May 4, 2020 13:58
public void push (int x) {
if ( isFull() ){
System.out.println("Stack is full.");
return;
}
System.out.println("Inserting "+x);
arr[++top] = x;
@pavinduLakshan
pavinduLakshan / stack_utilities.java
Created May 4, 2020 13:16
public int currentSize{
return top+1;
}
public boolean isEmpty{
return top == -1;
}
public boolean isFull(){
return top == size - 1;
@pavinduLakshan
pavinduLakshan / init_stack.java
Created May 4, 2020 12:53
Class Stack {
private int arr[];
private int top;
private int size;
//Constructor
Stack (int size){
arr = new int[size]
size = size;
top = -1;
@pavinduLakshan
pavinduLakshan / algo_benchmark.c
Last active August 20, 2019 17:03
#include <time.h>
#include <stdio.h>
int main(){
clock_t start = clock();
int p = 0,n=20;
for(int i=1;p<=n;i++){
p = p+i;
@pavinduLakshan
pavinduLakshan / algo.c
Last active August 20, 2019 16:00
#include <stdio.h>
int main(){
int p = 0,n=10;
for(int i=1;p<=n;i++){
p = p+i;
printf("%d\n",p);
}