# algorithm

**Repository Path**: shun998/algorithm

## Basic Information

- **Project Name**: algorithm
- **Description**: 算法
- **Primary Language**: Java
- **License**: Not specified
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2022-03-30
- **Last Updated**: 2022-05-06

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

# 算法笔记

## 1.新手

1.1 打印32位(Integer.MAX_VALUE为2^31-1,首位为符号位)

```java
package practice.begin;

/**
 * @User: layman
 * @Date: 2021/12/29 9:41
 * @Description:
 */
public class Code01_PrintB {
    public static void main(String[] args) {
        ////32位 00000101000000001010010100001000
        //int num = 83928328;
        //32位 00000000000000000000000000000001
        int num = 1;
        print(num);
        //01111111111111111111111111111111
        //无符号的范围0~2^32-1      2^32个
        //有符号的范围-2^31~2^31-1  2^32个
        int max = Integer.MAX_VALUE;
        print(max);
        //11111111111111111111111111111111
        //~x+1
        //int fushu=-1;
        //print(fushu);
        //10000000000000000000000000000000
        int min = Integer.MIN_VALUE;
        print(min);
        int a = 123;
        int b = ~a;
        //00000000000000000000000001111011
        //11111111111111111111111110000100
        //print(a);
        //print(b);
        int c = 12334242;
        int d = 42342432;
        //00000000101111000011010010100010
        //00000010100001100001100000100000
        //00000010101111100011110010100010
        //00000000100001000001000000100000
        //00000010001110100010110010000010
        print(c);
        print(d);
        print(c | d);
        print(c & d);
        print(c ^ d);
        //11000000000000000000000000000000
        //01000000000000000000000000000000
        print(min >> 1);//带符号右移,符号补
        print(min >>> 1);//不带符号右移,0补

    }

    private static void print(int num) {
        for (int i = 31; i >= 0; i--) {
            System.out.print((num & (1 << i)) == 0 ? "0" : "1");
        }
        System.out.println();
    }
}

```

1.2 选择排序

![image-20220106113930846](README.assets/image-20220106113930846.png)

1.3 冒泡排序

![image-20220106114220539](README.assets/image-20220106114220539.png)

1. 4 插入排序

![image-20220106114741838](README.assets/image-20220106114741838.png)

tips:  `x*2-> x<<1  x+1 -> x|1`

最右侧的1`N&((~N)+1)` 抹掉最右侧的1`N^=rightOne`

1.5 递归复杂度![image-20220106145156649](README.assets/image-20220106145156649.png)

![image-20220106151210855](README.assets/image-20220106151210855.png)

![image-20220106190933803](README.assets/image-20220106190933803.png)![image-20220107120053773](README.assets/image-20220107120053773.png)

![image-20220110111538611](README.assets/image-20220110111538611.png)![image-20220110142106834](README.assets/image-20220110142106834.png)

`LinkedList 双端队列`

![image-20220116182936069](README.assets/image-20220116182936069.png)![image-20220120172120855](README.assets/image-20220120172120855.png)![image-20220116183025358](README.assets/image-20220116183025358.png)2.基础

![image-20220123120037597](README.assets/image-20220123120037597.png)![image-20220123120807335](README.assets/image-20220123120807335.png)![image-20220123193314737](README.assets/image-20220123193314737.png)

![image-20220124162142422](README.assets/image-20220124162142422.png)

![image-20220125115720984](README.assets/image-20220125115720984.png)

![image-20220125120019097](README.assets/image-20220125120019097.png)

![image-20220126140656108](README.assets/image-20220126140656108.png)

![image-20220127093750501](README.assets/image-20220127093750501.png)       

## 3.进阶