Wasit Shafi wasit-shafi

## boilerplate-markdown-for-java.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                wasit-shafi
                / boilerplate-markdown-for-java.md
            
            
              Last active
              March 2, 2023 11:15
            
          
    Boilerplate code for Java


// URL: 
/**
 * @author WasitShafi
 * @since 01-MAR-2023

  
## index.html
<!DOCTYPE html>
<html>
  <head>
    <meta charset="UTF-8">
    <meta http-equiv="Content-Security-Policy" content="default-src 'self'; script-src 'self'">
    <meta http-equiv="X-Content-Security-Policy" content="default-src 'self'; script-src 'self'">
    <title>Hello World</title>
  </head>
  <body>
    <h1>Hello World!</h1>

## electronAspectRatioOnMaximise.js
const { app, BrowserWindow } = require('electron');

const createWindow = () => {
	const win = new BrowserWindow({
		width: 500,
		height: 500,
		fullscreenable: false,
	});

	win.setAspectRatio(1);

## primeno-4.c
#include<stdio.h>

int isPrime(int n , int i)
{
    if(n < 2) return 0;
    if(n == 2) return 1;
    if(n % i == 0) return 0;
    if(i * i > n) return 1;
    isPrime(n, i + 1);
}

## primeno-3.c
#include<stdio.h>
#include<math.h>

int main()
{
    int n, i, half, isPrime = 1, square_root;

    printf("Enter Value of n... ");
    scanf("%d", &n);

## primeno-2.c
#include<stdio.h>

int main()
{
    int n, i = 2, half, isPrime = 1;

    printf("Enter Value of n... ");
    scanf("%d", &n);

    half = n / 2;

## primeno.c
#include<stdio.h>

int main()
{
    int n, i = 2 ;

    printf("Enter Value of n... ");
    scanf("%d", &n);

    if(n > 1)

## PrimeNumberOptimalApproach.java
/**
    @author wasitshafi
    @since  18-02-2020
*/
import java.util.TreeSet;
public class PrimeNumberOptimalApproach
{
    public static boolean isPrime(int n)
    {
        for(int i = 2 ; i * i <= n ; i++)

## DynamicArrayInCDemo.c
#include<stdio.h>

int main()
{
    int *bookShelf[3];                  // Array of pointer to int;

    int shelf1[3] = {1, 2, 3};          // constains 3 books of total pages 1, 2 & 3.
    int shelf2[4] = {4, 5, 6, 7};
    int shelf3[5] = {8, 9, 10, 11, 12};
    int shelvesSizes[3] = {3, 4, 5};    // It is stores no. of shelves

## README.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                wasit-shafi
                / README.md
            
            
              Created
              November 12, 2019 11:17
                — forked from developius/README.md
            
              
                Setup SSH keys for use with GitHub/GitLab/BitBucket etc
              
          
    Create a new repository, or reuse an existing one.
Generate a new SSH key:
ssh-keygen -t rsa -C "your_email@example.com"

Copy the contents of the file ~/.ssh/id_rsa.pub to your SSH keys in your GitHub account settings.
Test SSH key:
	<!DOCTYPE html>
	<html>
	<head>
	<meta charset="UTF-8">
	<meta http-equiv="Content-Security-Policy" content="default-src 'self'; script-src 'self'">
	<meta http-equiv="X-Content-Security-Policy" content="default-src 'self'; script-src 'self'">
	<title>Hello World</title>
	</head>
	<body>
	<h1>Hello World!</h1>
	const { app, BrowserWindow } = require('electron');

	const createWindow = () => {
	const win = new BrowserWindow({
	width: 500,
	height: 500,
	fullscreenable: false,
	});

	win.setAspectRatio(1);
	#include<stdio.h>

	int isPrime(int n , int i)
	{
	if(n < 2) return 0;
	if(n == 2) return 1;
	if(n % i == 0) return 0;
	if(i * i > n) return 1;
	isPrime(n, i + 1);
	}
	#include<stdio.h>
	#include<math.h>

	int main()
	{
	int n, i, half, isPrime = 1, square_root;

	printf("Enter Value of n... ");
	scanf("%d", &n);
	#include<stdio.h>

	int main()
	{
	int n, i = 2, half, isPrime = 1;

	printf("Enter Value of n... ");
	scanf("%d", &n);

	half = n / 2;
	#include<stdio.h>

	int main()
	{
	int n, i = 2 ;

	printf("Enter Value of n... ");
	scanf("%d", &n);

	if(n > 1)
	/**
	@author wasitshafi
	@since 18-02-2020
	*/
	import java.util.TreeSet;
	public class PrimeNumberOptimalApproach
	{
	public static boolean isPrime(int n)
	{
	for(int i = 2 ; i * i <= n ; i++)
	#include<stdio.h>

	int main()
	{
	int *bookShelf[3]; // Array of pointer to int;

	int shelf1[3] = {1, 2, 3}; // constains 3 books of total pages 1, 2 & 3.
	int shelf2[4] = {4, 5, 6, 7};
	int shelf3[5] = {8, 9, 10, 11, 12};
	int shelvesSizes[3] = {3, 4, 5}; // It is stores no. of shelves