[Help]C++

[Tawa]

This should work:

#include <iostream>
#include <string>
using namespace std;

int main() {
    char a[100];
    char b[100];
    int la, lb;
    bool isSubstring = false;

    cout << "Enter first line: ";
    cin.get(a, 100, '\n');

    cout << "Enter second line: ";
    cin.ignore();
    cin.get(b, 100, '\n');

    la = strlen(a);
    lb = strlen(b);

    for(int i = 0; i < lb-la+1; i++){
        for(int j = 0; j < la; j++){
            if(b[i+j] != a[j])
                break;
            if(j == la-1)
                isSubstring = true;
        }
        if(isSubstring)
            break;
    }
    if(isSubstring)
        cout << "Yeah Baby!" << endl;
    else
        cout << "No! No! No!" << endl;

    return 0;
}

[ZC]

I ran it bi 3a222id:P man thanx aloooooooooot:P i guess ur smarter than me:P i didnt even understand what u did:P

[ZC]

can u explain the algorithM :P?

[ZC]

BTW fio problem... awwal string 3tee TAWAKBIR
teneh string 3teee AKBIR bi illak no :P

[ZC]

not working toli3

[Tawa]

Originally Posted by ZC

not working toli3

As I read in your post where you explained the homework, the program has to check if the "FIRST" string is a substring for the "SECOND".

So, if you input AKBIR then TAWAKBIR, it'll work.

So I guess it's working.

[nabilsaleh1992]

Originally Posted by ZC

ask the user to input a string.. and then input another string.. the program should check if the second is a substring of teh first

it's the opposite you have to check if the first is a substring of the second.

dude im taking the same course and i have the same assignment, would it happen that we're in the same class?

[Adam]

Does anyone know if there is any advantage in performance when using recursive binary search rather than normal binary search?


EDIT: I also find this piece of code when reading about recursive binary search...

int nMid = (nMin + nMax) >> 1;

Does anyone knows what it means?

[Tawa]

Originally Posted by Adam

EDIT: I also find this piece of code when reading about recursive binary search...

int nMid = (nMin + nMax) >> 1;

Does anyone knows what it means?

http://www-numi.fnal.gov/offline_sof...rib/shift.html

[Google]

Originally Posted by Adam

Does anyone know if there is any advantage in performance when using recursive binary search rather than normal binary search?


EDIT: I also find this piece of code when reading about recursive binary search...

int nMid = (nMin + nMax) >> 1;

Does anyone knows what it means?

This is just a division by two.