Java

import java.util.Scanner;

public class BinarySearch {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter the Length of array: ");
        int a = sc.nextInt();
        System.out.print("Enter the value for search: ");
        int key = sc.nextInt();
        int[] arr = new int[a];
        int i, strat = 0, end = arr.length - 1;
        for (i = 0; i < arr.length - 1; i++) {
            System.out.print("Enter the number for array: ");
            arr[i] = sc.nextInt();
        }
        while (strat <= end) {
            int mid = (strat + end) / 2;
            if (mid == key) {
                System.out.print("Number found");
                break;
            } else if (mid < key) {
                strat = key;
                mid = strat - end / 2;

            } else if (mid > key) {
                end = key;
                mid = strat - end / 2;
            }
            if (end > strat) {
                System.out.print("Number not found");
            }
            // System.out.println("number not found");
            
            import java.util.Scanner;

public class dijkstraalgorithm {
  private static void dijkstra(int[][] adjacencyMatrix) {
    int v = adjacencyMatrix.length;
    boolean visited[] = new boolean[v];
    int distance[] = new int[v];
    distance[0] = 0;
    for (int i = 1; i < v; i++) {
      distance[i] = Integer.MAX_VALUE;
    }
    for (int i = 0; i < v - 1; i++) {

      int minVertex = findMinVertex(distance, visited);
      visited[minVertex] = true;

      for (int j = 0; j < v; j++) {
        if (adjacencyMatrix[minVertex][j] != 0 && !visited[j] &&
          distance[minVertex] != Integer.MAX_VALUE) {
          int newDist = distance[minVertex] +
            adjacencyMatrix[minVertex][j];
          if (newDist < distance[j]) {
            distance[j] = newDist;
          }
        }
      }
    }

    for (int i = 0; i < v; i++) {
      System.out.println(i + " " + distance[i]);
    }
  }
  private static int findMinVertex(int[] distance, boolean visited[]) {
    int minVertex = -1;
    for (int i = 0; i < distance.length; i++) {
      if (!visited[i] && (minVertex == -1 || distance[i] <
          distance[minVertex])) {
        minVertex = i;
      }
    }
    return minVertex;
  }
  public static void main(String[] args) {
    Scanner s = new Scanner(System.in);
    int v = s.nextInt();
    int e = s.nextInt();
    int adjacencyMatrix[][] = new int[v][v];
    for (int i = 0; i < e; i++) {
      int v1 = s.nextInt();
      int v2 = s.nextInt();
      int weight = s.nextInt();
      adjacencyMatrix[v1][v2] = weight;
      adjacencyMatrix[v2][v1] = weight;
    }
    s.close();
    dijkstra(adjacencyMatrix);
  }
}
        }
    }
}