Amir Shokri amirshnll

-
Camelcase
- Islamic Republic of Iran
- Sign in to view email
- https://amirshnll.ir
View queue-c-sharp
using System; | |
using System.Collections.Generic; | |
using System.Linq; | |
using System.Text; | |
using System.Threading.Tasks; | |
namespace WpfApplication1.myClass | |
{ | |
public class queue | |
{ |
View quick-sort-java
public class QuickSort | |
{ | |
private int counter; | |
private int array_bound; | |
private int[] array; | |
private int partition(int arr[], int low, int high) | |
{ | |
int left = low + 1; | |
int right = high; | |
int temp; |
View Convert-uppercase-to-lowercase-x8086
; multi-segment executable file template. | |
data segment | |
; add your data here! | |
msg1 db "please enter a string:$" | |
msg2 db 10,13,"to upper is:$" | |
s1 label byte | |
max1 db 40 | |
len1 db ? | |
s1_1 db 40 dup('$') |
View multiplication-table-x8086
; multi-segment executable file template. | |
data segment | |
; add your data here! | |
pkey db "press any key...$" | |
newline db 10, 13, "$" | |
i db 1 | |
j db 1 | |
number dw 0 | |
mabna dw 10 |
View Halting-Problem
import java.util.HashMap; | |
import java.util.Map; | |
import java.util.Scanner; | |
public class Main { | |
static Scanner sc = new Scanner(System.in); | |
public static void main(String[] args) { | |
long startTime = System.currentTimeMillis(); | |
long endTime; |
View hanoi-tower
public class Hanoi | |
{ | |
public void run(int n, String start, String auxiliary, String end) | |
{ | |
if (n == 1) | |
{ | |
System.out.println(start + " Go To " + end); | |
} | |
else |
View eight-minister
public class EightMinister | |
{ | |
/* Private */ | |
private int[][] arr; | |
private void setQueen(int row, int col) | |
{ | |
this.arr[row][col] = 1; | |
} |
View Sieve-of-Eratosthenes-prime-numbers
#include "stdafx.h" | |
#include "iostream" | |
#include "conio.h" | |
#include "cmath" | |
using namespace std; | |
bool *primes; | |
void primeNumber(int N) | |
{ |
View doubly-linked-list-cplusplus
#include "stdafx.h" | |
#include "iostream" | |
using namespace std; | |
struct node | |
{ | |
int data; | |
struct node *next; | |
struct node *last; |
View bubblesort-php
<?php | |
function bubblesort($a1, $a2) | |
{ | |
for( $i = sizeof($a1) ; $i >= 1 ; $i-- ) | |
{ | |
for( $j = 1 ; $j <= $i ; $j++ ) | |
{ | |
if( $a1[$j-1] > $a1[$j] ) | |
{ | |
$t = $a1[$j-1]; |
OlderNewer