Skip to main content

You are not Alone I'm here with you


http://www.youtube.com/watch?v=9dt2UeaMqlY

Another day has gone
I'm still all alone
How could this be
You're not here with me
You never said goodbye
Someone tell me why
Did you have to go
And leave my world so cold

Everyday I sit and ask myself
How did love slip away
Something whispers in my ear and says
That you are not alone
For I am here with you
Though you're far away
I am here to stay

But you are not alone
For I am here with you
Though we're far apart
You're always in my heart
But you are not alone

'Lone, 'lone
Why, 'lone

Just the other night
I thought I heard you cry
Asking me to come
And hold you in my arms
I can hear your prayers
Your burdens I will bear
But first I need your hand
Then forever can begin

Everyday I sit and ask myself
How did love slip away
Something whispers in my ear and says
That you are not alone
For I am here with you
Though you're far away
I am here to stay

For you are not alone
For I am here with you
Though we're far apart
You're always in my heart
For you are not alone

Whisper three words and I'll come runnin'
And girl you know that I'll be there
I'll be there

You are not alone
For I am here with you
Though you're far away
I am here to stay
For you are not alone
For I am here with you
Though we're far apart
You're always in my heart

For you are not alone
For I am here with you
Though you're far away
I am here to stay

For you are not alone
For I am here with you
Though we're far apart
You're always in my heart

For you are not alone...

Comments

Popular posts from this blog

Use Case Diagram for Online Book Store

Online Movie Ticket Booking Sequence Diagram

Linear search & Binary search using Template

Write a program to search an element from a list. Give user the option to perform Linear or Binary search. Use Template functions. #include<iostream> using namespace std; template <class T> void Lsearch(T *a, T item, int n) { int z=0; for(int i=0;i<n;i++) { if(a[i]== item) { z=1; cout<<"\n Item found at position = "<<i+1<<"\n\n"; } else if(z!=1) { z=0; } } if(z==0) cout<<"\n Item not found in the list\n\n"; } template <class T> void Bsearch(T *a, T item, int n) { int beg=0,end=n-1; int mid=beg+end/2; while((a[mid]!=item) && (n>0)) { if(item>a[mid]) beg=mid; else end=mid; mid=(beg+end)/2; n--; } if(a[mid]==item) cout<<"\n Item found at position = "<<mid+1<<"\n\n"; else cout<<"\n Item not found in the list\n\n"; } void main() { int iarr[10] = {2,42,56,86,87,99,323,546,767,886};