Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cmath>
- #include <algorithm>
- #include <math.h>
- #include <vector>
- #include <fstream>
- using namespace std;
- void myQuickSort(int A[]) {
- }
- int main()
- {
- int a[5] = {7, 9, 5, 1, 3};
- int *p = a;
- // p and &p are equals ??
- cout << *p << endl; // 7
- cout << p << endl; // 0x69feec
- cout << &p << endl; // 0x69fee8 ??????????
- cout << *(&(p)) << endl; // 0x69feec
- cout << &(*(p))<< endl; // 0x69feec
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement