Data Structure:array and list

array:
1.array can sotore data and even array
2.in some array，store actual data
while in some array, store the information that if it exists in another array
3.like: use a bit Vector to present a array(used in machone learning “minist”)
{1,2,3,4,5,6,7,8,9,0} so the array {1,4,7} was presents as
{1,0,0,1,0,0,1,0,0,0}

dict:
1.dict = {“key”:value} (dictionary stores key-value pairs)

serch function:
1.sequent search
2.Binary Search(折半搜索): as the list is sequent.1st skip to the mid of the list,
judge if its > or < the num we search for … …
two algorithm to reach it;
loop and recursion

tips:

unsigned right shift operator:[无符号右移运算]
a >> b； change a to binary type, and shift every 1or0 towards right b sites