diff --git a/Array-Sorting-Without-Function/README.md b/Array-Sorting-Without-Function/README.md deleted file mode 100644 index 0fb1a65..0000000 --- a/Array-Sorting-Without-Function/README.md +++ /dev/null @@ -1,16 +0,0 @@ -# Array Sorting using Bubble Sort - -Defination: Array Sorting using bubble sorting method and print each operation of Sorting. -# Example - 1: -Input: - -[5,-99,7,4,1,22,6,5,2,0,11,6,-5,15,4] - - -Output: - -[-99,-5,0,1,2,4,4,5,5,6,6,7,11,15,22] - - - - diff --git a/Draw-Pattern/JayAkbari/draw-pattern.c b/Draw-Pattern/JayAkbari/draw-pattern.c new file mode 100644 index 0000000..38bc833 --- /dev/null +++ b/Draw-Pattern/JayAkbari/draw-pattern.c @@ -0,0 +1,16 @@ +#include +void main() +{ + int i, j,k; + for(i=5; i>=1; i--) + { + for(j=5; j>=1; j--) + { + for(k=i; k>=1; k--) + { + printf("%d",j); + } + } + printf("\n"); + } +} diff --git a/Nth-Digit-Fibonacci/JayAkabri/Main.java b/Nth-Digit-Fibonacci/JayAkabri/Main.java new file mode 100644 index 0000000..e51aa57 --- /dev/null +++ b/Nth-Digit-Fibonacci/JayAkabri/Main.java @@ -0,0 +1,34 @@ +import java.io.*; +import java.util.*; +public class Main { + + public static void main(String[] args) { + + int n = 1000, t1 = 0, t2 = 1,count=1,no=0; + + Scanner sc = new Scanner(System.in); + + System.out.println("Enter Number"); + no = sc.nextInt(); + + // System.out.print("Upto " + n + ": "); + while (count +int pelindrome(int n) +{ + int t,r = 0; + t=n; + while(t!=0) + { + r=r*10; + r=r+(t%10); + t=t/10; + } + if(r==n) + return 1; + else + return 0; +} +void main() +{ + int k,d,i; + printf("enter number: "); + scanf("%d",&k); + i = k + 1; + while(1) + { + d=palindrome(i); + if(d==1) + break; + i++; + } + printf("%d",i); +}