C-while statement, an algorithm, an array pointer

Source: Internet
Author: User

Sihuo: We integrity sells for so little, but it's all we really has. It is the very last inch of us. But within that inch we is free. Our integrity is not valuable, but it is all of us, that is our last inch, in this one inch, we are freedom. while () 1.     Tips for use. 1). Write loops, first write out the Loop body 2).     After writing the circular braces, the first thing is to write i++; 3). The loop body is the code that needs to be executed repeatedly 2. When writing loops. Be sure to determine the following two points. 1). Determine the loop body first.     You have to know that the 1 pieces of code need to be executed repeatedly.  2). You must know the conditions for the loop to continue or to end.   Gets the number of digits on each digit of an integer that is more than 1. Use this number/1000 to get the thousand of this number.   With this number% 1000/100 get this hundreds of bit with this number% 1000 100/10 get this number of 10 bits. Use this number% 10 to get this number of bits. 2.
1 int num[], NUM1; 2 3  for (int0, i++) {4     Ten ; 5     Ten ; 6 }
The inverse of the array is the number of array pointers on each digit of the integer.
1 //define an array2 inta[Ten] = {1,3,5,7,9, One, -, the, -, + };3 4 //Define a pointer5 int*p;6 7 //pointer variable p points to the first element of the array a[]8p = &a[0];    || p =A;9 Ten //other way of pointing One //Define a pointer A int*P1 = A; ||int*p = &a[0];

C-while statement, an algorithm, an array pointer

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.