C++ : Linear search a.k.a Sequential search (Brute force)

#include <iostream>

using namespace std;

// Size of array nums
const int Element=10;
//Function prototype
int linearSearch(int[], int, int);

int main()
{
 // Listing of element in array nums
 int nums[Element]={5,10,22,32,45,67,73,98,99,101};
 int item,location;

 cout<<"Enter the item you are searching for: ";
 cin>>item;

 // Calling  and passing parameter to function linearSearch()
 location=linearSearch(nums,Element,item);

 // Passing function result back to main()
    if(location> -1)
        cout<<"The item was found at index location "<<location<<endl;
    else
        cout<<"The item was not found in the array\n";
 return 0;
}

// compare key to every element of array until location is
// found or until end of array is reached. Return subscript of
// element if key is found or -1 if key not found
int linearSearch(int list[ ],int size,int key) {
 int i;
  for(i=0;i<size;i++) {
   if (list[i]==key)
   return  i;
  } return -1;
}

JAVA : MyKamus @ Putera.com

package com.putera.kamus;

/**
 * Created with IntelliJ IDEA.
 * User: Syahmi
 * Date: 16/11/2013
 * Time: 3:29
 * To change this template use File | Settings | File Templates.
 */
public class Kamus {

    public static void main(String[] args) {
        Scraper scraper = new Scraper();

        for (String arg : args) {
            String data[] = scraper.get(arg);
            if (data == null) {
                System.out.println("Ralat");
                return;
            }

            for (String s : data) {
                System.out.println(s);
            }
        }
    }
}

package com.putera.kamus;

import org.jsoup.Jsoup;
import org.jsoup.nodes.*;

import java.net.URL;
import java.net.URLEncoder;
import java.util.ArrayList;
import java.util.Iterator;

/**
 * Created with IntelliJ IDEA.
 * User: Syahmi
 * Date: 16/11/2013
 * Time: 3:35
 * To change this template use File | Settings | File Templates.
 */
public class Scraper {
    private static final String QUERY_URL = "http://prpm.dbp.gov.my/Search.aspx?k=";

    public String[] get(String word) {
        URL url;
        ArrayList<String> list = new ArrayList<String>();

        try {
            url = new URL(QUERY_URL + URLEncoder.encode(word, "UTF-8"));
            Document doc = Jsoup.parse(url, 30000);
            String resp = "";

            Iterator<Element> it = doc.select(".alternate").iterator();

            while(it.hasNext()) {
                Element e = it.next();
                list.add(e.text());
            }

            String[] array = list.toArray(new String[list.size()]);

            return array;

        } catch (Exception e) {
            String[] error = new String[1];
            error[0] = e.getMessage();

            return error;
        }
    }
}

Handling Exception & Catch (Throws Code)

Islam : Anda menghadapi masalah untuk mencari muka surat atau halaman sesuatu juz dalam Al-Quran?

Assalamualaikum ..

Kadangkala kita menghadapi masalah untuk mencari muka surat atau halaman sesuatu juz dalam Al-Quran. Sebagai contoh, juz 25 bermula muka surat berapa di dalam Al-Quran? Bagi mereka yang sudah mahir tentang Al-Quran tentu dengan mudah mencarinya. Tetapi bagaimana dengan orang yang baru berjinak dengan Al-Quran? Berikut adalah cara mudah untuk menentukan permulaan muka surat sesuatu juz berdasarkan kaedah matematik. Katakan kita hendak mencari muka surat berapa bermulanya juz 25

Contoh pertama : Juz 25

1) 25 -1 = 24 (tolak 1 adalah tetap)
2) 24 x 2 = 48 (darab 2 adalah tetap)
3) 48 diletakkan angka 2 dihujungnya => 482 (letak angka 2 adalah tetap)
4) Maka juz 25 bermula pada muka surat 482

Sekarang kita cuba dengan contoh yang lain pula iaitu mencari muka surat juz 13.

Contoh kedua: Juz 13

1) 13 - 1 = 12
2) 12 x 2 = 24
3) Letakkan angka 2 dihujung 24 => 242
4) Maka juz 13 bermula pada muka 242

Wallahhulam...Selamat mencuba

dipanjangkan info oleh: HJ. IDRIS MOHAMAD

Salam Ramadhan, Selamat Berpuasa Dan Beramal

C++ : Menukar Nilai Heximal Kepada Binari

#include<stdio.h>
#include<conio.h>

int main()
{
    int d,n,i,j,a[50];

    printf("Enter a number:");
    scanf("%d",&n);

    if(n==0)
        printf("\nThe binary conversion of 0 is 0");
    else
        {
            printf("\nThe binary conversion of %d is 1",n);

        for(i=1;n!=1;++i)
        {
            d=n%2;
            a[i]=d;
            n=n/2;
        }
        for(j=i-1;j>0;--j)
            printf("%d",a[j]);
        }
        getch();
    return (0);
}

C : Isihan buih dengan nilai rentetan

#include <stdio.h>
#define index 5

void bubbleSort(int x[],int n);

int main()
{
    int data[index]={4,45,13,10,3};
    int i;
    bubbleSort(data,index);
    for(i = 0; i < 5; i++)
    {
        printf("%d ",data[i]);
    }
}

void bubbleSort (int x[],int n)
 {
    int temp,a, flag = 1;

    while(flag)
    {
        flag = 0;
        for(a = 0; a < (n - 1); a++)
        {
            if(x[a] > x[a + 1])
            {
                flag = 1;
                temp = x[a];
                x[a] = x[a + 1];
                x[a + 1] = temp;
            }
        }
    }
 }

Struktur Data : Carian Binari

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30

#include <stdio.h> void binarySearching (int data[]) { int start=0, end=9, status=0, n, middle; printf("\n\n Integer to search :"); scanf("%d",&n); printf("\n\t Index \tData"); while((status!=1)&&(start<=end)) { middle=(start+end)/2; printf("\n\t %d\t%d", middle,data[middle]); if(n==data[middle]) status=1; else if(n<data[middle]) end=middle-1; else start=middle+1; } if(status!=1) printf("\n\t Oppss..data not found!!\n"); } int main(void) { int array[9]={2,4,6,8,10,12,14,16,18,20}; binarySearching(array); return 0; }