Bubble Sort

Bubble Sort is a comparison-based sorting algorithm that repeatedly iterates through adjacent elements in a list, swapping them if they are in the wrong order, thereby gradually moving larger elements toward the end in a series of passes until the list is sorted.

94

Publications

3.2K

Citations

224

Authors

119

Institutions

Publications per year

2017–2026

29

Authors

224

  1. ML
    Mei Lu

    Tsinghua University, China

    4 publications · 196 citations

    4

    h-index

  2. RH
    Rong‐Xia Hao

    Beijing Jiaotong University, China

    4 publications · 119 citations

    4

    h-index

  3. SW
    Shiying Wang

    Henan Normal University, China

    3 publications · 99 citations

    3

    h-index

  4. JG
    Jia Guo

    Tsinghua University, China

    3 publications · 132 citations

    3

    h-index

  5. SZ
    Shu-Li Zhao

    Beijing Jiaotong University, China

    2 publications · 44 citations

    2

    h-index

1–5 of 224

Venues

  1. Discrete Applied Mathematics

    5 publications · 213 citations

    5

    h-index

  2. Theoretical Computer Science

    5 publications · 164 citations

    5

    h-index

  3. IEEE Transactions on Computers

    4 publications · 153 citations

    4

    h-index

  4. arXiv (Cornell University)

    Repository · 3 publications · 137 citations

    3

    h-index

  5. International Journal of Computer Mathematics

    3 publications · 105 citations

    3

    h-index

1–5