Skip to main content

What is Divide And Conquer Technique

Divide and Conquer is a programming technique which makes the program more efficient to write. And this technique work on the concept of recursion to solve a problem step by step. Generally this technique work in three parts:- Divide:-  Divide the problem into some subproblem. Conquer:-  Conquer the subproblem by calling recursively until subproblem solved. Combine:-  (Optional Step) Combine the subproblem solution. So, that we will get the final problem Solution.  When the subproblems are large enough to solve recursively, we call the recursive case. Once the subproblem becomes small enough that we no longer recursive, we say that the recursion "bottom out" and that we have gotten down to the base case.                          Application of Divide and Conquer Quick Sort Strassen's algorithm for matrix multiplication Merge Sort Counting inversions Binary Search Finding Min and ...
1 comment

Extracting all states of India from wikipedia link using Jsoup jar and Java language

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
package urldatafetch;

/**
 *
 * @author Rishabh
 */
import java.io.IOException;
import java.io.PrintWriter;

import org.jsoup.Jsoup;
import org.jsoup.nodes.Document;
import org.jsoup.nodes.Element;
import org.jsoup.select.Elements;



public class testing {
public static void main(String[] args) throws IOException {


      org.jsoup.nodes.Document doc = Jsoup.connect("https://en.wikipedia.org/wiki/India").get();
      org.jsoup.select.Elements tables =doc.select("table");
       // org.jsoup.select.Elements rows = doc.select("tr");
        PrintWriter pw=new PrintWriter("tabledata.txt");
       int i=1;
       int j=1;
       int k=1;
       String state[]=new String[29];
     for(org.jsoup.nodes.Element tableo :tables)
     {  if(i==1 ||i==2 ||i==4){i++;}
     else if(i==3)
     {  org.jsoup.select.Elements rows=tableo.select("tr");
        for(org.jsoup.nodes.Element row :rows)
        {
            org.jsoup.select.Elements columns = row.select("td");
            for (org.jsoup.nodes.Element column:columns)
            {
              if(j==29){j=1;}
             
             
                if(j<=29){
                if(column.text().contains(j+"."))
                {   if(j<10){
                    String mol=column.text().substring(3);
                    pw.append(column.text());
                    state[j-1]=mol;
              // System.out.println(column.text());
                System.out.println(mol);}
                 if(j>9){
                    String mol=column.text().substring(4);
                    pw.append(mol);
                    state[j-1]=mol;
                System.out.println(mol);}
              j++;  }
            }

            }
            //System.out.println();
         
            i++;
        }}}
}
}

Comments

  1. valonalascala4 March 2022 at 03:13

    Borgata Hotel Casino & Spa | Jobs, Careers | KTRK
    Welcome to 영천 출장안마 Borgata 바카라 신규 가입 쿠폰 Hotel 여주 출장안마 Casino & Spa! Our flagship property, Borgata Hotel Casino & Spa has become 시흥 출장샵 an exciting destination 전라남도 출장마사지 for travelers visiting

    ReplyDelete

Post a Comment

Popular posts from this blog

What is Divide And Conquer Technique

Divide and Conquer is a programming technique which makes the program more efficient to write. And this technique work on the concept of recursion to solve a problem step by step. Generally this technique work in three parts:- Divide:-  Divide the problem into some subproblem. Conquer:-  Conquer the subproblem by calling recursively until subproblem solved. Combine:-  (Optional Step) Combine the subproblem solution. So, that we will get the final problem Solution.  When the subproblems are large enough to solve recursively, we call the recursive case. Once the subproblem becomes small enough that we no longer recursive, we say that the recursion "bottom out" and that we have gotten down to the base case.                          Application of Divide and Conquer Quick Sort Strassen's algorithm for matrix multiplication Merge Sort Counting inversions Binary Search Finding Min and ...
1 comment
Read more

POLYGON FORMATION IN C

                       /*  POLYGON FORMATION IN C  */ #include<stdio.h> #include<conio.h> #include<graphics.h> #include<stdlib.h> void main() {     int n,x[15],y[15],i;     printf("ENTER THE NUMBER OF SIDE OF POLYGON:\n");     scanf("%d",&n);     if(n<3)     { printf("POLYGON CAN'T BE FORM\n"); getch(); exit(0);     }     else     { for(i=1;i<=n;i++) { printf("ENTER THE CORDINATES OF THE POLYGON %d SIDE\n",i); scanf("%d %d",&x[i],&y[i]); } int gd=DETECT,gm; initgraph(&gd,&gm,"C:\\tc\\BGI"); for(i=1;i<n;i++) { line(x[i],y[i],x[i+1],y[i+1]); } line(x[1],y[1],x[n],y[n]); } getch(); }
1 comment
Read more

Bresenham circle drawing program in C

  /* This is the program for bresenham circle drawing  in C */ #include<stdio.h> #include<conio.h> #include<graphics.h> #include<dos.h> void main() { int gdriver = DETECT,gmode,x,y,r,x1,y1; float e; initgraph(&gdriver,&gmode,"C:\\tc\\BGI"); printf("center co-ordinate of x and y position of circle:\n"); scanf("%d %d",&x,&y); printf("input the radius of circle:\n"); scanf("%d",&r); x1=1; y1=r; putpixel(x+0,y+r,RED); putpixel(x+r,y+0,RED); putpixel(x-0,y-r,RED); putpixel(x-r,y-0,RED); e=3-2*r;   while(x1<y1) { if(e<0) { x1=x1+1; e=e+4*x1+6; } else { x1=x1+1; y1=y1-1; e=e+4*(x1-y1)+10; }           putpixel(x+x1,y+y1,1); putpixel(x+y1,y+x1,2); putpixel(x-x1,y+y1,3); putpixel(x-y1,y+x1,4); putpixel(x-x1,y-y1,5); putpixel(x-y1,y-x1,6); putpixel(x+x1,y-y1,7); putpixel(x+y1,y-x1,8); delay(100); } getch(); } /*NOTE:-You have to change the graphics...
Post a Comment
Read more