Scribd Logo
Upload

Welcome to Scribd!

  • Tugas 13

    Uploaded by

    Primatama Diski Bahrum
    5 views4 pages
    This document contains code for two Java programs that perform sequential searches on arrays. The first program searches an integer array to find a key value and prints the index if found or a message if not found. The second program similarly searches a string array in a case-insensitive manner to find a key string. Both programs use a for loop to iterate through the arrays, compare each element to the key, and break if the key is found, otherwise printing that the key was not found.

    Original Description:

    Original Title

    TUGAS 13

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains code for two Java programs that perform sequential searches on arrays. The first program searches an integer array to find a key value and prints the index if found or a message if not found. The second program similarly searches a string array in a case-insensitive manner to find a key string. Both programs use a for loop to iterate through the arrays, compare each element to the key, and break if the key is found, otherwise printing that the key was not found.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    5 views4 pages

    Tugas 13

    Uploaded by

    Primatama Diski Bahrum
    This document contains code for two Java programs that perform sequential searches on arrays. The first program searches an integer array to find a key value and prints the index if found or a message if not found. The second program similarly searches a string array in a case-insensitive manner to find a key string. Both programs use a for loop to iterate through the arrays, compare each element to the key, and break if the key is found, otherwise printing that the key was not found.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 4

    /*

    * Click nbfs://nbhost/SystemFileSystem/Templates/Licenses/license-
    default.txt to change this license
    * Click
    nbfs://nbhost/SystemFileSystem/Templates/Project/Maven2/JavaApp/src/main/java
    /${packagePath}/${mainClassName}.java to edit this template
    */

    package com.mycompany.sequential;

    /**
    *
    * @author tama
    */
    public class Sequential {

    public static void main(String[] args) {


    int[]angka = {5, 6, 9, 2, 8, 1, 7};
    boolean ketemu = false;
    int key = 8;

    for (int i = 0; i < angka.length; i++) {


    if (key == angka[i]) {
    System.out.println("Data ditemukan pada index ke-" + i);
    ketemu = true;
    break;
    }
    }

    if(ketemu == false){
    System.out.println("Data tidak ditemukan");
    }
    }
    }
    /*
    * Click nbfs://nbhost/SystemFileSystem/Templates/Licenses/license-
    default.txt to change this license
    * Click
    nbfs://nbhost/SystemFileSystem/Templates/Project/Maven2/JavaApp/src/main/java
    /${packagePath}/${mainClassName}.java to edit this template
    */

    package com.mycompany.sequential2;

    /**
    *
    * @author tama
    */
    public class Sequential2 {

    public static void main(String[] args) {


    String[] nama = {"Riyan", "Angga", "Yunus", "Gandu", "Zarin", "Nita",
    "Qiana"};
    boolean ketemu = false;
    String key = "zarin";

    for (int i = 0; i < nama.length; i++) {


    if (key.equalsIgnoreCase(nama[i])) {
    System.out.println("Data ditemukan pada index ke-" + i);
    ketemu = true;
    break;
    }
    }

    if (ketemu == false){
    System.out.println("Data tidak ditemukan");
    }
    }
    }

    You might also like