Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //////////////////////////////////////////////////////////////////////////////////////////////////////////////
- A2
- Hlavny.cpp
- #include<time.h>
- #include<iostream>
- using namespace std;
- int NajdiCisloL(int m, int n, long *cisla){
- int zac = 1;
- int prvok;
- prvok = (zac + m) / 2; // Find Mid Location of Array
- while (zac <= m && cisla[prvok] != n){ // Compare Item and Value of Mid
- if (cisla[prvok]<n)
- zac = prvok + 1;
- else
- m = prvok - 1;
- prvok = (zac + m) / 2;
- }
- if (cisla[prvok] == n){
- cout << "\nNasla sa zhoda na indexe : " << prvok << endl;
- }
- else{
- cout << "Nenasla sa zhoda" << endl;
- }
- return prvok;
- }
- int main()
- {
- int i, hladane_c, velkost_pola;
- long cisla[101], *hladane;
- int z, k, p;
- cout << "Vlozte velkost pola: ";
- cin >> velkost_pola;
- srand((unsigned)time(NULL));
- cisla[0] = (long)rand() % 10;
- for (i = 1; i <= velkost_pola; i++) {
- cisla[i] = cisla[i - 1] + rand() % 10;
- }
- for (i = 1; i <= velkost_pola; i++) {
- cout << "vygenerovane cislo [" << i - 1 << "] : " << cisla[i - 1] << endl;
- }
- cout << "zadajte cislo ktore chcete vyhladat v poli: ";
- cin >> hladane_c;
- int index;
- index = NajdiCisloL(velkost_pola, hladane_c, cisla);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement