Scribd Logo
Upload

Welcome to Scribd!

  • 17 views

    Print

    Uploaded by

    ttw92
    The document describes binary search and linear search algorithms. It generates arrays of 100 million random integers, sorts them for binary search, and times searches between 101-300 using both algorithms. Binary search recursively halves the search space, while linear search checks each element sequentially. The results are displayed in messages boxes showing elapsed time for each search method.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd

    Print

    Uploaded by

    ttw92
    17 views3 pages
    The document describes binary search and linear search algorithms. It generates arrays of 100 million random integers, sorts them for binary search, and times searches between 101-300 using both algorithms. Binary search recursively halves the search space, while linear search checks each element sequentially. The results are displayed in messages boxes showing elapsed time for each search method.

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes binary search and linear search algorithms. It generates arrays of 100 million random integers, sorts them for binary search, and times searches between 101-300 using both algorithms. Binary search recursively halves the search space, while linear search checks each element sequentially. The results are displayed in messages boxes showing elapsed time for each search method.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    17 views3 pages

    Print

    Uploaded by

    ttw92
    The document describes binary search and linear search algorithms. It generates arrays of 100 million random integers, sorts them for binary search, and times searches between 101-300 using both algorithms. Binary search recursively halves the search space, while linear search checks each element sequentially. The results are displayed in messages boxes showing elapsed time for each search method.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    You are on page 1of 3

    BINARY SEARCH

    using using using using using using using using using using using System; System.Collections.Generic; System.ComponentModel; System.Data; System.Drawing; System.Linq; System.Text; System.Windows.Forms; System.Threading; System.Diagnostics; System.Globalization;

    namespace BinarySearch { public partial class Form1 : Form { public Form1() { InitializeComponent(); } int jumlahArray, awal, akhir, cari, mid; int[] array; Stopwatch a = new Stopwatch(); private void Form1_Load(object sender, EventArgs e) { jumlahArray = 100000000; array = new int[jumlahArray]; Random a = new Random(); for (int i = 0; i < jumlahArray; i++) { int b = a.Next(1, 101); array[i] = b; } Array.Sort(array); } bool BinarySearch(int awal, int akhir, int[] ar, int cari) { bool adaTidak = false; if (awal < akhir) { mid = (awal + akhir) / 2; if (mid == cari) { return true; } else { if (mid < cari) { awal = mid + 1; BinarySearch(awal, akhir, array, cari); } else if (mid > cari) { akhir = mid - 1; BinarySearch(akhir, akhir, array, cari); } }

    Tan Ta Hwe / 6104006

    } else { adaTidak = false; } return adaTidak; } private void btnMulai_Click(object sender, EventArgs e) { a.Start(); awal = 0; akhir = jumlahArray; for (cari = 101; cari < 301; cari++) { bool cek = BinarySearch(awal, akhir, array, cari); if (cek == true) { a.Stop(); MessageBox.Show(a.Elapsed.ToString()); break; } } a.Stop(); MessageBox.Show(a.Elapsed.ToString()); } } }

    Gambar Hasil Perhitungan :

    Tan Ta Hwe / 6104006

    LINEAR SEARCH
    using System; using System.Collections.Generic; using System.ComponentModel; using System.Data; using System.Drawing; using System.Linq; using System.Text; using System.Windows.Forms; using System.Diagnostics; using System.Threading; using System.Globalization; namespace LinearSearch { public partial class Form1 : Form { public Form1() { InitializeComponent(); } int jumlahArray = 100000000; int[] array; Stopwatch a = new Stopwatch(); private void Form1_Load(object sender, EventArgs e) { array = new int[jumlahArray]; Random a = new Random(); for (int i = 0; i < jumlahArray; i++) { int b = a.Next(1, 101); array[i] = b; } } private void btnMulai_Click(object sender, EventArgs e) { a.Start(); for (int i = 101; i < 301; i++) { for (int j = 0; j < jumlahArray; j++) { if (array[j] == i) { a.Stop(); MessageBox.Show(a.Elapsed.ToString())} } } a.Stop(); MessageBox.Show(a.Elapsed.ToString()); } } } Gambar Hasil Perhitungan :

    Tan Ta Hwe / 6104006

    You might also like