From bf924f28186efe45df7371a44ba03e3430e75c35 Mon Sep 17 00:00:00 2001
From: soft_lipa <1796702446@qq.com>
Date: Wed, 27 Nov 2024 22:18:36 +0800
Subject: [PATCH] s
---
.idea/.gitignore | 8 ---
.idea/checkstyle-idea.xml | 17 -----
.idea/inspectionProfiles/Project_Default.xml | 36 ----------
.idea/misc.xml | 6 --
.idea/modules.xml | 8 ---
.idea/vcs.xml | 6 --
15372338.java | 18 -----
15620229.java | 18 -----
15651046.java | 19 ------
15684741.java | 19 ------
15778243.java | 1 -
15781013.java | 24 -------
15845948.java | 20 ------
9619048.java | 18 -----
LICENSE | 29 --------
README.en.md | 36 ----------
README.md | 5 --
Zoey12138/15846229.java | 21 ------
activity-school | 1 -
activity-school.iml | 16 -----
codes/ BHUIJ217892/11003994.java | 11 ---
codes/ Dreamlover/11202583.java | 18 -----
codes/ Greeter/11262621.java | 20 ------
codes/ Iboydoss/11210866.java | 20 ------
codes/ Jingyu/11302198.java | 18 -----
codes/ NProgress/11324505.java | 18 -----
codes/ OPReno/11276365.java | 18 -----
codes/ PHPhph/.keep | 0
codes/ PHPhph/11120724.java | 11 ---
codes/ Qw2229188799/11089611.java | 18 -----
codes/ String/11118586.java | 18 -----
codes/ YYDS2023/11094401.java | 11 ---
codes/ Z3608759124/10979186.java | 20 ------
codes/ budasan/11121691.java | 19 ------
codes/ bupiovm0101/11122657.java | 22 ------
codes/ buzhidao/11118686.java | 21 ------
codes/ deijia909/.keep | 0
codes/ fasfaf227/.keep | 0
codes/ fasfaf227/15820189.java | 19 ------
codes/ gui8989/11228793.java | 19 ------
codes/ liwei2496/11466656.java | 18 -----
codes/ lovscene/11290992.java | 18 -----
codes/ memuqee/11238999.java | 19 ------
codes/ mupimage/11254168.java | 21 ------
codes/ neineiya/11260235.java | 18 -----
codes/ openAI12/11234314.java | 18 -----
codes/ opsation/11293380.java | 18 -----
codes/ passass/11299378.java | 18 -----
codes/ sdsacc23/.keep | 0
codes/ sdsacc23/15743254.java | 19 ------
codes/ slamer/11242607.java | 19 ------
codes/ subNvue/11264972.java | 18 -----
codes/ susuplus/11211308.java | 22 ------
codes/ swgger/11211222.java | 11 ---
codes/ ttyylb/11228246.java | 18 -----
codes/ uioplck/11253331.java | 20 ------
codes/ xingwang/11302451.java | 22 ------
codes/ zhoucheng/11464584.java | 18 -----
codes/ znnzmm/11212509.java | 18 -----
codes/ zouyu5521/11464070.java | 24 -------
codes/.10968772.java.swo | Bin 12288 -> 0 bytes
codes/.14612723.java.swp | Bin 12288 -> 0 bytes
codes/.15531109.java.swp | Bin 12288 -> 0 bytes
codes/.15781098.java.swp | Bin 12288 -> 0 bytes
codes/.15823309.java.swp | Bin 12288 -> 0 bytes
codes/.16199622.java.swp | Bin 12288 -> 0 bytes
codes/.9947891.java.swp | Bin 4096 -> 0 bytes
codes/.9947891.swp | Bin 12288 -> 0 bytes
codes/.9968905.java.swp | Bin 12288 -> 0 bytes
codes/.DS_Store | Bin 8196 -> 0 bytes
codes/.keep | 0
codes/10971000.java | 11 ---
codes/11179070.java | 18 -----
codes/11446072.java | 19 ------
codes/15527405.java | 18 -----
codes/15541001.java | 20 ------
codes/15582699.java | 18 -----
codes/15585762.java | 18 -----
codes/15607358.java | 19 ------
codes/15620229.java | 18 -----
codes/15636076.java | 19 ------
codes/15699820.java | 20 ------
codes/15700256.java | 20 ------
codes/15700309.java | 20 ------
codes/15732362.java | 18 -----
codes/15759151.java | 20 ------
codes/15775145.java | 20 ------
codes/15776507.java | 35 ----------
codes/15834244.java | 18 -----
codes/15845628.java | 20 ------
codes/16200342.java | 18 -----
codes/17034577.java | 0
codes/18149367.java | 20 ------
codes/18379057.java | 12 ----
codes/9622480.java | 18 -----
codes/9785926.java | 19 ------
codes/A13230295092/15791717.java | 26 -------
codes/A13753608906/15847648.java | 18 -----
codes/A13753635706/15847469.java | 18 -----
codes/A15579521660/15861437.java | 20 ------
codes/A15579541660/15861674.java | 20 ------
codes/A15898703309/15820507.java | 19 ------
codes/A1607142431/10995009.java | 20 ------
codes/A16691797881/15854214.java | 22 ------
codes/A17355931314/15646257.java | 19 ------
codes/A17730000544/15630407.java | 19 ------
codes/A17864114150/15832573.java | 19 ------
codes/A17864115054/15528622.java | 19 ------
codes/A18172972897/15861687.java | 20 ------
codes/A18839698468/15830742.java | 27 --------
codes/A19114652439/15836795.java | 19 ------
codes/A19127470761/15834094.java | 22 ------
codes/A19356583352/15628459.java | 19 ------
codes/A19897301746/15836849.java | 19 ------
codes/A2606488516/15814309.java | 18 -----
codes/A7777777/11213040.java | 20 ------
codes/A853047901/.java | 64 ------------------
codes/A853047901/10845109.java | 11 ---
codes/A8888888/11187517.java | 18 -----
codes/AA15930757026/15765678.java | 19 ------
codes/ABOD01/11326499.java | 21 ------
codes/ARSHAM/11202647.java | 18 -----
codes/ASD8899/.keep | 0
codes/ASD8899/15742420.java | 19 ------
codes/ASR1523580/15669420.java | 17 -----
codes/Aa12345678/.keep | 0
codes/Aa12345678/10043731.java | 11 ---
codes/Airbnb/11260348.java | 22 ------
codes/Allen123/18357308.java | 19 ------
codes/Amyaaa/15624605.java | 18 -----
codes/Anheqiao/15630084.java | 18 -----
codes/Anheqiao0512/15535529.java | 19 ------
codes/AnolisOpen/9754131.java | 20 ------
codes/AnshunEduc/.keep | 0
codes/AnshunEduc/15815295.java | 19 ------
codes/AuuuAa/11292635.java | 22 ------
codes/Ayj200417/15815229.java | 20 ------
codes/Ayuanlou/15592112.java | 35 ----------
codes/BHUIJ217892/11003994.java | 20 ------
codes/BMWAimee/15775743.java | 20 ------
codes/BY2487564355/15781003.java | 20 ------
codes/Beca0101/11118448.java | 28 --------
codes/BitBlitz/.keep | 0
codes/BitBlitz/15775656.java | 20 ------
codes/Blue_Snow/15778600.java | 18 -----
codes/BrokenDreams/11287383.java | 22 ------
codes/C15703010346/15826230.java | 11 ---
codes/CC422AAACC/.keep | 0
codes/CC422AAACC/15742406.java | 19 ------
codes/CKXGZXA/14237106.java | 21 ------
codes/CMOSInverter/.keep | 0
codes/CMOSInverter/15780363.java | 27 --------
codes/CS_Joer/11449450.java | 18 -----
codes/CY3761/15780413.java | 18 -----
codes/Calli990/11027717.java | 24 -------
codes/CangBOP/11303209.java | 19 ------
codes/Cannon/11268645.java | 20 ------
codes/Captaincc/.keep | 0
codes/Captaincc/15781895.java | 18 -----
codes/Case19523171659/.keep | 0
codes/Case19523171659/10972507.java | 11 ---
codes/Chailly/15776240.java | 18 -----
codes/Charles953/11342263.java | 11 ---
codes/Chat-4/11187682.java | 19 ------
codes/CheeseMen/11466037.java | 18 -----
codes/ChengRunji/15532439.java | 19 ------
codes/Chengxiaoyu/15650592.java | 18 -----
codes/Chesed/18676140.java | 18 -----
codes/Christopher/15635786.java | 18 -----
codes/Chuck395/11358350.java | 11 ---
codes/Chy3095852337/18699632.java | 31 ---------
codes/CloudyLemonade/15780990.java | 18 -----
codes/Cobytebyte/.keep | 0
codes/Cobytebyte/15779518.java | 18 -----
codes/Coder_Kang/.keep | 0
codes/Coder_Kang/15777819.java | 18 -----
codes/Colazxk/9952351.java | 19 ------
codes/CuiChenyuan/15758456.java | 19 ------
codes/D15059170203/.keep | 0
codes/D15059170203/10976249.java | 11 ---
codes/DENGXC/10553088.java | 11 ---
codes/DFSVVV/16465950.java | 19 ------
codes/DH13480641255/15621028.java | 20 ------
codes/Daenery/.keep | 0
codes/Daenery/15780888.java | 18 -----
codes/DaybyDay/11117022.java | 11 ---
codes/DeepThinking/11452012.java | 18 -----
codes/Dgwoisdg/11001326.java | 11 ---
codes/Dobyhe4rts/.keep | 0
codes/Dobyhe4rts/15844721.java | 19 ------
codes/DongGuoPy/.keep | 0
codes/DongGuoPy/15844969.java | 19 ------
codes/Dream1tposs/.keep | 0
codes/Dream1tposs/15843789.java | 19 ------
codes/Dream_37/15775021.java | 21 ------
codes/Dreamachine/15834244.java | 18 -----
codes/Dreamlover/11202583.java | 18 -----
codes/Duvet123/11306690.java | 21 ------
codes/DuxiaoJava/.keep | 0
codes/DuxiaoJava/15841250.java | 19 ------
codes/EthanLeo/10155282.java | 20 ------
codes/Evening/15453362.java | 25 -------
codes/F5Lauchers/.keep | 0
codes/F5Lauchers/15845684.java | 19 ------
codes/FEEEDED/15775783.java | 18 -----
codes/FE_winter/.keep | 0
codes/FE_winter/15781031.java | 19 ------
codes/FNCdoinb/.keep | 0
codes/FNCdoinb/15845153.java | 19 ------
codes/FOYEGE/11326121.java | 18 -----
codes/Falcon/17001758.java | 19 ------
codes/Faweiya/11259965.java | 19 ------
codes/FbxgIt/11302915.java | 22 ------
codes/FiberMoney/.keep | 0
codes/FiberMoney/15842105.java | 19 ------
codes/Fickler/15510871.java | 19 ------
codes/Firethrows/.keep | 0
codes/Firethrows/15845639.java | 19 ------
codes/Fitz_dev/9948244.java | 11 ---
codes/Fog16623132936/.keep | 0
codes/Fog16623132936/10972627.java | 11 ---
codes/Freewarnings/.keep | 0
codes/Freewarnings/15841566.java | 19 ------
codes/Fulovecode/.keep | 0
codes/Fulovecode/15843647.java | 19 ------
codes/Fuysus/15342593.java | 21 ------
codes/G3264043229/15813840.java | 18 -----
codes/G4me4399/.keep | 0
codes/G4me4399/15843085.java | 19 ------
codes/GIN0001/15777016.java | 26 -------
codes/GUIDM1966/15524857.java | 18 -----
codes/GZofGO/.keep | 0
codes/GZofGO/15846696.java | 19 ------
codes/Gesture/11255850.java | 22 ------
codes/Ghib66/15510318.java | 20 ------
codes/GiteeWy1/.keep | 0
codes/GiteeWy1/15843556.java | 19 ------
codes/GoStraightOn/14341961.java | 18 -----
codes/Golangu4ge/.keep | 0
codes/Golangu4ge/15844492.java | 19 ------
codes/Greeter/11262621.java | 20 ------
codes/Guna777/15714682.java | 21 ------
codes/H17630975837/15780333.java | 26 -------
codes/H17695838659/15775857.java | 18 -----
codes/HCTema/.keep | 0
codes/HCTema/15846117.java | 19 ------
codes/HMqusi/11299684.java | 11 ---
codes/HUmui0101/11027238.java | 19 ------
codes/Haichan/15780779.java | 18 -----
codes/HandsomeSean/11463861.java | 20 ------
codes/HappyJess/16199150.java | 19 ------
codes/HappyJess/16200488.java | 19 ------
codes/HappyJess/16200532.java | 19 ------
codes/HeRuo123/15520250.java | 21 ------
codes/HelloWorld1/11257582.java | 18 -----
codes/Henriette/11038762.java | 19 ------
codes/Hksr223/15534956.java | 18 -----
codes/HotSpringEye/11446072.java | 19 ------
codes/HsuehBo/18504702.java | 20 ------
codes/HunterHans/12287484.java | 11 ---
codes/Hybridsky/.keep | 0
codes/Hybridsky/15775385.java | 11 ---
codes/IM12138/11469383.java | 19 ------
codes/IXHE2004/15639769.java | 25 -------
codes/Iboydoss/11210866.java | 20 ------
codes/IoTanw/11135258.java | 18 -----
codes/JJ18809227089/15752040.java | 18 -----
codes/JackieYe/15543330.java | 18 -----
codes/Jang10/15536247.java | 18 -----
codes/January/.keep | 0
codes/January/11070767.java | 18 -----
codes/JasenChao/13984025.java | 17 -----
codes/Jasonakeke/15520912.java | 18 -----
codes/Jgf3096619665/15774713.java | 18 -----
codes/Jingyu/11302198.java | 18 -----
codes/Jinzj_828/15842649.java | 18 -----
codes/Juliani/11207255.java | 18 -----
codes/K18475329871/15592083.java | 18 -----
codes/KEQI73205/.keep | 0
codes/KEQI73205/15778430.java | 18 -----
codes/Kang12138/15653043.java | 23 -------
codes/Keeper/15775425.java | 15 ----
codes/KijD_wyp/15647839.java | 21 ------
codes/Kio1262902996/11044068.java | 22 ------
codes/Kristen/11804698.java | 18 -----
codes/L1114867467/15809127.java | 19 ------
codes/L13225391057/15834676.java | 19 ------
codes/L21362757/15899070.java | 11 ---
codes/LIJIAN-yuzhong/16982842.java | 19 ------
codes/LJX0857/.keep | 0
codes/LJX0857/10042274.java | 11 ---
codes/LS2698853114/15540958.java | 26 -------
codes/LX2745347279/16198492.java | 20 ------
codes/Laodeng/15839462.java | 22 ------
codes/LatiaoPro/11352722.java | 19 ------
codes/LightLeaf/14443538.java | 20 ------
codes/Likui123/.keep | 0
codes/Likui123/15713905.java | 20 ------
codes/Lishen/.keep | 0
codes/Lishen/15630879.java | 20 ------
codes/LongXiTWT/.keep | 0
codes/LongXiTWT/15840763.java | 19 ------
codes/Lorin210926/15605953.java | 19 ------
codes/Lovershandd/.keep | 0
codes/Lovershandd/15845218.java | 19 ------
codes/Lsaoei/15836207.java | 19 ------
codes/Lundyli/11471416.java | 19 ------
codes/Lyw413181892/15630146.java | 20 ------
codes/M8M9900/11211820.java | 11 ---
codes/MIngDx/11303026.java | 28 --------
codes/ML777-7/15832109.java | 19 ------
codes/MardaWang/15960606.java | 19 ------
codes/Martin-9527/15628832.java | 19 ------
codes/MaxLeton/.15571733.java.swp | Bin 12288 -> 0 bytes
codes/MaxLeton/15562550.java | 17 -----
codes/MaxLeton/15571733.java | 17 -----
codes/MaxLeton/15575568.java | 17 -----
codes/MaxLeton/15576146.java | 17 -----
codes/MaxLeton/15576148.java | 17 -----
codes/MaxLeton/15576152.java | 17 -----
codes/MaxLeton/15579562.java | 17 -----
codes/MaxLeton/15579566.java | 17 -----
codes/MaxLeton/15579567.java | 17 -----
codes/MaxLeton/15579569.java | 17 -----
codes/MaxLeton/15579570.java | 17 -----
codes/MaxLeton/15594053.java | 17 -----
codes/MaxLeton/15594054.java | 17 -----
codes/MaxLeton/15594056.java | 17 -----
codes/MaxLeton/15594059.java | 17 -----
codes/MaxLeton/15594060.java | 17 -----
codes/MaxLeton/15608880.java | 17 -----
codes/MaxLeton/15608883.java | 17 -----
codes/MaxLeton/15608887.java | 17 -----
codes/MaxLeton/15608889.java | 17 -----
codes/MaxLeton/15608891.java | 17 -----
codes/MaxLeton/15626095.java | 17 -----
codes/MaxLeton/15626097.java | 17 -----
codes/MaxLeton/15626100.java | 17 -----
codes/MaxLeton/15626101.java | 17 -----
codes/MaxLeton/15626102.java | 17 -----
codes/MaxLeton/15655523.java | 17 -----
codes/MaxLeton/15655527.java | 17 -----
codes/MaxLeton/15655529.java | 17 -----
codes/MaxLeton/15655530.java | 17 -----
codes/MaxLeton/15655532.java | 17 -----
codes/MaxLeton/15670770.java | 17 -----
codes/MaxLeton/15670771.java | 17 -----
codes/MaxLeton/15670774.java | 17 -----
codes/MaxLeton/15670778.java | 17 -----
codes/MaxLeton/15670781.java | 17 -----
codes/MaxLeton/15689390.java | 17 -----
codes/MaxLeton/15689391.java | 17 -----
codes/MaxLeton/15689394.java | 17 -----
codes/MaxLeton/15689395.java | 17 -----
codes/MaxLeton/15689399.java | 17 -----
codes/MaxLeton/15701706.java | 17 -----
codes/MaxLeton/15701711.java | 17 -----
codes/MaxLeton/15701714.java | 17 -----
codes/MaxLeton/15701718.java | 17 -----
codes/MaxLeton/15701720.java | 17 -----
codes/MaxLeton/15716047.java | 17 -----
codes/MaxLeton/15716048.java | 17 -----
codes/MaxLeton/15716049.java | 17 -----
codes/MaxLeton/15716050.java | 17 -----
codes/MaxLeton/15716053.java | 17 -----
codes/MaxLeton/15747350.java | 17 -----
codes/MaxLeton/15747354.java | 17 -----
codes/MaxLeton/15747356.java | 17 -----
codes/MaxLeton/15747359.java | 17 -----
codes/MaxLeton/15747361.java | 17 -----
codes/MaxLeton/16519582.java | 17 -----
codes/MaxLeton/16519586.java | 17 -----
codes/MaxLeton/16519591.java | 17 -----
codes/MaxLeton/16519593.java | 17 -----
codes/MaxLeton/16519596.java | 17 -----
codes/MaxLeton/17040714.java | 17 -----
codes/MaxLeton/17040715.java | 17 -----
codes/MaxLeton/17040721.java | 17 -----
codes/MaxLeton/17040722.java | 17 -----
codes/MaxLeton/17040725.java | 17 -----
codes/MaxLeton/17044792.java | 17 -----
codes/MaxLeton/17044794.java | 17 -----
codes/MaxLeton/17044796.java | 17 -----
codes/MaxLeton/17044797.java | 17 -----
codes/MaxLeton/17044800.java | 17 -----
codes/MaxLeton/17061868.java | 17 -----
codes/MaxLeton/17061869.java | 17 -----
codes/MaxLeton/17061870.java | 17 -----
codes/MaxLeton/17061871.java | 17 -----
codes/MaxLeton/17061873.java | 17 -----
codes/MaxLeton/17066605.java | 17 -----
codes/MaxLeton/17066607.java | 17 -----
codes/MaxLeton/17066608.java | 17 -----
codes/MaxLeton/17066609.java | 17 -----
codes/MaxLeton/17066611.java | 17 -----
codes/MaxLeton/17066615.java | 17 -----
codes/MaxLeton/17067867.java | 17 -----
codes/MaxLeton/17067870.java | 17 -----
codes/MaxLeton/17067871.java | 17 -----
codes/MaxLeton/17067872.java | 17 -----
codes/MaxLeton/17067874.java | 17 -----
codes/MaxLeton/17084198.java | 17 -----
codes/MaxLeton/17084201.java | 17 -----
codes/MaxLeton/17084202.java | 17 -----
codes/MaxLeton/17084204.java | 17 -----
codes/MaxLeton/17084206.java | 17 -----
codes/MaxLeton/17104411.java | 17 -----
codes/MaxLeton/17104414.java | 17 -----
codes/MaxLeton/17104415.java | 17 -----
codes/MaxLeton/17104420.java | 17 -----
codes/MaxLeton/17104424.java | 17 -----
codes/MaxLeton/17118929.java | 17 -----
codes/MaxLeton/17118934.java | 17 -----
codes/MaxLeton/17118937.java | 17 -----
codes/MaxLeton/17118939.java | 17 -----
codes/MaxLeton/17118941.java | 17 -----
codes/MaxLeton/17128518.java | 17 -----
codes/MaxLeton/17128519.java | 17 -----
codes/MaxLeton/17128522.java | 17 -----
codes/MaxLeton/17128527.java | 17 -----
codes/MaxLeton/17128530.java | 17 -----
codes/MaxLeton/17142779.java | 17 -----
codes/MaxLeton/17142782.java | 17 -----
codes/MaxLeton/17142783.java | 17 -----
codes/MaxLeton/17142784.java | 17 -----
codes/MaxLeton/17142785.java | 17 -----
codes/MaxLeton/17150613.java | 17 -----
codes/MaxLeton/17150614.java | 17 -----
codes/MaxLeton/17150616.java | 17 -----
codes/MaxLeton/17150617.java | 17 -----
codes/MaxLeton/17150619.java | 17 -----
codes/MaxLeton/17168898.java | 17 -----
codes/MaxLeton/17168901.java | 17 -----
codes/MaxLeton/17168903.java | 17 -----
codes/MaxLeton/17168905.java | 17 -----
codes/MaxLeton/17168907.java | 17 -----
codes/MaxLeton/17185943.java | 17 -----
codes/MaxLeton/17185948.java | 17 -----
codes/MaxLeton/17185950.java | 17 -----
codes/MaxLeton/17185953.java | 17 -----
codes/MaxLeton/17185957.java | 17 -----
codes/MaxLeton/17199424.java | 17 -----
codes/MaxLeton/17199427.java | 17 -----
codes/MaxLeton/17199429.java | 17 -----
codes/MaxLeton/17199431.java | 17 -----
codes/MaxLeton/17199433.java | 17 -----
codes/MaxLeton/17212361.java | 17 -----
codes/MaxLeton/17212364.java | 17 -----
codes/MaxLeton/17212369.java | 17 -----
codes/MaxLeton/17212370.java | 17 -----
codes/MaxLeton/17212371.java | 17 -----
codes/Melantha/15775251.java | 36 ----------
codes/Meng527/10036105.java | 19 ------
codes/Monorepo/11203800.java | 21 ------
codes/Mrzhao/11115789.java | 19 ------
codes/Mu2024s/.keep | 0
codes/Mu2024s/15843378.java | 19 ------
codes/MuZiNan/.15657839.java.swp | Bin 12288 -> 0 bytes
codes/MuZiNan/10041393.java | 18 -----
codes/MuZiNan/15657839.java | 17 -----
codes/Muzizy/15639710.java | 18 -----
codes/Myron520/15614791.java | 23 -------
codes/N193560C/15816303.java | 18 -----
codes/NANF41/11116589.java | 18 -----
codes/NPUlhy/18473575.java | 21 ------
codes/NProgress/11324505.java | 20 ------
codes/NX9990/15752874.java | 18 -----
codes/NXJ19563886818/15812590.java | 19 ------
codes/Namesp4ces/.keep | 0
codes/Namesp4ces/15839516.java | 19 ------
codes/Navigation1/11130536.java | 19 ------
codes/NeilGCT/15827010.java | 17 -----
codes/Ni123456/15562619.java | 18 -----
codes/Ni123456/15630872.java | 18 -----
codes/OPReno/11276365.java | 18 -----
codes/OVO16199/15832632.java | 19 ------
codes/OceanBase/11302025.java | 18 -----
codes/Ohiyo123ywj/.keep | 0
codes/Ohiyo123ywj/15843898.java | 19 ------
codes/OnMoreTime/10860781.java | 24 -------
codes/OneMuMu/11370801.java | 11 ---
codes/OutlEts/11343931.java | 21 ------
codes/P4rt01/15689858.java | 19 ------
codes/PHPhph/11120724.java | 11 ---
codes/PUAdewo/11303488.java | 22 ------
codes/Pengyouyou/15805929.java | 11 ---
codes/PexoPexo/11116939.java | 18 -----
codes/Platform/11203867.java | 20 ------
codes/PunkHeart/16456064.java | 19 ------
codes/Q13944328337/15841142.java | 18 -----
codes/Q18379787658/15861304.java | 20 ------
codes/Q2529807676/15563540.java | 35 ----------
codes/Q8888688888/11213062.java | 18 -----
codes/QQ504113939/15788225.java | 19 ------
codes/QiQi77/15719621.java | 27 --------
codes/Qking123/.15572198.java.swp | Bin 12288 -> 0 bytes
codes/Qking123/15572198.java | 39 -----------
codes/Qw2229188799/11089611.java | 18 -----
codes/Qw25526/11118523.java | 18 -----
codes/Renswc/15592706.java | 35 ----------
codes/Rudy1113693166/15803796.java | 18 -----
codes/S17673074125/15793739.java | 21 ------
codes/S19353041250/15722104.java | 26 -------
codes/SHALRU/15632282.java | 18 -----
codes/SJq123456/.keep | 0
codes/SJq123456/15846703.java | 19 ------
codes/Sakura125809/15297826.java | 18 -----
codes/Setinsung/.java | 0
codes/Setinsung/9697451.java | 19 ------
codes/ShaoXuan/12173130.java | 20 ------
codes/Sharpery/15562912.java | 18 -----
codes/Shephatiah/18693174.java | 18 -----
codes/SherlockZ/10666019.java | 11 ---
codes/Shirley1/11532521.java | 18 -----
codes/Shirley1/15780774.java | 20 ------
codes/ShowBuger/11475929.java | 19 ------
codes/SmileWen/15629004.java | 27 --------
codes/Snngulaf/15527734.java | 18 -----
codes/Snowfalls360/.keep | 0
codes/Snowfalls360/15843952.java | 19 ------
codes/Springboot/11121747.java | 11 ---
codes/Stonehuara/.keep | 0
codes/Stonehuara/15845722.java | 19 ------
codes/StorIesc/11471295.java | 19 ------
codes/String/11118586.java | 18 -----
codes/TCplcker/11207395.java | 11 ---
codes/TIANGESEC/15563393.java | 18 -----
codes/TJ0000/15529221.java | 24 -------
codes/TPL666/11306800.java | 19 ------
codes/TR9559559555/15866725.java | 11 ---
codes/TV18625742058/15860990.java | 20 ------
codes/TXMQQ4/15716488.java | 19 ------
codes/TYboy2/11228569.java | 20 ------
codes/TheZeroSunset/15775069.java | 26 -------
codes/Tianxuan/11468972.java | 19 ------
codes/Tomimi/18424592.java | 20 ------
codes/Tomorrowed/11451791.java | 11 ---
codes/TonyStark_/15684919.java | 20 ------
codes/Tory666/11472343.java | 19 ------
codes/Tptogiar/10332054.java | 20 ------
codes/UMide9/11292872.java | 19 ------
codes/UOAN29/15805546.java | 18 -----
codes/UsoDtst/.keep | 0
codes/UsoDtst/11120436.java | 19 ------
codes/Vanish/15774749.java | 18 -----
codes/VincentHuang218/11469479.java | 19 ------
codes/W2045396389/15630059.java | 28 --------
codes/W2848330317/15830359.java | 20 ------
codes/W4tcherLock/.keep | 0
codes/W4tcherLock/15847592.java | 19 ------
codes/WML321/15517626.java | 18 -----
codes/WQ18355919568/15742272.java | 35 ----------
codes/W_changing/15829938.java | 17 -----
codes/Weiyi888/.keep | 0
codes/Weiyi888/15720599.java | 20 ------
codes/Whk15038723546/15482712.java | 19 ------
codes/Wiarrara/.keep | 0
codes/Wiarrara/15845136.java | 19 ------
codes/Wilmothe/15592034.java | 35 ----------
codes/Winnie/.keep | 0
codes/Winnie/10042948.java | 11 ---
codes/Wiseung/15774607.java | 21 ------
codes/WpWwangpeng/.keep | 0
codes/WpWwangpeng/10039890.java | 23 -------
codes/Wu18703486053/15850317.java | 18 -----
codes/Wybzshuai/.keep | 0
codes/Wybzshuai/10980502.java | 11 ---
codes/Wyh005116/15858691.java | 18 -----
codes/XHrcool/.keep | 0
codes/XHrcool/15842556.java | 19 ------
codes/XUANAIQ/15635606.java | 18 -----
codes/XUEMAO/15513347.java | 29 --------
codes/XXOPQQ/11202216.java | 22 ------
codes/XiaoBoBo/15528811.java | 18 -----
codes/XiaoYu/15641195.java | 25 -------
codes/Y158505/.keep | 0
codes/Y158505/10040580.java | 23 -------
codes/Y18379639840/15861186.java | 20 ------
codes/Y2602388224/15856296.java | 22 ------
codes/YYDS2023/11094401.java | 18 -----
codes/Yanghw/16081530.java | 21 ------
codes/Yangtzev/15774600.java | 18 -----
codes/Yefori/15536426.java | 29 --------
codes/Yefori/15536527.java | 29 --------
codes/YixinTian/11315888.java | 18 -----
codes/Ys888888/.keep | 0
codes/Ys888888/15780625.java | 11 ---
codes/Yuan10001/15307047.java | 23 -------
codes/Yuan_559/10716235.java | 18 -----
codes/Yy7110829/15834374.java | 19 ------
codes/Z18182089257/15541298.java | 18 -----
codes/Z1831847001/.keep | 0
codes/Z1831847001/10985387.java | 11 ---
codes/Z19849217092/15835445.java | 19 ------
codes/Z3608759124/.keep | 0
codes/Z3608759124/10979186.java | 20 ------
codes/Z3n1th/15536338.java | 19 ------
codes/ZXCV2288/.keep | 0
codes/ZXCV2288/15820903.java | 19 ------
codes/ZYwj4399/.keep | 0
codes/ZYwj4399/15846689.java | 19 ------
codes/ZZH1331065/15816621.java | 20 ------
codes/ZZQeducation/.keep | 0
codes/ZZQeducation/15846342.java | 19 ------
codes/ZeroSunset/15775945.java | 26 -------
codes/ZhangKai/11036581.java | 19 ------
codes/Zhangzy/15657994.java | 19 ------
codes/Zhihua611/.keep | 0
codes/Zhihua611/15840830.java | 19 ------
codes/Zhongjin123/.keep | 0
codes/Zhongjin123/15846007.java | 19 ------
codes/ZianChang/15775142.java | 19 ------
codes/ZoeLeo010/15732573.java | 18 -----
codes/Zoey12138/15846229.java | 21 ------
codes/Ztmanners/.keep | 0
codes/Ztmanners/15844065.java | 19 ------
codes/ZxCvBnM321/15837924.java | 18 -----
codes/a04040404/15774714.java | 26 -------
codes/a1034852656/.keep | 0
codes/a1034852656/10993428.java | 11 ---
codes/a123cwl/15774901.java | 20 ------
codes/a13579/15776164.java | 18 -----
codes/a13919519903/15854734.java | 22 ------
codes/a17537741744/15835967.java | 19 ------
codes/a18342002424/15861602.java | 20 ------
codes/a18352134184/15861238.java | 20 ------
codes/a18370978367/15620229.java | 18 -----
codes/a18377237158/.keep | 0
codes/a18377237158/10978793.java | 11 ---
codes/a18573769257/15857971.java | 18 -----
codes/a19173568702/15849477.java | 18 -----
codes/a2159028620/.keep | 0
codes/a2159028620/10980184.java | 11 ---
codes/a2313064922/15679065.java | 17 -----
codes/a2505934241/15859458.java | 18 -----
codes/a2523760784/9941105.java | 27 --------
codes/a2554028123/.keep | 0
codes/a2554028123/10984030.java | 11 ---
codes/a2565345148/15777154.java | 17 -----
codes/a2565345148/15831524.java | 17 -----
codes/a2667860490/15858891.java | 18 -----
codes/a2942278197/15788264.java | 18 -----
codes/a3681298224/15797237.java | 19 ------
codes/a6765357/15866940.java | 11 ---
codes/a857934324/15786660.java | 17 -----
codes/a940959221/15733763.java | 19 ------
codes/aAuely/15714122.java | 18 -----
codes/a_0650/15775427.java | 28 --------
codes/aa123456789/15808647.java | 11 ---
codes/aaa_zzz/15684144.java | 17 -----
codes/aaajiancai/15816333.java | 20 ------
codes/aamphiprioninae/18302197.java | 19 ------
codes/aas123/15713924.java | 20 ------
codes/aass123/15720115.java | 20 ------
codes/aassdd/15775537.java | 20 ------
codes/abaoge/15684921.java | 17 -----
codes/abaper/.keep | 0
codes/abaper/10978249.java | 18 -----
codes/acc8226/15757227.java | 19 ------
codes/achun123/15779154.java | 18 -----
codes/acloudio/11274672.java | 18 -----
codes/activemy/14206633.java | 28 --------
codes/activity-school | 1 -
codes/adasdas34/.keep | 0
codes/adasdas34/15827500.java | 19 ------
codes/addqian/14612723.java | 24 -------
codes/address/11226902.java | 20 ------
codes/admin228855/10967397.java | 18 -----
codes/adminuser/10040823.java | 18 -----
codes/adsf45362/.keep | 0
codes/adsf45362/15743460.java | 19 ------
codes/af345sdga/.keep | 0
codes/af345sdga/15743439.java | 19 ------
codes/afasfasf24214/.keep | 0
codes/afasfasf24214/15743480.java | 19 ------
codes/afssaffc774/.keep | 0
codes/afssaffc774/15831351.java | 19 ------
codes/aikun66/15577937.java | 18 -----
codes/airgege/.keep | 0
codes/airgege/15850162.java | 20 ------
codes/aiyowei12366/.keep | 0
codes/aiyowei12366/15798748.java | 19 ------
codes/alchemists/.keep | 0
codes/alchemists/15772130.java | 20 ------
codes/alleylyf666/.keep | 0
codes/alleylyf666/15844554.java | 19 ------
codes/amoxilin/15519580.java | 12 ----
codes/an629712562/.keep | 0
codes/an629712562/15629207.java | 20 ------
codes/andng00/.keep | 0
codes/andng00/15836934.java | 20 ------
codes/angel521/15721117.java | 19 ------
codes/anqi12301/15532075.java | 18 -----
codes/aqbodc/15816413.java | 18 -----
codes/argument/11235878.java | 18 -----
codes/aria111/.keep | 0
codes/aria111/10043458.java | 11 ---
codes/arvinsblog/15525225.java | 19 ------
codes/as1234567890/.keep | 0
codes/as1234567890/10979740.java | 11 ---
codes/asdafcv22/.keep | 0
codes/asdafcv22/15742508.java | 19 ------
codes/asen_1898/15541357.java | 35 ----------
codes/asf1afasd4/.keep | 0
codes/asf1afasd4/15831471.java | 19 ------
codes/asf424524sa/.keep | 0
codes/asf424524sa/15830408.java | 19 ------
codes/asf435adf/.keep | 0
codes/asf435adf/15743462.java | 19 ------
codes/asfafas8931/.keep | 0
codes/asfafas8931/15831378.java | 19 ------
codes/asfasc228/.keep | 0
codes/asfasc228/15831133.java | 19 ------
codes/asfasfa22/.keep | 0
codes/asfasfa22/15742636.java | 19 ------
codes/asfasfa22/15864908.java | 19 ------
codes/asffasf67/.keep | 0
codes/asffasf67/15743465.java | 19 ------
codes/asffsac224/.keep | 0
codes/asffsac224/15831080.java | 19 ------
codes/asfsafaf223/.keep | 0
codes/asfsafaf223/15743410.java | 19 ------
codes/asfsyw34124/.keep | 0
codes/asfsyw34124/15830756.java | 19 ------
codes/aurorawhite/15775954.java | 27 --------
codes/aurorawhite03/15831384.java | 27 --------
codes/aurorawhite04/15837015.java | 27 --------
codes/avania/14344405.java | 18 -----
codes/aweige/.keep | 0
codes/aweige/15855036.java | 20 ------
codes/azhen666/15569325.java | 20 ------
codes/b1t333/12428176.java | 36 ----------
codes/b2247960736/15520708.java | 17 -----
codes/bIU999lve/.keep | 0
codes/bIU999lve/11090549.java | 23 -------
codes/babala/15779520.java | 27 --------
codes/babale/15775745.java | 20 ------
codes/baiwenyu/.15781013.java.swp | Bin 12288 -> 0 bytes
codes/baiwenyu/15781013.java | 28 --------
codes/baixiaobai/15198492.java | 20 ------
codes/baixiaobai/15198733.java | 20 ------
codes/baixiaobai/15198745.java | 20 ------
codes/baixiaobai/15199487.java | 20 ------
codes/banlala/15846317.java | 20 ------
codes/baozhang/.keep | 0
codes/baozhang/15860610.java | 20 ------
codes/bbb222/.keep | 0
codes/bbb222/15831163.java | 20 ------
codes/bbswangzhs/.keep | 0
codes/bbswangzhs/15844812.java | 19 ------
codes/bc521bc/9954342.java | 20 ------
codes/bc99991/11118867.java | 18 -----
codes/beaker123/15831015.java | 29 --------
codes/beaker1234/15831394.java | 29 --------
codes/bei123/15714125.java | 20 ------
codes/beibeiya/15775215.java | 20 ------
codes/beiyang/.keep | 0
codes/beiyang/15851229.java | 20 ------
codes/benben/15721436.java | 20 ------
codes/bertao/11204465.java | 19 ------
codes/bic-omg/.keep | 0
codes/bic-omg/10972075.java | 11 ---
codes/biechigege/18629854.java | 20 ------
codes/biechigege/18653461.java | 19 ------
codes/bigDog/11298506.java | 20 ------
codes/bitexplorers/.keep | 0
codes/bitexplorers/15774316.java | 20 ------
codes/bjfuhyk26/15775960.java | 18 -----
codes/blackgaryc/14345942.java | 19 ------
codes/bless_qian/15628082.java | 18 -----
codes/blingpotato/15623762.java | 18 -----
codes/blockup/15585762.java | 18 -----
codes/bmyy111/15635777.java | 19 ------
codes/book123/15699999.java | 20 ------
codes/bopiox/11219150.java | 18 -----
codes/bowen123456/.keep | 0
codes/bowen123456/15815214.java | 19 ------
codes/buaa562/15843584.java | 19 ------
codes/budasan/11121691.java | 19 ------
codes/buffoZipper/.keep | 0
codes/buffoZipper/15842330.java | 19 ------
codes/buhuiruner/.keep | 0
codes/buhuiruner/15842260.java | 19 ------
codes/buhuizhiyuqianduan/11245496.java | 18 -----
codes/bujin521/11301842.java | 19 ------
codes/bundle/11196164.java | 17 -----
codes/bupiovm0101/11122657.java | 22 ------
codes/bushioo/11276443.java | 22 ------
codes/buzhidao/11118686.java | 21 ------
codes/bzy-080408/18668050.java | 19 ------
codes/c1444444444/15811953.java | 19 ------
codes/c1484941716/15859323.java | 18 -----
codes/ca3130049622/15790269.java | 17 -----
codes/cai0002/15520914.java | 18 -----
codes/cai001/15520883.java | 18 -----
codes/caishen/.keep | 0
codes/caishen/15856729.java | 20 ------
codes/caiyanghong/15835895.java | 35 ----------
codes/caizengming/15396209.java | 21 ------
codes/caozhou/10869186.java | 11 ---
codes/captaining/15614511.java | 18 -----
codes/carino5555/15527193.java | 18 -----
codes/caroline/15374117.java | 20 ------
codes/cccqqq/.keep | 0
codes/cccqqq/10039861.java | 17 -----
codes/ccone123/15713748.java | 19 ------
codes/ccout0/12264632.java | 22 ------
codes/cenm00/15829376.java | 17 -----
codes/ceshi001/.keep | 0
codes/ceshi001/9637800.java | 22 ------
codes/cghg547546/.keep | 0
codes/cghg547546/15743428.java | 19 ------
codes/changgeng/16563760.java | 18 -----
codes/chanziruu/.keep | 0
codes/chanziruu/10042211.java | 11 ---
codes/chase11/15577508.java | 18 -----
codes/chenabing/15724269.java | 13 ----
codes/chenchen1234/15630722.java | 20 ------
codes/chency/15542287.java | 17 -----
codes/chengchen/10039151.java | 18 -----
codes/chengqi/.keep | 0
codes/chengqi/15845978.java | 20 ------
codes/chengzhi/11005917.java | 17 -----
codes/chenhan1129/15542140.java | 21 ------
codes/chenqiuyun/15860178.java | 35 ----------
codes/chenwy/15816299.java | 19 ------
codes/chenyongru/.keep | 0
codes/chenyongru/15764377.java | 20 ------
codes/chenyunhao/15874841.java | 35 ----------
codes/chenzhongyao/15851007.java | 35 ----------
codes/cherryaini/.keep | 0
codes/cherryaini/15838357.java | 19 ------
codes/cherrypocky/15837631.java | 11 ---
codes/chnechenya/15815769.java | 20 ------
codes/chris2024/15600397.java | 19 ------
codes/chuyuxuan/15685256.java | 19 ------
codes/cieasefires/.keep | 0
codes/cieasefires/15844532.java | 19 ------
codes/ckx1234/15830693.java | 18 -----
codes/ckx17837725358/15859776.java | 18 -----
codes/clausliang/11466217.java | 20 ------
codes/cloudchasers/.keep | 0
codes/cloudchasers/15772624.java | 20 ------
codes/cly2589/15577808.java | 18 -----
codes/cmosinverter/15780363.java | 28 --------
codes/coco08/11244510.java | 22 ------
codes/codeelite/.keep | 0
codes/codeelite/15774516.java | 20 ------
codes/codemovers/.keep | 0
codes/codemovers/15776343.java | 20 ------
codes/codeshallow/.java | 0
codes/codeshallow/9947400.java | 19 ------
codes/comTom/10859102.java | 11 ---
codes/comefly/16334983.java | 11 ---
codes/conanz/.keep | 0
codes/conanz/10041693.java | 11 ---
codes/coo6666/11212756.java | 11 ---
codes/coolbob/11342463.java | 20 ------
codes/coreliu/9889405.java | 17 -----
codes/coshpr/18429589.java | 18 -----
codes/course/15530455.java | 19 ------
codes/cppdkuo/11329887.java | 19 ------
codes/cr12345/.keep | 0
codes/cr12345/10985032.java | 12 ----
codes/craftsmen/.keep | 0
codes/craftsmen/15775673.java | 20 ------
codes/credit/15777503.java | 26 -------
codes/crh111/15562582.java | 18 -----
codes/cslearn/10428388.java | 21 ------
codes/cstzt6/15454369.java | 13 ----
codes/cstzt6/16340693.java | 13 ----
codes/cumtsgw/.15377867.java.swp | Bin 12288 -> 0 bytes
codes/cumtsgw/15377867.java | 18 -----
codes/current/11226352.java | 20 ------
codes/cursor/.java | 0
codes/cursor/13859449.java | 33 ---------
codes/cwt1216/15777958.java | 28 --------
codes/cxy11/15898495.java | 12 ----
codes/cxy2801439718/15898495.java | 12 ----
codes/cyanide/15311596.java | 11 ---
codes/cybernexuss/.keep | 0
codes/cybernexuss/15776044.java | 20 ------
codes/cyberwarriors/.keep | 0
codes/cyberwarriors/15771923.java | 20 ------
codes/cyc991026/.keep | 0
codes/cyc991026/10042475.java | 11 ---
codes/cyqlxxy/15777955.java | 19 ------
codes/cyrusyu/11179070.java | 19 ------
codes/dabing/.keep | 0
codes/dabing/15831131.java | 20 ------
codes/daisyw0221/15531109.java | 20 ------
codes/damingya/15777770.java | 20 ------
codes/dappwwww/10999016.java | 27 --------
codes/darkfu/15693973.java | 17 -----
codes/dasdasd2341/.keep | 0
codes/dasdasd2341/15743468.java | 19 ------
codes/dasdasd2341/15799082.java | 19 ------
codes/dashengfa/15837719.java | 18 -----
codes/datacubes/.keep | 0
codes/datacubes/15775733.java | 20 ------
codes/datudou/15775955.java | 20 ------
codes/dawnli/15533387.java | 18 -----
codes/daxiong/.keep | 0
codes/daxiong/15846450.java | 20 ------
codes/dayeee/12165634.java | 18 -----
codes/dayuya/10044865.java | 19 ------
codes/ddi123456/15775627.java | 18 -----
codes/ddl667/.keep | 0
codes/ddl667/15814859.java | 19 ------
codes/deCoder2024/.keep | 0
codes/deCoder2024/15847492.java | 19 ------
codes/deaita/.keep | 0
codes/deaita/15845569.java | 20 ------
codes/dedeya/15742795.java | 20 ------
codes/deijia909/11468750.java | 19 ------
codes/dekali/.keep | 0
codes/dekali/15845962.java | 20 ------
codes/denghaodongmy123/.keep | 0
codes/denghaodongmy123/15838830.java | 19 ------
codes/devinroot/9687540.java | 24 -------
codes/df452aff/.keep | 0
codes/df452aff/15831296.java | 19 ------
codes/dfg56tsdfas/.keep | 0
codes/dfg56tsdfas/15743482.java | 19 ------
codes/dfghrtdfgge5/.keep | 0
codes/dfghrtdfgge5/15828963.java | 19 ------
codes/dgq420377903/.keep | 0
codes/dgq420377903/15776080.java | 18 -----
codes/diantun00/13629189.java | 18 -----
codes/dioopp/11292585.java | 11 ---
codes/disaner/.keep | 0
codes/disaner/15798333.java | 20 ------
codes/dishierge/.keep | 0
codes/dishierge/15758829.java | 20 ------
codes/dishige/.keep | 0
codes/dishige/15758406.java | 20 ------
codes/dishijiuge/.keep | 0
codes/dishijiuge/15759226.java | 20 ------
codes/dishiliuge/.keep | 0
codes/dishiliuge/15759149.java | 20 ------
codes/dishiqige/.keep | 0
codes/dishiqige/15759140.java | 20 ------
codes/dishisi/.keep | 0
codes/dishisi/15758975.java | 20 ------
codes/dishissange/.keep | 0
codes/dishissange/15759022.java | 20 ------
codes/dishiwuge/.keep | 0
codes/dishiwuge/15759050.java | 20 ------
codes/dist11/15779201.java | 17 -----
codes/dist22/15779370.java | 17 -----
codes/dist33/15779447.java | 17 -----
codes/dist55/15779566.java | 17 -----
codes/dist66/15782518.java | 17 -----
codes/dist77/15782715.java | 17 -----
codes/dist88/15782777.java | 17 -----
codes/dist99/15782896.java | 17 -----
codes/diudiuge12262792/15499955.java | 26 -------
codes/dkptlv/15520718.java | 19 ------
codes/dmw681/16541740.java | 20 ------
codes/dogepalm/.keep | 0
codes/dogepalm/15845073.java | 19 ------
codes/downsider/.keep | 0
codes/downsider/15814998.java | 19 ------
codes/dragg123/15718958.java | 20 ------
codes/dragonir/11357510.java | 22 ------
codes/dsfggsd445/.keep | 0
codes/dsfggsd445/15828546.java | 19 ------
codes/dsfsqerada33/.keep | 0
codes/dsfsqerada33/15743351.java | 19 ------
codes/duanshusheng/15508667.java | 17 -----
codes/duanxintao/15684621.java | 22 ------
codes/duixiang/.keep | 0
codes/duixiang/15814647.java | 20 ------
codes/dulong/11749087.java | 21 ------
codes/dundun/15861800.java | 20 ------
codes/duoduo172/15759065.java | 20 ------
codes/duzidundun/15860749.java | 20 ------
codes/duziteng/10968772.java | 11 ---
codes/dxr13146640122/15867024.java | 11 ---
codes/dxy18882636878/15829939.java | 11 ---
codes/ebb29bbe/9945255.java | 19 ------
codes/educ157441/.keep | 0
codes/educ157441/15842827.java | 19 ------
codes/ee858882845/15848149.java | 18 -----
codes/eedd22/15875744.java | 20 ------
codes/ekdher/11188020.java | 20 ------
codes/ekwwu1/11122460.java | 20 ------
codes/enRENE1/11005023.java | 11 ---
codes/enkilee/15372338.java | 18 -----
codes/enoughisenough/11364587.java | 18 -----
codes/ergeren/.keep | 0
codes/ergeren/15799133.java | 20 ------
codes/ericxu/16282084.java | 21 ------
codes/ewrt3425sdfs/.keep | 0
codes/ewrt3425sdfs/15831329.java | 19 ------
codes/express77/15513152.java | 19 ------
codes/ezh3wx95/11002373.java | 17 -----
codes/f13306939842/.keep | 0
codes/f13306939842/10968297.java | 11 ---
codes/f18967940562/.keep | 0
codes/f18967940562/10972030.java | 11 ---
codes/f19555076671/15837167.java | 18 -----
codes/f370857894/.keep | 0
codes/f370857894/10970517.java | 11 ---
codes/f435wedt/.keep | 0
codes/f435wedt/15743453.java | 19 ------
codes/f456af67654/.keep | 0
codes/f456af67654/15743470.java | 19 ------
codes/f734tasaf/.keep | 0
codes/f734tasaf/15743456.java | 19 ------
codes/fangfangha/15775625.java | 20 ------
codes/fanghua/.keep | 0
codes/fanghua/10971642.java | 11 ---
codes/fangqb/.keep | 0
codes/fangqb/10043498.java | 11 ---
codes/fangying1/.keep | 0
codes/fangying1/10968297.java | 11 ---
codes/fasfaf227/.keep | 0
codes/fasfaf227/15820189.java | 19 ------
codes/fasfasfas234/.keep | 0
codes/fasfasfas234/15743358/15743358.java | 19 ------
codes/fasfasfas234/15830971.java | 19 ------
codes/fasfsa2412/.keep | 0
codes/fasfsa2412/15743474.java | 19 ------
codes/fasfsaf292/.keep | 0
codes/fasfsaf292/15743418.java | 19 ------
codes/fasfsf2442/.keep | 0
codes/fasfsf2442/15831391.java | 19 ------
codes/fasioc924/.keep | 0
codes/fasioc924/15743426.java | 19 ------
codes/fasttiger/10143432.java | 23 -------
codes/fcc321/15630159.java | 18 -----
codes/feifeixi/15846547.java | 20 ------
codes/feihudui/.keep | 0
codes/feihudui/15846656.java | 20 ------
codes/feipao/11252573.java | 19 ------
codes/feiya123/15719128.java | 20 ------
codes/fendou/15635967.java | 17 -----
codes/feng666/15777226.java | 18 -----
codes/fengling/15838545.java | 18 -----
codes/fengshang/15510907.java | 17 -----
codes/fengshang/fengshang/15510907.java | 17 -----
codes/fengyeorz/15629835.java | 26 -------
codes/fengyu176/15759028.java | 20 ------
codes/fhbb111/15605446.java | 19 ------
codes/fhkjhkl876/.keep | 0
codes/fhkjhkl876/15743332.java | 19 ------
codes/fhl3yue/15692389.java | 19 ------
codes/fhvz199/15759040.java | 20 ------
codes/fitzge/.keep | 0
codes/fitzge/15867203.java | 20 ------
codes/flutter/11187840.java | 18 -----
codes/fofone/15772455.java | 20 ------
codes/forz4ever/18245446.java | 21 ------
codes/fosmos/10385999.java | 12 ----
codes/fq18552765314/.keep | 0
codes/fq18552765314/10972612.java | 11 ---
codes/franki_lxsq/9958657.java | 18 -----
codes/freeliujian/11351490.java | 18 -----
codes/friklogff/15528029.java | 19 ------
codes/fsa722/.keep | 0
codes/fsa722/15742665.java | 19 ------
codes/fsafacc232/.keep | 0
codes/fsafacc232/15743001.java | 19 ------
codes/fsafas8979812/.keep | 0
codes/fsafas8979812/15831387.java | 19 ------
codes/fsafsa234/.keep | 0
codes/fsafsa234/15831509.java | 19 ------
codes/fsafsc2132/.keep | 0
codes/fsafsc2132/15831373.java | 19 ------
codes/fsdf435sdf/.keep | 0
codes/fsdf435sdf/15743405.java | 19 ------
codes/fsdfsdfh32/.keep | 0
codes/fsdfsdfh32/15827710.java | 19 ------
codes/fsk1234/15790091.java | 20 ------
codes/fubing3/.keep | 0
codes/fubing3/9619048.java | 11 ---
codes/fuzhong/10967384.java | 19 ------
codes/fuzio35/16199622.java | 12 ----
codes/fx18902464802/.keep | 0
codes/fx18902464802/10971972.java | 11 ---
codes/fy13073414213/.keep | 0
codes/fy13073414213/10972162.java | 11 ---
codes/fyt345sdfgsd/.keep | 0
codes/fyt345sdfgsd/15743397.java | 19 ------
codes/gaoxinjmj/.keep | 0
codes/gaoxinjmj/15759215.java | 20 ------
codes/gddclct/15959388.java | 21 ------
codes/gedeshidai/15539757.java | 19 ------
codes/genghai/.keep | 0
codes/genghai/15831364.java | 20 ------
codes/gflu777/15508845.java | 19 ------
codes/ghdfg3452/.keep | 0
codes/ghdfg3452/15743429.java | 19 ------
codes/gin-lsl/11448781.java | 18 -----
codes/giooter/.keep | 0
codes/giooter/15773918.java | 18 -----
codes/gobuster/15555259.java | 19 ------
codes/godawang/.keep | 0
codes/godawang/15764594.java | 20 ------
codes/godgod/15775680.java | 20 ------
codes/godofkingsdonw6/.keep | 0
codes/godofkingsdonw6/15815850.java | 19 ------
codes/gogomo/.keep | 0
codes/gogomo/15865953.java | 20 ------
codes/goodstudymyx/.keep | 0
codes/goodstudymyx/15846322.java | 19 ------
codes/gotchar/15775671.java | 18 -----
codes/gqhomegitee/.keep | 0
codes/gqhomegitee/15846699.java | 19 ------
codes/grfewryhh55/.keep | 0
codes/grfewryhh55/15828725.java | 19 ------
codes/gsdrt657/.keep | 0
codes/gsdrt657/15831411.java | 19 ------
codes/gtuwer64/.keep | 0
codes/gtuwer64/15828885.java | 19 ------
codes/guagua123/15620667.java | 18 -----
codes/guanghua/.keep | 0
codes/guanghua/15756054.java | 19 ------
codes/guanghua/15772570.java | 19 ------
codes/guanghua/15819545.java | 19 ------
codes/guanghua/15820837.java | 20 ------
codes/guanj123/15699820.java | 20 ------
codes/gufengxiao/15851937.java | 35 ----------
codes/gugulogs/15521175.java | 13 ----
codes/guhhzz/15835674.java | 19 ------
codes/gui8989/11228793.java | 19 ------
codes/gujian3724/15541800.java | 17 -----
codes/gunange/.keep | 0
codes/gunange/15846499.java | 20 ------
codes/guoguoya/15742850.java | 20 ------
codes/gwya123/15699461.java | 20 ------
codes/h178414/.keep | 0
codes/h178414/15842656.java | 19 ------
codes/h295276/15685251.java | 18 -----
codes/h4ppyguys/.keep | 0
codes/h4ppyguys/15843449.java | 19 ------
codes/h891539721/15718815.java | 18 -----
codes/h915754289/15853542.java | 22 ------
codes/haha176/15759089.java | 20 ------
codes/hahalin/15846388.java | 20 ------
codes/hahane/15772179.java | 20 ------
codes/haihai/.keep | 0
codes/haihai/15860309.java | 20 ------
codes/handleRich/11471812.java | 19 ------
codes/handsonboards/.keep | 0
codes/handsonboards/15841143.java | 19 ------
codes/haohua/.keep | 0
codes/haohua/15830974.java | 20 ------
codes/haoranx98/.keep | 0
codes/haoranx98/10039365.java | 17 -----
codes/happymo/11212155.java | 18 -----
codes/hatjs880328/.keep | 0
codes/hatjs880328/15779413.java | 18 -----
codes/hclw_123/15865557.java | 17 -----
codes/hdhd13726801083/15811090.java | 19 ------
codes/heheer/9674738.java | 22 ------
codes/heiheiya/15775428.java | 20 ------
codes/heiopx/11121859.java | 11 ---
codes/helens0813/15861403.java | 20 ------
codes/helloAnhusts/.keep | 0
codes/helloAnhusts/15846366.java | 19 ------
codes/helloY_Y/15644488.java | 19 ------
codes/heshu1/15640537.java | 18 -----
codes/hfghst45645d/.keep | 0
codes/hfghst45645d/15831264.java | 19 ------
codes/hh456123/15721443.java | 19 ------
codes/hhhh2160350883/15855109.java | 22 ------
codes/hhj123/15639946.java | 18 -----
codes/hhmdsb/15837956.java | 18 -----
codes/hjh13525117665/15856794.java | 18 -----
codes/hlsscoder/15606370.java | 20 ------
codes/hly123/.keep | 0
codes/hly123/10984210.java | 11 ---
codes/hly252984658/.keep | 0
codes/hly252984658/10979977.java | 11 ---
codes/hnn111/15577556.java | 18 -----
codes/honghongwa/15846459.java | 20 ------
codes/hongshen/.keep | 0
codes/hongshen/10039145.java | 21 ------
codes/hongxia/15876230.java | 26 -------
codes/hongyaya/15683533.java | 20 ------
codes/hongyu551600/15868757.java | 11 ---
codes/hopekai/15586507.java | 35 ----------
codes/houhouya/15778311.java | 20 ------
codes/hua0x522/10375834.java | 20 ------
codes/huaano/15772611.java | 20 ------
codes/hualine/15772389.java | 20 ------
codes/huang856/.keep | 0
codes/huang856/10982875.java | 11 ---
codes/huangduoyan2024/.I94UY3.java.swp | Bin 12288 -> 0 bytes
codes/huangduoyan2024/15343275.java | 12 ----
codes/huangwenli666/15867725.java | 11 ---
codes/huangxiaoyan/10971566.java | 18 -----
codes/huangzi/.keep | 0
codes/huangzi/15867961.java | 20 ------
codes/huanji1212/.keep | 0
codes/huanji1212/15860624.java | 20 ------
codes/huanjiyan/15607160.java | 35 ----------
codes/huankuai/.java | 0
codes/huankuai/9962039.java | 20 ------
codes/huliangsheng/.keep | 0
codes/huliangsheng/15759181.java | 20 ------
codes/hunking/.keep | 0
codes/hunking/15845445.java | 20 ------
codes/hunzita/.keep | 0
codes/hunzita/15850843.java | 20 ------
codes/huoyin/15864042.java | 35 ----------
codes/huqi88/15222808.java | 20 ------
codes/hyk111/15779480.java | 18 -----
codes/hyk222/15829718.java | 18 -----
codes/hzhong/15527208.java | 18 -----
codes/iHento/15964827.java | 18 -----
codes/iHento/15965308.java | 19 ------
codes/idealismer/15406184.java | 26 -------
codes/ignoreme/11207270.java | 11 ---
codes/ikzsm77/15613401.java | 18 -----
codes/ilove360/9937750.java | 27 --------
codes/imyunbiao/14371419.java | 18 -----
codes/includebits/.15775863.java.swp | Bin 12288 -> 0 bytes
codes/includebits/15775863.java | 18 -----
codes/interceptors/11148333.java | 11 ---
codes/ivan886/15517024.java | 18 -----
codes/jack250/15895412.java | 18 -----
codes/jacksoftware/15864608.java | 20 ------
codes/jackson0007/.keep | 0
codes/jackson0007/15846232.java | 20 ------
codes/jacksonstack/15157304.java | 32 ---------
codes/jakobz/18423069.java | 18 -----
codes/java0111/15636073.java | 19 ------
codes/jayjay/9955470.java | 20 ------
codes/jbace2/.keep | 0
codes/jbace2/10041152.java | 23 -------
codes/jerrywang/.keep | 0
codes/jerrywang/10972482.java | 18 -----
codes/jerrywang/10972482.java] | 0
codes/jerrywang1982/15623035.java | 21 ------
codes/jggttcd55/.keep | 0
codes/jggttcd55/15828240.java | 19 ------
codes/jgjfvj767/.keep | 0
codes/jgjfvj767/15743251.java | 19 ------
codes/jiacheng/.keep | 0
codes/jiacheng/15830646.java | 20 ------
codes/jiacheng02/.keep | 0
codes/jiacheng02/15830816.java | 20 ------
codes/jianghao/15366705.java | 18 -----
codes/jiasrt/15781311.java | 28 --------
codes/jiayinzinc/.keep | 0
codes/jiayinzinc/15845797.java | 19 ------
codes/jichen/12429463.java | 18 -----
codes/jideliy89mxp/10942446.java | 24 -------
codes/jieming/.keep | 0
codes/jieming/15831124.java | 20 ------
codes/jijing/.keep | 0
codes/jijing/15866624.java | 20 ------
codes/jingge15116238811/10969429.java | 18 -----
codes/jingqing3948/15533535.java | 21 ------
codes/jinguo/15825503.java | 19 ------
codes/jinjin1234567/15628228.java | 18 -----
codes/jinpeng/.keep | 0
codes/jinpeng/15794435.java | 20 ------
codes/jinshi/.keep | 0
codes/jinshi/15846626.java | 20 ------
codes/jinxin177/15759096.java | 20 ------
codes/jinya123/15684545.java | 20 ------
codes/jinyuan/.keep | 0
codes/jinyuan/15867508.java | 20 ------
codes/jiucai131/11476990.java | 11 ---
codes/jiujiu/15555981.java | 21 ------
codes/jiujiuhaizi/.keep | 0
codes/jiujiuhaizi/10972159.java | 20 ------
codes/jj625625/15742603.java | 19 ------
codes/jkgao007/10515263.java | 23 -------
codes/jkxllj/15631418.java | 19 ------
codes/jmdajiang/.keep | 0
codes/jmdajiang/15764743.java | 20 ------
codes/jokemanfire/11650604.java | 13 ----
codes/jony2258/15804822.java | 18 -----
codes/joohwan/16200342.java | 18 -----
codes/jpq110/.java | 0
codes/jpq110/15848383.java | 11 ---
codes/juanmaola/15776278.java | 26 -------
codes/juking/10340196.java | 19 ------
codes/jyz1092752421/15867277.java | 11 ---
codes/k8scat/11864664.java | 12 ----
codes/kaiSYJ/15488956.java | 28 --------
codes/kaiSYJ/15589878.java | 18 -----
codes/kakki1003/18431839.java | 19 ------
codes/kangwang/11615067.java | 20 ------
codes/kankanha/15775398.java | 20 ------
codes/kankanya/15772087.java | 20 ------
codes/katooo/11209021.java | 19 ------
codes/kekene/15777867.java | 20 ------
codes/kikiya/15846231.java | 20 ------
codes/kingzhuo666/.keep | 0
codes/kingzhuo666/15846704.java | 19 ------
codes/kira11535/15774608.java | 20 ------
codes/kkya123/15722815.java | 20 ------
codes/knight9dog/.keep | 0
codes/knight9dog/15845028.java | 19 ------
codes/kongbaige/.keep | 0
codes/kongbaige/15845868.java | 20 ------
codes/konglingdi/9696377.java | 20 ------
codes/kongshang/15699583.java | 31 ---------
codes/kongshang/15699673.java | 32 ---------
codes/kongshang/15700235.java | 31 ---------
codes/kristira/15804034.java | 18 -----
codes/kukuku123/.15650271.java.swp | Bin 12288 -> 0 bytes
codes/kukuku123/15650271.java | 24 -------
codes/kunleya/15775724.java | 20 ------
codes/kunzhi/.keep | 0
codes/kunzhi/15606505.java | 19 ------
codes/kuqiu123/15585804.java | 18 -----
codes/kyi667gfhg/.keep | 0
codes/kyi667gfhg/15831315.java | 19 ------
codes/l1017026323/15630469.java | 20 ------
codes/l15872381947/15962935.java | 13 ----
codes/l18877577615/15776334.java | 19 ------
codes/l2746415679/15850006.java | 18 -----
codes/l3112624513/15836906.java | 18 -----
codes/l5211314/15854497.java | 22 ------
codes/lailailai/11211174.java | 18 -----
codes/lala12/15700256.java | 20 ------
codes/lambdang/11472883.java | 19 ------
codes/lan0bo/11297643.java | 22 ------
codes/lanlan/11115524.java | 18 -----
codes/lanlanya/15684957.java | 20 ------
codes/laomocy/.keep | 0
codes/laomocy/15768870.java | 20 ------
codes/laoshifu/15520696.java | 17 -----
codes/last123/15721253.java | 20 ------
codes/lbhusvkfj/15582699.java | 18 -----
codes/lc12345678/15853848.java | 22 ------
codes/lee001/15817464.java | 20 ------
codes/legary/18735642.java | 18 -----
codes/leikaiya/15772650.java | 20 ------
codes/leikaya/15772650.java | 20 ------
codes/leitongjiang2/.keep | 0
codes/leitongjiang2/15757898 | 20 ------
codes/leitongjiang2/15757898.java | 20 ------
codes/lelewa/15846345.java | 20 ------
codes/leoaeon/15620248.java | 19 ------
codes/leshan/.keep | 0
codes/leshan/15799241.java | 20 ------
codes/levi123/15859682.java | 18 -----
codes/lgy1584899472/15607389.java | 35 ----------
codes/lh775123/.keep | 0
codes/lh775123/15815281.java | 19 ------
codes/lhcoder/15630391.java | 20 ------
codes/lhtcn/.keep | 0
codes/lhtscavc/.keep | 0
codes/lhtscavc/15710834.java | 18 -----
codes/lhzs123/15684690.java | 20 ------
codes/li781117/15518855.java | 18 -----
codes/liaojiji/15699956.java | 19 ------
codes/liaoxinghai/15778644.java | 11 ---
codes/lideshengdsb/15545860.java | 19 ------
codes/lidongshi/10229157.java | 18 -----
codes/lienbj/18149367.java | 19 ------
codes/lige123/.keep | 0
codes/lige123/15798937.java | 20 ------
codes/lihai18898/15807887.java | 19 ------
codes/lihaoran887/.keep | 0
codes/lihaoran887/15815869.java | 19 ------
codes/lihuizhe666/15774599.java | 17 -----
codes/lili183/15775952.java | 26 -------
codes/linchong/9954468.java | 19 ------
codes/linliangdong/.keep | 0
codes/linliangdong/15764880.java | 20 ------
codes/linling0421/.keep | 0
codes/linling0421/10979563.java | 12 ----
codes/linlingEdu/.keep | 0
codes/linlingEdu/15815233.java | 19 ------
codes/liquor/11292981.java | 11 ---
codes/lishugood1/.keep | 0
codes/lishugood1/15846106.java | 19 ------
codes/lisonghao/15710966.java | 18 -----
codes/liuYanFen/15720723.java | 19 ------
codes/liu_chen_yang/15629230.java | 22 ------
codes/liugela/.keep | 0
codes/liugela/15756309.java | 20 ------
codes/liuguanghui/15875503.java | 35 ----------
codes/liuguangsen0409/15717549.java | 17 -----
codes/liujiayi/10517239.java | 18 -----
codes/liujin_long/15778303.java | 19 ------
codes/liulink/15774650.java | 18 -----
codes/liuyctt12/15630469.java | 20 ------
codes/liuyiyi/15714289.java | 20 ------
codes/liuyupeng999/.keep | 0
codes/liuyupeng999/15845114.java | 19 ------
codes/liuyuxuan666/.keep | 0
codes/liuyuxuan666/15815202.java | 19 ------
codes/liwei2496/11466656.java | 18 -----
codes/lixiang1996/15516370.java | 17 -----
codes/liyanfen/15875628.java | 35 ----------
codes/liyanfen1/15607550.java | 35 ----------
codes/liyanyan/15864049.java | 35 ----------
codes/liyou041/15836638.java | 18 -----
.../\345\244\215\345\210\266\347\232\204" | 18 -----
codes/lj18263537279/.keep | 0
codes/lj18263537279/10972375.java | 11 ---
codes/ljc13512881480/15775859.java | 21 ------
codes/ll13174074984/.keep | 0
codes/ll13174074984/10972293.java | 11 ---
codes/ll13808780223/15790801.java | 19 ------
codes/lmc666/15632201.java | 19 ------
codes/lodyn123/15488861.java | 14 ----
codes/logic111/.keep | 0
codes/logic111/15819546.java | 20 ------
codes/lolitot/.keep | 0
codes/lolitot/10040248.java | 23 -------
codes/long22/11031968.java | 21 ------
codes/long93/15676797.java | 23 -------
codes/longquefeng/15835894.java | 35 ----------
codes/longxiqwe1/.keep | 0
codes/longxiqwe1/15842971.java | 19 ------
codes/longxixi/18735649.java | 30 --------
codes/loveer/15720497.java | 20 ------
codes/lovemeatsss/.keep | 0
codes/lovemeatsss/15841023.java | 19 ------
codes/loveta1/15852677.java | 22 ------
codes/lovewang/11307245.java | 18 -----
codes/lovingcode3/.keep | 0
codes/lovingcode3/15844469.java | 19 ------
codes/lovscene/11290992.java | 18 -----
codes/lsl990410/15777331.java | 18 -----
codes/lsmir2/13427738.java | 41 -----------
codes/lsnjxkw634/15836665.java | 19 ------
codes/lsnjxkw635/15847008.java | 18 -----
codes/ltq0319/15757963.java | 28 --------
codes/luo111/15754678.java | 18 -----
codes/luogege/15634607.java | 20 ------
codes/luoluo123/15634481.java | 20 ------
codes/luowei/15609646.java | 19 ------
codes/luox12/15700214.java | 20 ------
codes/luv3704/15810371.java | 19 ------
codes/luzhanheng2023/12213445.java | 18 -----
codes/lvbin2/.keep | 0
codes/lvbin2/15758178.java | 20 ------
codes/lvlv123/15693242.java | 19 ------
codes/lvrui233/15855727.java | 35 ----------
codes/lvxl111/15528312.java | 18 -----
codes/lx1122334/12138905.java | 18 -----
codes/lx13579/15807637.java | 11 ---
codes/lxnb666/14201242.java | 19 ------
codes/lxsq1905951174/15775065.java | 20 ------
codes/ly614155/15775591.java | 26 -------
codes/lynlon/12376594.java | 19 ------
codes/lyx123123/15775949.java | 22 ------
codes/lyxgitee1/.keep | 0
codes/lyxgitee1/15815289.java | 19 ------
codes/lzf1123/15542355.java | 35 ----------
codes/lzr565520/15742467.java | 19 ------
codes/m88888686/11201957.java | 22 ------
codes/ma17533610893/15816305.java | 18 -----
codes/ma_yin/15529443.java | 19 ------
codes/mabofu/10606075.java | 25 -------
codes/macw_379/15655907.java | 18 -----
codes/mafuqiang/10166179.java | 21 ------
codes/mahaoliang/15538747.java | 17 -----
codes/mahaoliang/15540967.java | 17 -----
codes/maisaki/15487137.java | 20 ------
codes/maiswemlilo1/11241067.java | 18 -----
codes/manbaoutsi/.keep | 0
codes/manbaoutsi/15845869.java | 19 ------
codes/manyuemei/15869904.java | 11 ---
codes/maqingshan123/15622329.java | 18 -----
codes/matrixHall/.keep | 0
codes/matrixHall/15815802.java | 19 ------
codes/matrixsquad/.keep | 0
codes/matrixsquad/15774031.java | 20 ------
codes/maxsky010/15734024.java | 18 -----
codes/mcfly001/11350844.java | 18 -----
codes/meiyaya/15775357.java | 20 ------
codes/memuqee/11238999.java | 19 ------
codes/meng123/15699639.java | 20 ------
codes/mengbo/.keep | 0
codes/mengbo/15855465.java | 20 ------
codes/mengjian/15775342.java | 20 ------
codes/mengwenxu/15578436.java | 35 ----------
codes/mengzhong/15775328.java | 20 ------
codes/menmazqj/15277745.java | 17 -----
codes/mercurio/15782388.java | 19 ------
codes/mewchen/.keep | 0
codes/mewchen/10042032.java | 11 ---
codes/mi9688/15776507.java | 35 ----------
codes/mianyang/.keep | 0
codes/mianyang/15856153.java | 20 ------
codes/milkyTea/11201805.java | 22 ------
codes/mimeik/14612577.java | 18 -----
codes/ming18641275939/15838279.java | 18 -----
codes/mingt123/15699576.java | 20 ------
codes/mingyaya/15775661.java | 20 ------
codes/mingzhi/.keep | 0
codes/mingzhi/15846139.java | 20 ------
codes/minixin/11115487.java | 17 -----
codes/mirabit/18384785.java | 19 ------
codes/miyuer/15846351.java | 18 -----
codes/mjzhutianxiu/15555031.java | 20 ------
codes/mjzhutianxiu/15578951.java | 20 ------
codes/mmkk26/15845961.java | 20 ------
codes/mmm111/15648151.java | 19 ------
codes/mmm123456/15625950.java | 18 -----
codes/mmmmmm/11121934.java | 18 -----
codes/mmnn123/15720368.java | 20 ------
codes/mmx050623/15846455.java | 18 -----
codes/momo1234/15630942.java | 29 --------
codes/momozi/15562400.java | 18 -----
codes/moonmoon/15777672.java | 26 -------
codes/morikawakaho/15830357.java | 18 -----
codes/mouse123/.issueld.java.swp | Bin 12288 -> 0 bytes
codes/mouse123/15837734.java | 18 -----
codes/mouse123/issueld.java | 0
codes/moyu9527/15633448.java | 21 ------
codes/moyudaren/.keep | 0
codes/moyudaren/15860459.java | 20 ------
codes/mozi123/15863565.java | 11 ---
codes/mr_lk123/.java | 0
codes/mr_lk123/9954396.java | 20 ------
codes/msc12345678/15659945.java | 12 ----
codes/msk6527/15520710.java | 18 -----
codes/mtfx0516/15585376.java | 18 -----
codes/mujing/15841257.java | 20 ------
codes/mupimage/11254168.java | 21 ------
codes/musei123/15775718.java | 26 -------
codes/muyang/.keep | 0
codes/muyang/15799169.java | 20 ------
codes/muzhuo0205/15809688.java | 19 ------
codes/mwy280429/15517713.java | 18 -----
codes/myclubocr/11122342.java | 20 ------
codes/myyaya/15774943.java | 20 ------
codes/nannanya/15777923.java | 20 ------
codes/nargnij7/15839361.java | 11 ---
codes/nbdopa/11116411.java | 27 --------
codes/ndliang/15628397.java | 18 -----
codes/ne8848/11116344.java | 17 -----
codes/neineiya/11260235.java | 20 ------
codes/nekoko/.keep | 0
codes/nekoko/15845688.java | 20 ------
codes/nemolv/15195393.java | 22 ------
codes/nfnxfr/.keep | 0
codes/nfnxfr/15775676.java | 20 ------
codes/nigger/15601489.java | 18 -----
codes/nightowl/9959740.java | 21 ------
codes/nihao01/.keep | 0
codes/nihao01/15867137.java | 20 ------
codes/niumaa/15777757.java | 22 ------
codes/niyiyi/15684167.java | 20 ------
codes/njjkxllj/15631418.java | 22 ------
codes/nn314159/15826881.java | 11 ---
codes/no8gcoder/15578057.java | 21 ------
codes/nofear123/.15830815.java.swo | Bin 12288 -> 0 bytes
codes/nofear123/.15830815.java.swp | Bin 12288 -> 0 bytes
codes/nofear123/15831083.java | 21 ------
codes/nonowa/15831088.java | 20 ------
codes/ny960126/15626345.java | 12 ----
codes/nzqq54667/.keep | 0
codes/nzqq54667/15841667.java | 19 ------
codes/o11ccm/.keep | 0
codes/o11ccm/10041751.java | 17 -----
codes/o1982016781/11118518.java | 11 ---
codes/o389675/15718177.java | 17 -----
codes/obc147/11064483.java | 17 -----
codes/onenewcode/15333872.java | 11 ---
codes/ooooo_long/15253355.java | 18 -----
codes/ooooo_long/15256718.java | 18 -----
codes/ooopen/11302831.java | 28 --------
codes/opaozhouzhou04/.keep | 0
codes/opaozhouzhou04/15846494.java | 19 ------
codes/openAI12/11234314.java | 18 -----
codes/openAsg/11491517.java | 17 -----
codes/openCI/11276263.java | 20 ------
codes/openZnolis/18398006.java | 24 -------
codes/openZnolis/18398008.java | 24 -------
codes/openZnolis/18398010.java | 24 -------
codes/openZnolis/18398011.java | 24 -------
codes/openZnolis/18398012.java | 24 -------
codes/openanolis_idear/.keep | 0
codes/openanolis_idear/15698658.java | 19 ------
codes/opsation/11293380.java | 11 ---
codes/oroyade/11207786.java | 11 ---
codes/os1024/10038969.java | 23 -------
codes/outclass2/.keep | 0
codes/outclass2/15815855.java | 19 ------
codes/owccqq/11122165.java | 11 ---
codes/oyeeyo/18379057.java | 12 ----
codes/oyoumq/11452053.java | 20 ------
codes/p13285288040/.keep | 0
codes/p13285288040/10972084.java | 11 ---
codes/p2948642664/15730688.java | 18 -----
codes/passass/11299378.java | 18 -----
codes/patrol12/.keep | 0
codes/patrol12/15845811.java | 19 ------
codes/pcvvvc/11211727.java | 18 -----
codes/pddpxx/15781110.java | 29 --------
codes/pears123/15846338.java | 28 --------
codes/penguin95/15774820.java | 11 ---
codes/perscc/15846268.java | 27 --------
codes/philips/11302813.java | 22 ------
codes/pictur/15653765.java | 18 -----
codes/plugin/11199950.java | 18 -----
codes/plustub/11244425.java | 11 ---
codes/polodybala/.18365371.java.swp | Bin 12288 -> 0 bytes
codes/polodybala/18365371.java | 33 ---------
codes/pondfish/15535613.java | 18 -----
codes/ppdplius/11212528.java | 20 ------
codes/pper2024/15867590.java | 11 ---
codes/pplac2/.keep | 0
codes/pplac2/15814992.java | 19 ------
codes/pppp0000/15840340.java | 11 ---
codes/progle/17034577.java | 22 ------
codes/promse/11152350.java | 11 ---
codes/publicstringms/.keep | 0
codes/publicstringms/15844875.java | 19 ------
codes/pui9001/11232878.java | 18 -----
codes/pumpkin/15658869.java | 19 ------
codes/puzzle/15806930.java | 11 ---
codes/pyqyzjznbw1/.15782703.java.swp | Bin 12288 -> 0 bytes
codes/pyqyzjznbw1/15782703,java | 17 -----
codes/pyqyzjznbw1/15782703.java | 17 -----
codes/pysunlightse/.keep | 0
codes/pysunlightse/15846452.java | 19 ------
codes/pzzzzzzzzz/.keep | 0
codes/pzzzzzzzzz/15778160.java | 11 ---
codes/q1229173945/15755759.java | 18 -----
codes/q225692/15860954.java | 20 ------
codes/q6666666868/11202065.java | 18 -----
codes/qaz123qaz/15859565 | 20 ------
codes/qaz123qaz/15859565.java | 20 ------
codes/qazwsx061jk/15838272.java | 11 ---
codes/qianshi/13339610.java | 17 -----
codes/qianxiaxingkong/11737212.java | 21 ------
codes/qianyege/.keep | 0
codes/qianyege/15846025.java | 20 ------
codes/qichang0921/15671954.java | 23 -------
codes/qierbao/15832037.java | 22 ------
codes/qigela/.keep | 0
codes/qigela/15757052.java | 20 ------
codes/qihuan/15568203.java | 21 ------
codes/qingfeng/15541061.java | 20 ------
codes/qingkouwei/15823415.java | 18 -----
codes/qingqingjiang/15876459.java | 18 -----
codes/qingyunzhishang/15861715.java | 26 -------
codes/qiqixiongdi/.keep | 0
codes/qiqixiongdi/15846620.java | 20 ------
codes/qiu040905/.15783626.java.swo | Bin 12288 -> 0 bytes
codes/qiu040905/.15783626.java.swp | Bin 12288 -> 0 bytes
codes/qiu040905/15783626.java | 20 ------
codes/qiuwenjie/.keep | 0
codes/qiuwenjie/15846265.java | 20 ------
codes/qixiaobao/15829693.java | 21 ------
codes/qjpdjk578/15514740.java | 26 -------
codes/qq13189019228/15808396.java | 19 ------
codes/qq2121809344/15831326.java | 11 ---
codes/qq753755635/15717531.java | 18 -----
codes/qqyy123/15845835.java | 20 ------
codes/qsh123/15845262.java | 11 ---
codes/qwaszx/15543578.java | 18 -----
codes/qwe123457/15854887.java | 22 ------
codes/qwer121234/15859995.java | 20 ------
codes/qwer121256/15860383.java | 20 ------
codes/qwer121278/15860433.java | 20 ------
codes/qwer121290/.keep | 0
codes/qwer121290/15860549.java | 20 ------
codes/qwerplm6/15587872.java | 35 ----------
codes/qwert4678/.keep | 0
codes/qwert4678/15743469.java | 19 ------
codes/qwfasfy4/.keep | 0
codes/qwfasfy4/15831401.java | 19 ------
codes/ranball/15775950.java | 16 -----
codes/renhaihang/15681912.java | 18 -----
codes/replying/11277017.java | 18 -----
codes/reseta/.keep | 0
codes/reseta/15854468.java | 20 ------
codes/rhp1234/15674333.java | 26 -------
codes/rice18302947981/15717388.java | 19 ------
codes/rider666/18719506.java | 11 ---
codes/rlzvpz/.keep | 0
codes/rlzvpz/15777666.java | 18 -----
codes/robert_bo/15545727.java | 19 ------
codes/robert_bo/15669897.java | 18 -----
codes/robert_bo/15669960.java | 18 -----
codes/rockandro1l/.keep | 0
codes/rockandro1l/15844987.java | 19 ------
codes/roklly/11207828.java | 11 ---
codes/root0day/10353744.java | 18 -----
codes/roy12345666/15845812.java | 19 ------
codes/rree123/15719870.java | 20 ------
codes/rrffhj/.keep | 0
codes/rrffhj/15778997.java | 20 ------
codes/rrr170459/15857158.java | 18 -----
codes/rtsp8080/11303570.java | 19 ------
codes/ruoruokpl/.keep | 0
codes/ruoruokpl/15815244.java | 19 ------
codes/ruoruone/15775867.java | 20 ------
codes/ryange/.keep | 0
codes/ryange/15846346.java | 20 ------
codes/ryer767gfgs/.keep | 0
codes/ryer767gfgs/15743395.java | 19 ------
codes/s0nder/15635858.java | 18 -----
codes/s18836251852/15717550.java | 17 -----
codes/s18893442896/16477528.java | 36 ----------
codes/s19555077769/15839271.java | 18 -----
codes/s20050520/15545690.java | 35 ----------
codes/sa17737119814/15860032.java | 18 -----
codes/sa17833901967/15859863.java | 18 -----
codes/sad546aa/.keep | 0
codes/sad546aa/15743452.java | 19 ------
codes/sadboy/10979809.java | 20 ------
codes/sadboy/15628230.java | 20 ------
codes/saf546qafd/.keep | 0
codes/saf546qafd/15743461.java | 19 ------
codes/safafsaiuiu24/.keep | 0
codes/safafsaiuiu24/15831227.java | 19 ------
codes/safasf342351/.keep | 0
codes/safasf342351/15743467.java | 19 ------
codes/safasf647/.keep | 0
codes/safasf647/15831068.java | 19 ------
codes/saffasckkk77/.keep | 0
codes/saffasckkk77/15743383.java | 19 ------
codes/sag546fa/.keep | 0
codes/sag546fa/15799007.java | 19 ------
codes/sahofav587/11220243.java | 18 -----
codes/sakut2/15592208.java | 18 -----
codes/sam9029/.java.swp | Bin 12288 -> 0 bytes
codes/sam9029/9968905.java | 23 -------
codes/samzoe_openanolis/15733701.java | 18 -----
codes/sandbox/11142279.java | 11 ---
codes/sangeta/.keep | 0
codes/sangeta/15720730.java | 20 ------
codes/sansiya/15776109.java | 20 ------
codes/sanya123/15772128.java | 20 ------
codes/sanzhanggui/15824093.java | 18 -----
codes/sar34dg674/.keep | 0
codes/sar34dg674/15831280.java | 19 ------
codes/say1ka/16051921.java | 22 ------
codes/sayslot/11250439.java | 11 ---
codes/sccc2124/.keep | 0
codes/sccc2124/15831363.java | 19 ------
codes/sda2022421943/15859661.java | 20 ------
codes/sdafaf4251/.keep | 0
codes/sdafaf4251/15743466.java | 19 ------
codes/sdasr5542/.keep | 0
codes/sdasr5542/15743114.java | 19 ------
codes/sdd42424/.keep | 0
codes/sdd42424/15824581.java | 19 ------
codes/sdfghfd34/.keep | 0
codes/sdfghfd34/15826951.java | 19 ------
codes/sdg56sdfasf/.keep | 0
codes/sdg56sdfasf/15831417.java | 19 ------
codes/sdsacc23/.keep | 0
codes/sdsacc23/15825736.java | 19 ------
codes/sdt345sdfs/.keep | 0
codes/sdt345sdfs/15743451.java | 19 ------
codes/seebee/16266160.java | 18 -----
codes/selena/11289878.java | 20 ------
codes/seven/15710966.java | 22 ------
codes/sevenpppplus/10371725.java | 20 ------
codes/sf35463af/.keep | 0
codes/sf35463af/15831476.java | 19 ------
codes/sfaf234214/.keep | 0
codes/sfaf234214/15831503.java | 19 ------
codes/sfasffasf2434/.keep | 0
codes/sfasffasf2434/15831014.java | 19 ------
codes/sfccwad902/.keep | 0
codes/sfccwad902/15826644.java | 19 ------
codes/sfdafas422/.keep | 0
codes/sfdafas422/15743380.java | 19 ------
codes/sgdfg56/.keep | 0
codes/sgdfg56/15743475.java | 19 ------
codes/sgdfgw234/.keep | 0
codes/sgdfgw234/15829828.java | 19 ------
codes/shangxing117/.keep | 0
codes/shangxing117/15742267.java | 19 ------
codes/shankailun10/.keep | 0
codes/shankailun10/9637756.java | 22 ------
codes/shankailun10/9638206.java | 22 ------
codes/shankailun10/9682326.java | 22 ------
codes/sharpery/15562912.java | 18 -----
codes/shelly/9674981.java | 24 -------
codes/shelove/11217672.java | 18 -----
codes/shenshenwa/15846503.java | 20 ------
codes/sherlinz0/9688047.java | 18 -----
codes/shiguang173/15759081.java | 20 ------
codes/shihantao/.keep | 0
codes/shihantao/10039704.java | 17 -----
codes/shihantao1/.keep | 0
codes/shiove/15669581.java | 18 -----
codes/shiyigela/.keep | 0
codes/shiyigela/15758629.java | 20 ------
codes/shongz/15517802.java | 17 -----
codes/shrcc1314/.keep | 0
codes/shrcc1314/15844211.java | 19 ------
codes/shuchaoyang/15534407.java | 18 -----
codes/shuijiao/15776076.java | 20 ------
codes/shunvdouniu/15841229.java | 12 ----
codes/shuoshu131/18614920.java | 18 -----
codes/shuyiyi/15683952.java | 20 ------
codes/sianjen/10330887.java | 19 ------
codes/sichen123/15721908.java | 20 ------
codes/silverSmith/15774806.java | 20 ------
codes/siqiwang/.keep | 0
codes/siqiwang/15311318.java | 18 -----
codes/sisiya/15723000.java | 20 ------
codes/siwuge2/.keep | 0
codes/siwuge2/15720932.java | 20 ------
codes/sjms1u2n3s4h5/10104996.java | 21 ------
codes/sk1234/15778693.java | 18 -----
codes/sk123456/15858299.java | 18 -----
codes/skysky/15776206.java | 20 ------
codes/slamer/11242607.java | 20 ------
codes/smartpulse/.keep | 0
codes/smartpulse/15774449.java | 20 ------
codes/smcO0O/.java | 1 -
codes/smcO0O/10708545.java | 21 ------
codes/smesa6/11229202.java | 20 ------
codes/snowfog/11357833.java | 18 -----
codes/solo1017805211/.java | 23 -------
codes/solo1017805211/16409853.java | 24 -------
codes/solo1017805211/16441292.java | 22 ------
codes/solo1017805211/16442270.java | 23 -------
codes/solo1017805211/16445723.java | 20 ------
codes/solo1017805211/16558637.java | 20 ------
codes/someoneunknown/.keep | 0
codes/someoneunknown/15815800.java | 19 ------
codes/sqScripter/.keep | 0
codes/sqScripter/15846693.java | 19 ------
codes/ss12wzh/15780057.java | 26 -------
codes/ssr88888888/10999180.java | 18 -----
codes/sssdzh/15830739.java | 27 --------
codes/sssyl547222/15827096.jaba | 0
codes/sssyl547222/15827096.java | 18 -----
codes/ssy123/15792965.java | 21 ------
codes/ssya12/15718593.java | 20 ------
codes/steven_0324/15724446.java | 18 -----
codes/stevenchendy/10044195.java | 25 -------
codes/stevending1st/15193096.java | 17 -----
codes/subNvue/11264972.java | 18 -----
codes/suisuiya/15775252.java | 20 ------
codes/suixin186/15758969.java | 20 ------
codes/suiyue97/15816307.java | 18 -----
codes/sundong/15615609.java | 22 ------
codes/sunfei2024/15869590.java | 11 ---
codes/sunjinglei/9956147.java | 17 -----
codes/sunxiaoke/15838991.java | 18 -----
codes/sunxiaoshou/15541950.java | 12 ----
codes/sunys312/10087139.java | 19 ------
codes/suporisom/.keep | 0
codes/suporisom/15815852.java | 19 ------
codes/survivor/15602447.java | 18 -----
codes/sushi13075929819/.keep | 0
codes/sushi13075929819/10971905.java | 11 ---
codes/susuplus/11211308.java | 22 ------
codes/sususu/11260612.java | 11 ---
codes/suyingjie/.keep | 0
codes/suyingjie/15845547.java | 20 ------
codes/sw12345677/15860800.java | 20 ------
codes/swgger/11211222.java | 18 -----
codes/sxb1110/15840824.java | 35 ----------
codes/sym1453052794/15771464.java | 11 ---
codes/sym1453052794/15821043.java | 18 -----
codes/sym1453052794/15821842.java | 19 ------
codes/sym1453052794/15822577.java | 19 ------
codes/sym1453052794/15843194.java | 19 ------
codes/syst1m/15514292.java | 19 ------
codes/t1785968235/15860463.java | 20 ------
codes/taishai/.keep | 0
codes/taishai/15867030.java | 20 ------
codes/tangda/.keep | 0
codes/tangda/15764487.java | 20 ------
codes/tangmingqing1998/11752180.java | 13 ----
codes/tangxiaoting/15835893.java | 35 ----------
codes/taohua/.keep | 0
codes/taohua/15867385.java | 20 ------
codes/taoz123/15720694.java | 20 ------
codes/tdnginx/11207793.java | 18 -----
codes/techoc/18512141.java | 20 ------
codes/techstars/.keep | 0
codes/techstars/15774401.java | 20 ------
codes/template/11204937.java | 23 -------
codes/tender/15568442.java | 28 --------
codes/tfboy168/11207647.java | 20 ------
codes/tg666tg/15860299.java | 20 ------
codes/tgtian/.keep | 0
codes/tgtian/15866236.java | 20 ------
codes/theSeven/15555656.java | 19 ------
codes/thesky11/.keep | 0
codes/thesky11/15811112.java | 20 ------
codes/thisisanuo/15720471.java | 20 ------
codes/thisisericq/15715035.java | 18 -----
codes/thisisluosheng/15730125.java | 20 ------
codes/thisislwl/15583856.java | 18 -----
codes/thisisqlbw/15722233.java | 20 ------
codes/thisissmdmy/15724112.java | 20 ------
codes/threestones/15517626.java | 18 -----
codes/tian0311/15831475.java | 26 -------
codes/tiandao186/15758999.java | 20 ------
codes/tingtingya/15775825.java | 20 ------
codes/titita/.keep | 0
codes/titita/15866821.java | 20 ------
codes/titiya/15830842.java | 20 ------
codes/tjjcdxmy/.keep | 0
codes/tjjcdxmy/15844593.java | 19 ------
codes/toutouya/15742811.java | 20 ------
codes/tr1120753883/15634698.java | 20 ------
codes/ttfei123/15719497.java | 20 ------
codes/ttyy23/15846026.java | 20 ------
codes/ttyylb/11228246.java | 18 -----
codes/tuboshu/.keep | 0
codes/tuboshu/15767771.java | 20 ------
codes/tuoera/11301685.java | 18 -----
codes/turinglegacy/.keep | 0
codes/turinglegacy/15775469.java | 20 ------
codes/txb0318/.15528488.java.swp | Bin 12288 -> 0 bytes
codes/txb0318/15528488.java | 20 ------
codes/uacdtsun/11202127.java | 11 ---
codes/uasda921/.keep | 0
codes/uasda921/15782380.java | 11 ---
codes/uavjuju/10971568.java | 11 ---
codes/uetvuetv/.keep | 0
codes/uetvuetv/11207718.java | 18 -----
codes/uibottommm/.keep | 0
codes/uibottommm/15844862.java | 19 ------
codes/uioplck/11253331.java | 20 ------
codes/uiuiya/15772564.java | 20 ------
codes/umiapp/11244024.java | 11 ---
codes/uniqueO/11369940.java | 21 ------
codes/upgrade/11267063.java | 18 -----
codes/user-2352414618/15578257.java | 19 ------
codes/user-9548709343/14554338.java | 20 ------
codes/uukkya/15846280.java | 20 ------
codes/vajiangjiang/15837419.java | 18 -----
codes/vanguard/.keep | 0
codes/vanguard/15772450.java | 20 ------
codes/vermouth001/15833957.java | 26 -------
codes/victory2/15555436.java | 18 -----
codes/viewport/11328946.java | 18 -----
codes/vipsoso/11207552.java | 18 -----
codes/vodka001/15830352.java | 18 -----
codes/vv0102/.keep | 0
codes/vv0102/15831508.java | 20 ------
codes/vv89889901/11286616.java | 20 ------
codes/w13097865367/15857389.java | 18 -----
codes/w18438720464/15860134.java | 20 ------
codes/w188555/.keep | 0
codes/w188555/10043819.java | 11 ---
codes/w193005/15783193.java | 35 ----------
codes/w3172773640/15857664.java | 18 -----
codes/w964061684/15543696.java | 17 -----
codes/walicode/9651246.java | 24 -------
codes/wang001/15732362.java | 18 -----
codes/wang123123/15816325.java | 18 -----
codes/wang_lz/15895908.java | 20 ------
codes/wangaobin/15830618.java | 35 ----------
codes/wangeditor/11461619.java | 22 ------
codes/wangjingru/15775677.java | 27 --------
codes/wangjz18551603897/9965927.java | 21 ------
codes/wanglian/.keep | 0
codes/wanglian/15768118.java | 20 ------
codes/wangliping111/15556238.java | 18 -----
codes/wanglumin/15110274.java | 13 ----
codes/wangsheng112/.keep | 0
codes/wangsheng112/15741948.java | 19 ------
codes/wangth/12284554.java | 18 -----
codes/wangyaru01/9678121.java | 22 ------
codes/wangzixuan654/.keep | 0
codes/wangzixuan654/15815873.java | 19 ------
codes/wanmeijuhao/15724276.java | 26 -------
codes/wanwanya/15775672.java | 20 ------
codes/waste985/15615158.java | 17 -----
codes/waterdrop/15514437.java | 26 -------
codes/waveriders/.keep | 0
codes/waveriders/15772349.java | 20 ------
codes/wb-qtt862918/9675682.java | 20 ------
codes/wcc0066/11473178.java | 19 ------
codes/wcjm2023/11233911.java | 28 --------
codes/wdg1994/15654397.java | 21 ------
codes/wdnmd123/10967263.java | 28 --------
codes/web-dream/.keep | 0
codes/web-dream/15776234.java | 20 ------
codes/web3dapp/10996679.java | 11 ---
codes/web4usss/.keep | 0
codes/web4usss/15844605.java | 19 ------
codes/webAssembly/11131659.java | 22 ------
codes/wechat/11212111.java | 11 ---
codes/wee223/15861853.java | 20 ------
codes/weiha162/15759131.java | 20 ------
codes/weijinhang/15838774.java | 18 -----
codes/weishuai/.keep | 0
codes/weishuai/15795582.java | 20 ------
codes/weisss/15526691.java | 19 ------
codes/weiwei1/15837298.java | 18 -----
codes/weiwenjie/15736197.java | 18 -----
codes/weiyanqiu/15624187.java | 19 ------
codes/wenhuiyu/.keep | 0
codes/wenhuiyu/15765207.java | 20 ------
codes/wenjlong/18626126.java | 20 ------
codes/wenrou99/.keep | 0
codes/wenrou99/15831418.java | 20 ------
codes/werxcg435/.keep | 0
codes/werxcg435/15829881.java | 19 ------
codes/wesdfwerw/.keep | 0
codes/wesdfwerw/15831338.java | 19 ------
codes/whc666/15671266.java | 19 ------
codes/whiteSteelRain/15781044.java | 18 -----
codes/windaos13/.keep | 0
codes/windaos13/15841934.java | 19 ------
codes/wingwf/15632876.java | 18 -----
codes/wisemansxl/.keep | 0
codes/wisemansxl/15844299.java | 19 ------
codes/witty1972/10970403.java | 18 -----
codes/wjhh111/15628801.java | 19 ------
codes/wjy030522/15582699.java | 18 -----
codes/wll123/10971000.java | 11 ---
codes/wll123/15541001.java | 20 ------
codes/wmmnmd/11212424.java | 21 ------
codes/workii/9727876.java | 28 --------
codes/wq456wrfs/.keep | 0
codes/wq456wrfs/15743473.java | 19 ------
codes/wrtgre24513/.keep | 0
codes/wrtgre24513/15831250.java | 19 ------
codes/wsq1234567/.keep | 0
codes/wsq1234567/15815251.java | 19 ------
codes/wtfock/11212229.java | 20 ------
codes/wu123-/15587168.java | 19 ------
codes/wu13935784487/15636076.java | 20 ------
codes/wu616562636/9947556.java | 18 -----
codes/wuDaoya/11122066.java | 18 -----
codes/wucga1/11179945.java | 20 ------
codes/wuchangjun/15842345.java | 22 ------
codes/wudi6662/.keep | 0
codes/wudi6662/15814869.java | 19 ------
codes/wuli12345/15825475.java | 11 ---
codes/wulibaibao/9691535.java | 20 ------
codes/wuliuge/.keep | 0
codes/wuliuge/15721048.java | 20 ------
codes/wupengyu/10969882.java | 18 -----
codes/wuyifan1/.keep | 0
codes/wuyifan1/15775795.java | 18 -----
codes/wuyifang8012/.keep | 0
codes/wuyifang8012/15815804.java | 19 ------
codes/wuyiwei/.keep | 0
codes/wuyiwei/15853979.java | 20 ------
codes/wuzhenzi001/15711848.java | 22 ------
codes/wwee123/15720571.java | 20 ------
codes/wwh1096046571/.keep | 0
codes/wwh1096046571/10040814.java | 23 -------
codes/wws001227/15774783.java | 19 ------
codes/www123456/15837892.java | 11 ---
codes/wxf68725032/10117253.java | 11 ---
codes/wxyaya/15684359.java | 20 ------
codes/wy16651754941/.keep | 0
codes/wy16651754941/10972345.java | 11 ---
codes/wyg12345/15860946.java | 20 ------
codes/wyj111/15781098.java | 26 -------
codes/wyk12345/9950042.java | 19 ------
codes/wyk18220700018/15845948.java | 20 ------
codes/wypdao/15807776.java | 20 ------
codes/wypdao/15837238.java | 19 ------
codes/wza20021216/15778780.java | 18 -----
codes/wzj123/15628771.java | 20 ------
codes/wzj66666/15848821.java | 18 -----
codes/wzj666662/15860936.java | 18 -----
codes/x123456/10987993.java | 11 ---
codes/x123456/15539350.java | 20 ------
codes/x13433445193/15781690.java | 18 -----
codes/xaioli/15562718.java | 19 ------
codes/xcw18988783240/.keep | 0
codes/xcw18988783240/10972415.java | 11 ---
codes/xd16750866428/.keep | 0
codes/xd16750866428/10972670.java | 11 ---
codes/xhm17860971687/.keep | 0
codes/xhm17860971687/10043024.java | 11 ---
codes/xi13313987553/.keep | 0
codes/xi13313987553/10972326.java | 11 ---
codes/xiandeya/15845628.java | 20 ------
codes/xiao15108075188/15845548.java | 26 -------
codes/xiao555/.java.swp | Bin 12288 -> 0 bytes
codes/xiao555/15576144.java | 19 ------
codes/xiaoai/15563405.java | 35 ----------
codes/xiaochen322/15821124.java | 11 ---
codes/xiaoduo/15742206.java | 20 ------
codes/xiaoer1/15626743.java | 17 -----
codes/xiaohanhan/15743008.java | 20 ------
codes/xiaohuaya/15742515.java | 20 ------
codes/xiaohudui/15724769.java | 27 --------
codes/xiaohudui/:wqwq | 27 --------
codes/xiaojun614/15778779.java | 18 -----
codes/xiaomi167/15759142.java | 20 ------
codes/xiaosheng333/15692737.java | 18 -----
codes/xiaowang818/15651046.java | 18 -----
codes/xiaowuya/15742288.java | 20 ------
codes/xiaoxiaoxiao/15833583.java | 19 ------
codes/xiaoxiaoya/15742403.java | 20 ------
codes/xiaoxiaoyusheng/.keep | 0
codes/xiaoxiaoyusheng/15831390.java | 20 ------
codes/xiaoxuzhu/15488956.java | 17 -----
codes/xiaoyiyi/15742502.java | 20 ------
codes/xie-yuxuan44/13983623.java | 18 -----
codes/xierya/15742677.java | 20 ------
codes/xieyiyi/9964192.java | 20 ------
codes/xileya/15685017.java | 20 ------
codes/xindeya/15845628.java | 20 ------
codes/xindongli/.keep | 0
codes/xindongli/15831053.java | 20 ------
codes/xindongli/15831053/15831053.java | 20 ------
codes/xingwang/11302451.java | 22 ------
codes/xingxing/15775128.java | 20 ------
codes/xingya6/15700119.java | 20 ------
codes/xingyao686/15775329.java | 17 -----
codes/xinsui/15719607.java | 20 ------
codes/xinyi7441/.keep | 0
codes/xinyi7441/15815223.java | 19 ------
codes/xinyuxu/.keep | 0
codes/xinyuxu/10987804.java | 18 -----
codes/xiucai/.keep | 0
codes/xiucai/15799043.java | 20 ------
codes/xiucai/15799043/15799043.java | 20 ------
codes/xixi666/15859803.java | 20 ------
codes/xixihhh/15896349.java | 11 ---
codes/xizhiya/15699232.java | 20 ------
codes/xjz21571/15614490.java | 18 -----
codes/xmicai/15738579.java | 21 ------
codes/xpbxxx/.keep | 0
codes/xpbxxx/15780704.java | 20 ------
codes/xpc2017/15790304.java | 18 -----
codes/xtsyx123/.keep | 0
codes/xtsyx123/15838548.java | 19 ------
codes/xuanxuan/15630222.java | 18 -----
codes/xujinxin001/9946130.java | 22 ------
codes/xuliang/.keep | 0
codes/xuliang/10045776.java | 19 ------
codes/xunmi666/15832154.java | 26 -------
codes/xunnan/15643977.java | 30 --------
codes/xuwangcheng14/10934340.java | 22 ------
codes/xuxidong/15575339.java | 17 -----
codes/xwq188168/15816345.java | 20 ------
codes/xxii77/15720091.java | 27 --------
codes/xxll123/15831335.java | 26 -------
codes/xxy88888888/11073406.java | 17 -----
codes/xymdaysgone/15343399.java | 13 ----
codes/xyy071125/15861718.java | 20 ------
codes/xzl999/11211117.java | 11 ---
codes/y133567204341/15831123.java | 19 ------
codes/y15336955334/15860441.java | 18 -----
codes/y15964620935/15831048.java | 18 -----
codes/y17275674594/15840277.java | 18 -----
codes/y18352279320/.keep | 0
codes/y18352279320/10972594.java | 11 ---
codes/y18968462468/15860285.java | 18 -----
codes/y2915445410/15860746.java | 18 -----
codes/y80730176/15381500.java | 18 -----
codes/yai214/11079560.java | 11 ---
codes/yalou1/11209005.java | 21 ------
codes/yanerya/15771918.java | 20 ------
codes/yanfei06/15781511.java | 22 ------
codes/yang123456/15540673.java | 22 ------
codes/yang666/15777058.java | 18 -----
codes/yang666/yang666.java | 18 -----
codes/yanggege/.keep | 0
codes/yanggege/15846286.java | 20 ------
codes/yanghai01/.keep | 0
codes/yanghai01/15814831.java | 20 ------
codes/yangqing/9755006.java | 20 ------
codes/yangxue1/.keep | 0
codes/yangxue1/10041714.java | 17 -----
codes/yangyang167/15759151.java | 20 ------
codes/yangyx/15808181.java | 11 ---
codes/yangzhiqi/15839789.java | 18 -----
codes/yanson/15355616.java | 11 ---
codes/yanyan123/15721395.java | 20 ------
codes/yanzi666/15636134.java | 18 -----
codes/yaodaojidegou/15816443.java | 20 ------
codes/yatou888/15861472.java | 26 -------
codes/yeats_liao/.keep | 0
codes/yeats_liao/9946775.java | 19 ------
codes/yeyeya/15775016.java | 20 ------
codes/yf200304/.keep | 0
codes/yf200304/15843198.java | 19 ------
codes/yf20030921/15807359.java | 11 ---
codes/yhfysun/15523539.java | 19 ------
codes/yigekongbai/.keep | 0
codes/yigekongbai/15867120.java | 20 ------
codes/yiiixxxx/15688342.java | 27 --------
codes/yikanji/10160695.java | 18 -----
codes/yimengzhiyan/16563760.java | 18 -----
codes/yinrr123/15627843.java | 20 ------
codes/yisheng/15775181.java | 20 ------
codes/yisuiyuan/.java | 0
codes/yisuiyuan/15539123.java | 19 ------
codes/yixiak/15186898.java | 19 ------
codes/yiyi123/15684743.java | 20 ------
codes/yiyicoder/15630262.java | 20 ------
codes/yiyiguowang/15885939.java | 11 ---
codes/yj1198222879/9947891.java | 19 ------
codes/yjh123456/15542529.java | 20 ------
codes/yk12345/15606552.java | 18 -----
codes/ylolpeng/11122754.java | 24 -------
codes/yls3050933027/15895415.java | 27 --------
codes/ymx2026/11211004.java | 19 ------
codes/yoU_Qu/15526866.java | 22 ------
codes/you1229/15774816.java | 18 -----
codes/yp33posit/.keep | 0
codes/yp33posit/15840404.java | 19 ------
codes/yqh15977954304/15861888.java | 20 ------
codes/yrr456/15542411.java | 20 ------
codes/ysyhl9tian/15698870.java | 18 -----
codes/ytaomg/11211641.java | 18 -----
codes/yuanps/10188803.java | 18 -----
codes/yueliang9809/15847888.java | 18 -----
codes/yujinghui/15805872.java | 18 -----
codes/yulinL/.java | 1 -
codes/yulinL/13638622.java | 20 ------
codes/yuliwei/15592333.java | 35 ----------
codes/yunyunne/15775145.java | 20 ------
codes/yuyuya/15772019.java | 20 ------
codes/yuyuyu11/15522885.java | 20 ------
codes/yuzhanao/15592466.java | 35 ----------
codes/ywf123456/15834908.java | 19 ------
codes/yxy522/15832952.java | 17 -----
codes/yy19047006973/.keep | 0
codes/yy19047006973/10972205.java | 11 ---
codes/yyds0102/11208011.java | 18 -----
codes/yyguaiguaizai/15651703.java | 28 --------
codes/yyh520/15551703.java | 17 -----
codes/yyui123/15718758.java | 20 ------
codes/yyya12/15700309.java | 20 ------
codes/yzqzhiqi/.keep | 0
codes/yzqzhiqi/15805886.java | 20 ------
codes/z1126376522/15835615.java | 18 -----
codes/z13213005762/15514594.java | 20 ------
codes/z13213005762/15515049.java | 20 ------
codes/z16692104570/15823309.java | 21 ------
codes/z17735706081/15774718.java | 21 ------
codes/z2468479040/11197656.java | 14 ----
codes/zangzang/9952436.java | 19 ------
codes/zcx1534344521/16410752.java | 21 ------
codes/zer0_1s/10517202.java | 27 --------
codes/zeroday/15115160.java | 18 -----
codes/zerofei_tsai/10742215.java | 19 ------
codes/zgm1214/15650118.java | 22 ------
codes/zhangll/10007624.java | 21 ------
codes/zhangmin_1/15815725.java | 35 ----------
codes/zhangpc/10298011.java | 17 -----
codes/zhangshaopu/9785926.java | 19 ------
codes/zhangwei001/15709943.java | 18 -----
codes/zhangxiao123/15858470.java | 35 ----------
codes/zhangxiaoQ/15509138.java | 18 -----
codes/zhangyuyun/18461684.java | 17 -----
codes/zhao1218jk/.keep | 0
codes/zhao1218jk/10981574.java | 11 ---
codes/zhaokang/15619865.java | 19 ------
codes/zhengxinyue/15833712.java | 35 ----------
codes/zhenhan0502/.keep | 0
codes/zhenhan0502/10987497.java | 11 ---
codes/zhenkuai/.keep | 0
codes/zhenkuai/15817268.java | 20 ------
codes/zhixinheyi/15775293.java | 18 -----
codes/zhizhihua1/15588689.java | 35 ----------
codes/zhizhixia/15563504.java | 35 ----------
codes/zhizi123/15635289.java | 19 ------
codes/zhonggui/11896235.java | 20 ------
codes/zhongyaya/15846137.java | 20 ------
codes/zhoucheng/11464584.java | 18 -----
codes/zhouxuan01/.keep | 0
codes/zhouxuan01/15845799.java | 20 ------
codes/zhouyi/15778243.java | 18 -----
codes/zhuweiZy/.keep | 0
codes/zhuweiZy/15846061.java | 19 ------
codes/zhw_tt/16576195.java | 18 -----
codes/zihao2003/15810758.java | 19 ------
codes/zk_cxz/15621975.java | 27 --------
codes/zl940825/.keep | 0
codes/zl940825/10979064.java | 11 ---
codes/zl954208/.keep | 0
codes/zl954208/10981200.java | 11 ---
codes/zmq11111/15512070.java | 22 ------
codes/zn18829358170/15861141.java | 20 ------
codes/znnzmm/11212509.java | 18 -----
codes/zouyu5521/11464070.java | 24 -------
codes/zrccxx/10850939.java | 12 ----
codes/zrzrzr/15805335.java | 18 -----
codes/ztpmasters/.keep | 0
codes/ztpmasters/15846690.java | 19 ------
codes/zu15047422887/.keep | 0
codes/zu15047422887/15607358.java | 18 -----
codes/zu15047422887/15607367.java | 18 -----
codes/zu15147473922/.keep | 0
codes/zu15147473922/15837017.java | 18 -----
codes/zu15147473922/15837089.java | 18 -----
codes/zu15147473922/15837113.java | 18 -----
codes/zuileya/15775295.java | 20 ------
codes/zuobao/.keep | 0
codes/zuobao/15858174.java | 20 ------
codes/zuokem6/11118132.java | 18 -----
codes/zuotian/15659839.java | 18 -----
codes/zwjdashabi1001/15895572.java | 12 ----
codes/zwl111/15779557.java | 18 -----
codes/zwl111/15779562.java | 18 -----
codes/zxc123/15513151.java | 22 ------
codes/zxcvbaa225/.keep | 0
codes/zxcvbaa225/15735743.java | 19 ------
codes/zxd30022/10164256.java | 19 ------
codes/zxf1795065101/15563222.java | 35 ----------
codes/zxg_god/11128523.java | 11 ---
codes/zxj158300/15866865.java | 11 ---
codes/zxmyigeren/15488956.java | 33 ---------
codes/zxmyigeren/15539430.java | 33 ---------
codes/zxntbj6/.keep | 0
codes/zxntbj6/15846512.java | 19 ------
codes/zxq777/15540332.java | 22 ------
codes/zy2239106/14616675.java | 18 -----
codes/zycq13350636821/15859606.java | 18 -----
codes/zyx1373529784/.11255507.java.swp | Bin 12288 -> 0 bytes
codes/zyx1373529784/11255507.java | 19 ------
codes/zyy022/15592411.java | 18 -----
codes/zzc666233/15861698.java | 20 ------
codes/zzcaicai/15725032.java | 28 --------
codes/zzdpop/11212991.java | 11 ---
codes/zzmini/11076797.java | 11 ---
codes/zzy2744726697/15860385.java | 35 ----------
l1017026323/15630469.java | 20 ------
qwer121234/15859995.java | 20 ------
smcO0O/10708545.java | 12 ----
yimengzhiyan/16563760.java | 18 -----
zhouyi/15778243.java | 18 -----
2326 files changed, 35856 deletions(-)
delete mode 100644 .idea/.gitignore
delete mode 100644 .idea/checkstyle-idea.xml
delete mode 100644 .idea/inspectionProfiles/Project_Default.xml
delete mode 100644 .idea/misc.xml
delete mode 100644 .idea/modules.xml
delete mode 100644 .idea/vcs.xml
delete mode 100644 15372338.java
delete mode 100644 15620229.java
delete mode 100644 15651046.java
delete mode 100644 15684741.java
delete mode 100644 15778243.java
delete mode 100644 15781013.java
delete mode 100644 15845948.java
delete mode 100644 9619048.java
delete mode 100644 LICENSE
delete mode 100644 README.en.md
delete mode 100644 README.md
delete mode 100644 Zoey12138/15846229.java
delete mode 160000 activity-school
delete mode 100644 activity-school.iml
delete mode 100644 codes/ BHUIJ217892/11003994.java
delete mode 100644 codes/ Dreamlover/11202583.java
delete mode 100644 codes/ Greeter/11262621.java
delete mode 100644 codes/ Iboydoss/11210866.java
delete mode 100644 codes/ Jingyu/11302198.java
delete mode 100644 codes/ NProgress/11324505.java
delete mode 100644 codes/ OPReno/11276365.java
delete mode 100644 codes/ PHPhph/.keep
delete mode 100644 codes/ PHPhph/11120724.java
delete mode 100644 codes/ Qw2229188799/11089611.java
delete mode 100644 codes/ String/11118586.java
delete mode 100644 codes/ YYDS2023/11094401.java
delete mode 100644 codes/ Z3608759124/10979186.java
delete mode 100644 codes/ budasan/11121691.java
delete mode 100644 codes/ bupiovm0101/11122657.java
delete mode 100644 codes/ buzhidao/11118686.java
delete mode 100644 codes/ deijia909/.keep
delete mode 100644 codes/ fasfaf227/.keep
delete mode 100644 codes/ fasfaf227/15820189.java
delete mode 100644 codes/ gui8989/11228793.java
delete mode 100644 codes/ liwei2496/11466656.java
delete mode 100644 codes/ lovscene/11290992.java
delete mode 100644 codes/ memuqee/11238999.java
delete mode 100644 codes/ mupimage/11254168.java
delete mode 100644 codes/ neineiya/11260235.java
delete mode 100644 codes/ openAI12/11234314.java
delete mode 100644 codes/ opsation/11293380.java
delete mode 100644 codes/ passass/11299378.java
delete mode 100644 codes/ sdsacc23/.keep
delete mode 100644 codes/ sdsacc23/15743254.java
delete mode 100644 codes/ slamer/11242607.java
delete mode 100644 codes/ subNvue/11264972.java
delete mode 100644 codes/ susuplus/11211308.java
delete mode 100644 codes/ swgger/11211222.java
delete mode 100644 codes/ ttyylb/11228246.java
delete mode 100644 codes/ uioplck/11253331.java
delete mode 100644 codes/ xingwang/11302451.java
delete mode 100644 codes/ zhoucheng/11464584.java
delete mode 100644 codes/ znnzmm/11212509.java
delete mode 100644 codes/ zouyu5521/11464070.java
delete mode 100644 codes/.10968772.java.swo
delete mode 100644 codes/.14612723.java.swp
delete mode 100644 codes/.15531109.java.swp
delete mode 100644 codes/.15781098.java.swp
delete mode 100644 codes/.15823309.java.swp
delete mode 100644 codes/.16199622.java.swp
delete mode 100644 codes/.9947891.java.swp
delete mode 100644 codes/.9947891.swp
delete mode 100644 codes/.9968905.java.swp
delete mode 100644 codes/.DS_Store
delete mode 100644 codes/.keep
delete mode 100644 codes/10971000.java
delete mode 100644 codes/11179070.java
delete mode 100644 codes/11446072.java
delete mode 100644 codes/15527405.java
delete mode 100644 codes/15541001.java
delete mode 100644 codes/15582699.java
delete mode 100644 codes/15585762.java
delete mode 100644 codes/15607358.java
delete mode 100644 codes/15620229.java
delete mode 100644 codes/15636076.java
delete mode 100644 codes/15699820.java
delete mode 100644 codes/15700256.java
delete mode 100644 codes/15700309.java
delete mode 100644 codes/15732362.java
delete mode 100644 codes/15759151.java
delete mode 100644 codes/15775145.java
delete mode 100644 codes/15776507.java
delete mode 100644 codes/15834244.java
delete mode 100644 codes/15845628.java
delete mode 100644 codes/16200342.java
delete mode 100644 codes/17034577.java
delete mode 100644 codes/18149367.java
delete mode 100644 codes/18379057.java
delete mode 100644 codes/9622480.java
delete mode 100644 codes/9785926.java
delete mode 100644 codes/A13230295092/15791717.java
delete mode 100644 codes/A13753608906/15847648.java
delete mode 100644 codes/A13753635706/15847469.java
delete mode 100644 codes/A15579521660/15861437.java
delete mode 100644 codes/A15579541660/15861674.java
delete mode 100644 codes/A15898703309/15820507.java
delete mode 100644 codes/A1607142431/10995009.java
delete mode 100644 codes/A16691797881/15854214.java
delete mode 100644 codes/A17355931314/15646257.java
delete mode 100644 codes/A17730000544/15630407.java
delete mode 100644 codes/A17864114150/15832573.java
delete mode 100644 codes/A17864115054/15528622.java
delete mode 100644 codes/A18172972897/15861687.java
delete mode 100644 codes/A18839698468/15830742.java
delete mode 100644 codes/A19114652439/15836795.java
delete mode 100644 codes/A19127470761/15834094.java
delete mode 100644 codes/A19356583352/15628459.java
delete mode 100644 codes/A19897301746/15836849.java
delete mode 100644 codes/A2606488516/15814309.java
delete mode 100644 codes/A7777777/11213040.java
delete mode 100644 codes/A853047901/.java
delete mode 100644 codes/A853047901/10845109.java
delete mode 100644 codes/A8888888/11187517.java
delete mode 100644 codes/AA15930757026/15765678.java
delete mode 100644 codes/ABOD01/11326499.java
delete mode 100644 codes/ARSHAM/11202647.java
delete mode 100644 codes/ASD8899/.keep
delete mode 100644 codes/ASD8899/15742420.java
delete mode 100644 codes/ASR1523580/15669420.java
delete mode 100644 codes/Aa12345678/.keep
delete mode 100644 codes/Aa12345678/10043731.java
delete mode 100644 codes/Airbnb/11260348.java
delete mode 100644 codes/Allen123/18357308.java
delete mode 100644 codes/Amyaaa/15624605.java
delete mode 100644 codes/Anheqiao/15630084.java
delete mode 100644 codes/Anheqiao0512/15535529.java
delete mode 100644 codes/AnolisOpen/9754131.java
delete mode 100644 codes/AnshunEduc/.keep
delete mode 100644 codes/AnshunEduc/15815295.java
delete mode 100644 codes/AuuuAa/11292635.java
delete mode 100644 codes/Ayj200417/15815229.java
delete mode 100644 codes/Ayuanlou/15592112.java
delete mode 100644 codes/BHUIJ217892/11003994.java
delete mode 100644 codes/BMWAimee/15775743.java
delete mode 100644 codes/BY2487564355/15781003.java
delete mode 100644 codes/Beca0101/11118448.java
delete mode 100644 codes/BitBlitz/.keep
delete mode 100644 codes/BitBlitz/15775656.java
delete mode 100644 codes/Blue_Snow/15778600.java
delete mode 100644 codes/BrokenDreams/11287383.java
delete mode 100644 codes/C15703010346/15826230.java
delete mode 100644 codes/CC422AAACC/.keep
delete mode 100644 codes/CC422AAACC/15742406.java
delete mode 100644 codes/CKXGZXA/14237106.java
delete mode 100644 codes/CMOSInverter/.keep
delete mode 100644 codes/CMOSInverter/15780363.java
delete mode 100644 codes/CS_Joer/11449450.java
delete mode 100644 codes/CY3761/15780413.java
delete mode 100644 codes/Calli990/11027717.java
delete mode 100644 codes/CangBOP/11303209.java
delete mode 100644 codes/Cannon/11268645.java
delete mode 100644 codes/Captaincc/.keep
delete mode 100644 codes/Captaincc/15781895.java
delete mode 100644 codes/Case19523171659/.keep
delete mode 100644 codes/Case19523171659/10972507.java
delete mode 100644 codes/Chailly/15776240.java
delete mode 100644 codes/Charles953/11342263.java
delete mode 100644 codes/Chat-4/11187682.java
delete mode 100644 codes/CheeseMen/11466037.java
delete mode 100644 codes/ChengRunji/15532439.java
delete mode 100644 codes/Chengxiaoyu/15650592.java
delete mode 100644 codes/Chesed/18676140.java
delete mode 100644 codes/Christopher/15635786.java
delete mode 100644 codes/Chuck395/11358350.java
delete mode 100644 codes/Chy3095852337/18699632.java
delete mode 100644 codes/CloudyLemonade/15780990.java
delete mode 100644 codes/Cobytebyte/.keep
delete mode 100644 codes/Cobytebyte/15779518.java
delete mode 100644 codes/Coder_Kang/.keep
delete mode 100644 codes/Coder_Kang/15777819.java
delete mode 100644 codes/Colazxk/9952351.java
delete mode 100644 codes/CuiChenyuan/15758456.java
delete mode 100644 codes/D15059170203/.keep
delete mode 100644 codes/D15059170203/10976249.java
delete mode 100644 codes/DENGXC/10553088.java
delete mode 100644 codes/DFSVVV/16465950.java
delete mode 100644 codes/DH13480641255/15621028.java
delete mode 100644 codes/Daenery/.keep
delete mode 100644 codes/Daenery/15780888.java
delete mode 100644 codes/DaybyDay/11117022.java
delete mode 100644 codes/DeepThinking/11452012.java
delete mode 100644 codes/Dgwoisdg/11001326.java
delete mode 100644 codes/Dobyhe4rts/.keep
delete mode 100644 codes/Dobyhe4rts/15844721.java
delete mode 100644 codes/DongGuoPy/.keep
delete mode 100644 codes/DongGuoPy/15844969.java
delete mode 100644 codes/Dream1tposs/.keep
delete mode 100644 codes/Dream1tposs/15843789.java
delete mode 100644 codes/Dream_37/15775021.java
delete mode 100644 codes/Dreamachine/15834244.java
delete mode 100644 codes/Dreamlover/11202583.java
delete mode 100644 codes/Duvet123/11306690.java
delete mode 100644 codes/DuxiaoJava/.keep
delete mode 100644 codes/DuxiaoJava/15841250.java
delete mode 100644 codes/EthanLeo/10155282.java
delete mode 100644 codes/Evening/15453362.java
delete mode 100644 codes/F5Lauchers/.keep
delete mode 100644 codes/F5Lauchers/15845684.java
delete mode 100644 codes/FEEEDED/15775783.java
delete mode 100644 codes/FE_winter/.keep
delete mode 100644 codes/FE_winter/15781031.java
delete mode 100644 codes/FNCdoinb/.keep
delete mode 100644 codes/FNCdoinb/15845153.java
delete mode 100644 codes/FOYEGE/11326121.java
delete mode 100644 codes/Falcon/17001758.java
delete mode 100644 codes/Faweiya/11259965.java
delete mode 100644 codes/FbxgIt/11302915.java
delete mode 100644 codes/FiberMoney/.keep
delete mode 100644 codes/FiberMoney/15842105.java
delete mode 100644 codes/Fickler/15510871.java
delete mode 100644 codes/Firethrows/.keep
delete mode 100644 codes/Firethrows/15845639.java
delete mode 100644 codes/Fitz_dev/9948244.java
delete mode 100644 codes/Fog16623132936/.keep
delete mode 100644 codes/Fog16623132936/10972627.java
delete mode 100644 codes/Freewarnings/.keep
delete mode 100644 codes/Freewarnings/15841566.java
delete mode 100644 codes/Fulovecode/.keep
delete mode 100644 codes/Fulovecode/15843647.java
delete mode 100644 codes/Fuysus/15342593.java
delete mode 100644 codes/G3264043229/15813840.java
delete mode 100644 codes/G4me4399/.keep
delete mode 100644 codes/G4me4399/15843085.java
delete mode 100644 codes/GIN0001/15777016.java
delete mode 100644 codes/GUIDM1966/15524857.java
delete mode 100644 codes/GZofGO/.keep
delete mode 100644 codes/GZofGO/15846696.java
delete mode 100644 codes/Gesture/11255850.java
delete mode 100644 codes/Ghib66/15510318.java
delete mode 100644 codes/GiteeWy1/.keep
delete mode 100644 codes/GiteeWy1/15843556.java
delete mode 100644 codes/GoStraightOn/14341961.java
delete mode 100644 codes/Golangu4ge/.keep
delete mode 100644 codes/Golangu4ge/15844492.java
delete mode 100644 codes/Greeter/11262621.java
delete mode 100644 codes/Guna777/15714682.java
delete mode 100644 codes/H17630975837/15780333.java
delete mode 100644 codes/H17695838659/15775857.java
delete mode 100644 codes/HCTema/.keep
delete mode 100644 codes/HCTema/15846117.java
delete mode 100644 codes/HMqusi/11299684.java
delete mode 100644 codes/HUmui0101/11027238.java
delete mode 100644 codes/Haichan/15780779.java
delete mode 100644 codes/HandsomeSean/11463861.java
delete mode 100644 codes/HappyJess/16199150.java
delete mode 100644 codes/HappyJess/16200488.java
delete mode 100644 codes/HappyJess/16200532.java
delete mode 100644 codes/HeRuo123/15520250.java
delete mode 100644 codes/HelloWorld1/11257582.java
delete mode 100644 codes/Henriette/11038762.java
delete mode 100644 codes/Hksr223/15534956.java
delete mode 100644 codes/HotSpringEye/11446072.java
delete mode 100644 codes/HsuehBo/18504702.java
delete mode 100644 codes/HunterHans/12287484.java
delete mode 100644 codes/Hybridsky/.keep
delete mode 100644 codes/Hybridsky/15775385.java
delete mode 100644 codes/IM12138/11469383.java
delete mode 100644 codes/IXHE2004/15639769.java
delete mode 100644 codes/Iboydoss/11210866.java
delete mode 100644 codes/IoTanw/11135258.java
delete mode 100644 codes/JJ18809227089/15752040.java
delete mode 100644 codes/JackieYe/15543330.java
delete mode 100644 codes/Jang10/15536247.java
delete mode 100644 codes/January/.keep
delete mode 100644 codes/January/11070767.java
delete mode 100644 codes/JasenChao/13984025.java
delete mode 100644 codes/Jasonakeke/15520912.java
delete mode 100644 codes/Jgf3096619665/15774713.java
delete mode 100644 codes/Jingyu/11302198.java
delete mode 100644 codes/Jinzj_828/15842649.java
delete mode 100644 codes/Juliani/11207255.java
delete mode 100644 codes/K18475329871/15592083.java
delete mode 100644 codes/KEQI73205/.keep
delete mode 100644 codes/KEQI73205/15778430.java
delete mode 100644 codes/Kang12138/15653043.java
delete mode 100644 codes/Keeper/15775425.java
delete mode 100644 codes/KijD_wyp/15647839.java
delete mode 100644 codes/Kio1262902996/11044068.java
delete mode 100644 codes/Kristen/11804698.java
delete mode 100644 codes/L1114867467/15809127.java
delete mode 100644 codes/L13225391057/15834676.java
delete mode 100644 codes/L21362757/15899070.java
delete mode 100644 codes/LIJIAN-yuzhong/16982842.java
delete mode 100644 codes/LJX0857/.keep
delete mode 100644 codes/LJX0857/10042274.java
delete mode 100644 codes/LS2698853114/15540958.java
delete mode 100644 codes/LX2745347279/16198492.java
delete mode 100644 codes/Laodeng/15839462.java
delete mode 100644 codes/LatiaoPro/11352722.java
delete mode 100644 codes/LightLeaf/14443538.java
delete mode 100644 codes/Likui123/.keep
delete mode 100644 codes/Likui123/15713905.java
delete mode 100644 codes/Lishen/.keep
delete mode 100644 codes/Lishen/15630879.java
delete mode 100644 codes/LongXiTWT/.keep
delete mode 100644 codes/LongXiTWT/15840763.java
delete mode 100644 codes/Lorin210926/15605953.java
delete mode 100644 codes/Lovershandd/.keep
delete mode 100644 codes/Lovershandd/15845218.java
delete mode 100644 codes/Lsaoei/15836207.java
delete mode 100644 codes/Lundyli/11471416.java
delete mode 100644 codes/Lyw413181892/15630146.java
delete mode 100644 codes/M8M9900/11211820.java
delete mode 100644 codes/MIngDx/11303026.java
delete mode 100644 codes/ML777-7/15832109.java
delete mode 100644 codes/MardaWang/15960606.java
delete mode 100644 codes/Martin-9527/15628832.java
delete mode 100644 codes/MaxLeton/.15571733.java.swp
delete mode 100644 codes/MaxLeton/15562550.java
delete mode 100644 codes/MaxLeton/15571733.java
delete mode 100644 codes/MaxLeton/15575568.java
delete mode 100644 codes/MaxLeton/15576146.java
delete mode 100644 codes/MaxLeton/15576148.java
delete mode 100644 codes/MaxLeton/15576152.java
delete mode 100644 codes/MaxLeton/15579562.java
delete mode 100644 codes/MaxLeton/15579566.java
delete mode 100644 codes/MaxLeton/15579567.java
delete mode 100644 codes/MaxLeton/15579569.java
delete mode 100644 codes/MaxLeton/15579570.java
delete mode 100644 codes/MaxLeton/15594053.java
delete mode 100644 codes/MaxLeton/15594054.java
delete mode 100644 codes/MaxLeton/15594056.java
delete mode 100644 codes/MaxLeton/15594059.java
delete mode 100644 codes/MaxLeton/15594060.java
delete mode 100644 codes/MaxLeton/15608880.java
delete mode 100644 codes/MaxLeton/15608883.java
delete mode 100644 codes/MaxLeton/15608887.java
delete mode 100644 codes/MaxLeton/15608889.java
delete mode 100644 codes/MaxLeton/15608891.java
delete mode 100644 codes/MaxLeton/15626095.java
delete mode 100644 codes/MaxLeton/15626097.java
delete mode 100644 codes/MaxLeton/15626100.java
delete mode 100644 codes/MaxLeton/15626101.java
delete mode 100644 codes/MaxLeton/15626102.java
delete mode 100644 codes/MaxLeton/15655523.java
delete mode 100644 codes/MaxLeton/15655527.java
delete mode 100644 codes/MaxLeton/15655529.java
delete mode 100644 codes/MaxLeton/15655530.java
delete mode 100644 codes/MaxLeton/15655532.java
delete mode 100644 codes/MaxLeton/15670770.java
delete mode 100644 codes/MaxLeton/15670771.java
delete mode 100644 codes/MaxLeton/15670774.java
delete mode 100644 codes/MaxLeton/15670778.java
delete mode 100644 codes/MaxLeton/15670781.java
delete mode 100644 codes/MaxLeton/15689390.java
delete mode 100644 codes/MaxLeton/15689391.java
delete mode 100644 codes/MaxLeton/15689394.java
delete mode 100644 codes/MaxLeton/15689395.java
delete mode 100644 codes/MaxLeton/15689399.java
delete mode 100644 codes/MaxLeton/15701706.java
delete mode 100644 codes/MaxLeton/15701711.java
delete mode 100644 codes/MaxLeton/15701714.java
delete mode 100644 codes/MaxLeton/15701718.java
delete mode 100644 codes/MaxLeton/15701720.java
delete mode 100644 codes/MaxLeton/15716047.java
delete mode 100644 codes/MaxLeton/15716048.java
delete mode 100644 codes/MaxLeton/15716049.java
delete mode 100644 codes/MaxLeton/15716050.java
delete mode 100644 codes/MaxLeton/15716053.java
delete mode 100644 codes/MaxLeton/15747350.java
delete mode 100644 codes/MaxLeton/15747354.java
delete mode 100644 codes/MaxLeton/15747356.java
delete mode 100644 codes/MaxLeton/15747359.java
delete mode 100644 codes/MaxLeton/15747361.java
delete mode 100644 codes/MaxLeton/16519582.java
delete mode 100644 codes/MaxLeton/16519586.java
delete mode 100644 codes/MaxLeton/16519591.java
delete mode 100644 codes/MaxLeton/16519593.java
delete mode 100644 codes/MaxLeton/16519596.java
delete mode 100644 codes/MaxLeton/17040714.java
delete mode 100644 codes/MaxLeton/17040715.java
delete mode 100644 codes/MaxLeton/17040721.java
delete mode 100644 codes/MaxLeton/17040722.java
delete mode 100644 codes/MaxLeton/17040725.java
delete mode 100644 codes/MaxLeton/17044792.java
delete mode 100644 codes/MaxLeton/17044794.java
delete mode 100644 codes/MaxLeton/17044796.java
delete mode 100644 codes/MaxLeton/17044797.java
delete mode 100644 codes/MaxLeton/17044800.java
delete mode 100644 codes/MaxLeton/17061868.java
delete mode 100644 codes/MaxLeton/17061869.java
delete mode 100644 codes/MaxLeton/17061870.java
delete mode 100644 codes/MaxLeton/17061871.java
delete mode 100644 codes/MaxLeton/17061873.java
delete mode 100644 codes/MaxLeton/17066605.java
delete mode 100644 codes/MaxLeton/17066607.java
delete mode 100644 codes/MaxLeton/17066608.java
delete mode 100644 codes/MaxLeton/17066609.java
delete mode 100644 codes/MaxLeton/17066611.java
delete mode 100644 codes/MaxLeton/17066615.java
delete mode 100644 codes/MaxLeton/17067867.java
delete mode 100644 codes/MaxLeton/17067870.java
delete mode 100644 codes/MaxLeton/17067871.java
delete mode 100644 codes/MaxLeton/17067872.java
delete mode 100644 codes/MaxLeton/17067874.java
delete mode 100644 codes/MaxLeton/17084198.java
delete mode 100644 codes/MaxLeton/17084201.java
delete mode 100644 codes/MaxLeton/17084202.java
delete mode 100644 codes/MaxLeton/17084204.java
delete mode 100644 codes/MaxLeton/17084206.java
delete mode 100644 codes/MaxLeton/17104411.java
delete mode 100644 codes/MaxLeton/17104414.java
delete mode 100644 codes/MaxLeton/17104415.java
delete mode 100644 codes/MaxLeton/17104420.java
delete mode 100644 codes/MaxLeton/17104424.java
delete mode 100644 codes/MaxLeton/17118929.java
delete mode 100644 codes/MaxLeton/17118934.java
delete mode 100644 codes/MaxLeton/17118937.java
delete mode 100644 codes/MaxLeton/17118939.java
delete mode 100644 codes/MaxLeton/17118941.java
delete mode 100644 codes/MaxLeton/17128518.java
delete mode 100644 codes/MaxLeton/17128519.java
delete mode 100644 codes/MaxLeton/17128522.java
delete mode 100644 codes/MaxLeton/17128527.java
delete mode 100644 codes/MaxLeton/17128530.java
delete mode 100644 codes/MaxLeton/17142779.java
delete mode 100644 codes/MaxLeton/17142782.java
delete mode 100644 codes/MaxLeton/17142783.java
delete mode 100644 codes/MaxLeton/17142784.java
delete mode 100644 codes/MaxLeton/17142785.java
delete mode 100644 codes/MaxLeton/17150613.java
delete mode 100644 codes/MaxLeton/17150614.java
delete mode 100644 codes/MaxLeton/17150616.java
delete mode 100644 codes/MaxLeton/17150617.java
delete mode 100644 codes/MaxLeton/17150619.java
delete mode 100644 codes/MaxLeton/17168898.java
delete mode 100644 codes/MaxLeton/17168901.java
delete mode 100644 codes/MaxLeton/17168903.java
delete mode 100644 codes/MaxLeton/17168905.java
delete mode 100644 codes/MaxLeton/17168907.java
delete mode 100644 codes/MaxLeton/17185943.java
delete mode 100644 codes/MaxLeton/17185948.java
delete mode 100644 codes/MaxLeton/17185950.java
delete mode 100644 codes/MaxLeton/17185953.java
delete mode 100644 codes/MaxLeton/17185957.java
delete mode 100644 codes/MaxLeton/17199424.java
delete mode 100644 codes/MaxLeton/17199427.java
delete mode 100644 codes/MaxLeton/17199429.java
delete mode 100644 codes/MaxLeton/17199431.java
delete mode 100644 codes/MaxLeton/17199433.java
delete mode 100644 codes/MaxLeton/17212361.java
delete mode 100644 codes/MaxLeton/17212364.java
delete mode 100644 codes/MaxLeton/17212369.java
delete mode 100644 codes/MaxLeton/17212370.java
delete mode 100644 codes/MaxLeton/17212371.java
delete mode 100644 codes/Melantha/15775251.java
delete mode 100644 codes/Meng527/10036105.java
delete mode 100644 codes/Monorepo/11203800.java
delete mode 100644 codes/Mrzhao/11115789.java
delete mode 100644 codes/Mu2024s/.keep
delete mode 100644 codes/Mu2024s/15843378.java
delete mode 100644 codes/MuZiNan/.15657839.java.swp
delete mode 100644 codes/MuZiNan/10041393.java
delete mode 100644 codes/MuZiNan/15657839.java
delete mode 100644 codes/Muzizy/15639710.java
delete mode 100644 codes/Myron520/15614791.java
delete mode 100644 codes/N193560C/15816303.java
delete mode 100644 codes/NANF41/11116589.java
delete mode 100644 codes/NPUlhy/18473575.java
delete mode 100644 codes/NProgress/11324505.java
delete mode 100644 codes/NX9990/15752874.java
delete mode 100644 codes/NXJ19563886818/15812590.java
delete mode 100644 codes/Namesp4ces/.keep
delete mode 100644 codes/Namesp4ces/15839516.java
delete mode 100644 codes/Navigation1/11130536.java
delete mode 100644 codes/NeilGCT/15827010.java
delete mode 100644 codes/Ni123456/15562619.java
delete mode 100644 codes/Ni123456/15630872.java
delete mode 100644 codes/OPReno/11276365.java
delete mode 100644 codes/OVO16199/15832632.java
delete mode 100644 codes/OceanBase/11302025.java
delete mode 100644 codes/Ohiyo123ywj/.keep
delete mode 100644 codes/Ohiyo123ywj/15843898.java
delete mode 100644 codes/OnMoreTime/10860781.java
delete mode 100644 codes/OneMuMu/11370801.java
delete mode 100644 codes/OutlEts/11343931.java
delete mode 100644 codes/P4rt01/15689858.java
delete mode 100644 codes/PHPhph/11120724.java
delete mode 100644 codes/PUAdewo/11303488.java
delete mode 100644 codes/Pengyouyou/15805929.java
delete mode 100644 codes/PexoPexo/11116939.java
delete mode 100644 codes/Platform/11203867.java
delete mode 100644 codes/PunkHeart/16456064.java
delete mode 100644 codes/Q13944328337/15841142.java
delete mode 100644 codes/Q18379787658/15861304.java
delete mode 100644 codes/Q2529807676/15563540.java
delete mode 100644 codes/Q8888688888/11213062.java
delete mode 100644 codes/QQ504113939/15788225.java
delete mode 100644 codes/QiQi77/15719621.java
delete mode 100644 codes/Qking123/.15572198.java.swp
delete mode 100644 codes/Qking123/15572198.java
delete mode 100644 codes/Qw2229188799/11089611.java
delete mode 100644 codes/Qw25526/11118523.java
delete mode 100644 codes/Renswc/15592706.java
delete mode 100644 codes/Rudy1113693166/15803796.java
delete mode 100644 codes/S17673074125/15793739.java
delete mode 100644 codes/S19353041250/15722104.java
delete mode 100644 codes/SHALRU/15632282.java
delete mode 100644 codes/SJq123456/.keep
delete mode 100644 codes/SJq123456/15846703.java
delete mode 100644 codes/Sakura125809/15297826.java
delete mode 100644 codes/Setinsung/.java
delete mode 100644 codes/Setinsung/9697451.java
delete mode 100644 codes/ShaoXuan/12173130.java
delete mode 100644 codes/Sharpery/15562912.java
delete mode 100644 codes/Shephatiah/18693174.java
delete mode 100644 codes/SherlockZ/10666019.java
delete mode 100644 codes/Shirley1/11532521.java
delete mode 100644 codes/Shirley1/15780774.java
delete mode 100644 codes/ShowBuger/11475929.java
delete mode 100644 codes/SmileWen/15629004.java
delete mode 100644 codes/Snngulaf/15527734.java
delete mode 100644 codes/Snowfalls360/.keep
delete mode 100644 codes/Snowfalls360/15843952.java
delete mode 100644 codes/Springboot/11121747.java
delete mode 100644 codes/Stonehuara/.keep
delete mode 100644 codes/Stonehuara/15845722.java
delete mode 100644 codes/StorIesc/11471295.java
delete mode 100644 codes/String/11118586.java
delete mode 100644 codes/TCplcker/11207395.java
delete mode 100644 codes/TIANGESEC/15563393.java
delete mode 100644 codes/TJ0000/15529221.java
delete mode 100644 codes/TPL666/11306800.java
delete mode 100644 codes/TR9559559555/15866725.java
delete mode 100644 codes/TV18625742058/15860990.java
delete mode 100644 codes/TXMQQ4/15716488.java
delete mode 100644 codes/TYboy2/11228569.java
delete mode 100644 codes/TheZeroSunset/15775069.java
delete mode 100644 codes/Tianxuan/11468972.java
delete mode 100644 codes/Tomimi/18424592.java
delete mode 100644 codes/Tomorrowed/11451791.java
delete mode 100644 codes/TonyStark_/15684919.java
delete mode 100644 codes/Tory666/11472343.java
delete mode 100644 codes/Tptogiar/10332054.java
delete mode 100644 codes/UMide9/11292872.java
delete mode 100644 codes/UOAN29/15805546.java
delete mode 100644 codes/UsoDtst/.keep
delete mode 100644 codes/UsoDtst/11120436.java
delete mode 100644 codes/Vanish/15774749.java
delete mode 100644 codes/VincentHuang218/11469479.java
delete mode 100644 codes/W2045396389/15630059.java
delete mode 100644 codes/W2848330317/15830359.java
delete mode 100644 codes/W4tcherLock/.keep
delete mode 100644 codes/W4tcherLock/15847592.java
delete mode 100644 codes/WML321/15517626.java
delete mode 100644 codes/WQ18355919568/15742272.java
delete mode 100644 codes/W_changing/15829938.java
delete mode 100644 codes/Weiyi888/.keep
delete mode 100644 codes/Weiyi888/15720599.java
delete mode 100644 codes/Whk15038723546/15482712.java
delete mode 100644 codes/Wiarrara/.keep
delete mode 100644 codes/Wiarrara/15845136.java
delete mode 100644 codes/Wilmothe/15592034.java
delete mode 100644 codes/Winnie/.keep
delete mode 100644 codes/Winnie/10042948.java
delete mode 100644 codes/Wiseung/15774607.java
delete mode 100644 codes/WpWwangpeng/.keep
delete mode 100644 codes/WpWwangpeng/10039890.java
delete mode 100644 codes/Wu18703486053/15850317.java
delete mode 100644 codes/Wybzshuai/.keep
delete mode 100644 codes/Wybzshuai/10980502.java
delete mode 100644 codes/Wyh005116/15858691.java
delete mode 100644 codes/XHrcool/.keep
delete mode 100644 codes/XHrcool/15842556.java
delete mode 100644 codes/XUANAIQ/15635606.java
delete mode 100644 codes/XUEMAO/15513347.java
delete mode 100644 codes/XXOPQQ/11202216.java
delete mode 100644 codes/XiaoBoBo/15528811.java
delete mode 100644 codes/XiaoYu/15641195.java
delete mode 100644 codes/Y158505/.keep
delete mode 100644 codes/Y158505/10040580.java
delete mode 100644 codes/Y18379639840/15861186.java
delete mode 100644 codes/Y2602388224/15856296.java
delete mode 100644 codes/YYDS2023/11094401.java
delete mode 100644 codes/Yanghw/16081530.java
delete mode 100644 codes/Yangtzev/15774600.java
delete mode 100644 codes/Yefori/15536426.java
delete mode 100644 codes/Yefori/15536527.java
delete mode 100644 codes/YixinTian/11315888.java
delete mode 100644 codes/Ys888888/.keep
delete mode 100644 codes/Ys888888/15780625.java
delete mode 100644 codes/Yuan10001/15307047.java
delete mode 100644 codes/Yuan_559/10716235.java
delete mode 100644 codes/Yy7110829/15834374.java
delete mode 100644 codes/Z18182089257/15541298.java
delete mode 100644 codes/Z1831847001/.keep
delete mode 100644 codes/Z1831847001/10985387.java
delete mode 100644 codes/Z19849217092/15835445.java
delete mode 100644 codes/Z3608759124/.keep
delete mode 100644 codes/Z3608759124/10979186.java
delete mode 100644 codes/Z3n1th/15536338.java
delete mode 100644 codes/ZXCV2288/.keep
delete mode 100644 codes/ZXCV2288/15820903.java
delete mode 100644 codes/ZYwj4399/.keep
delete mode 100644 codes/ZYwj4399/15846689.java
delete mode 100644 codes/ZZH1331065/15816621.java
delete mode 100644 codes/ZZQeducation/.keep
delete mode 100644 codes/ZZQeducation/15846342.java
delete mode 100644 codes/ZeroSunset/15775945.java
delete mode 100644 codes/ZhangKai/11036581.java
delete mode 100644 codes/Zhangzy/15657994.java
delete mode 100644 codes/Zhihua611/.keep
delete mode 100644 codes/Zhihua611/15840830.java
delete mode 100644 codes/Zhongjin123/.keep
delete mode 100644 codes/Zhongjin123/15846007.java
delete mode 100644 codes/ZianChang/15775142.java
delete mode 100644 codes/ZoeLeo010/15732573.java
delete mode 100644 codes/Zoey12138/15846229.java
delete mode 100644 codes/Ztmanners/.keep
delete mode 100644 codes/Ztmanners/15844065.java
delete mode 100644 codes/ZxCvBnM321/15837924.java
delete mode 100644 codes/a04040404/15774714.java
delete mode 100644 codes/a1034852656/.keep
delete mode 100644 codes/a1034852656/10993428.java
delete mode 100644 codes/a123cwl/15774901.java
delete mode 100644 codes/a13579/15776164.java
delete mode 100644 codes/a13919519903/15854734.java
delete mode 100644 codes/a17537741744/15835967.java
delete mode 100644 codes/a18342002424/15861602.java
delete mode 100644 codes/a18352134184/15861238.java
delete mode 100644 codes/a18370978367/15620229.java
delete mode 100644 codes/a18377237158/.keep
delete mode 100644 codes/a18377237158/10978793.java
delete mode 100644 codes/a18573769257/15857971.java
delete mode 100644 codes/a19173568702/15849477.java
delete mode 100644 codes/a2159028620/.keep
delete mode 100644 codes/a2159028620/10980184.java
delete mode 100644 codes/a2313064922/15679065.java
delete mode 100644 codes/a2505934241/15859458.java
delete mode 100644 codes/a2523760784/9941105.java
delete mode 100644 codes/a2554028123/.keep
delete mode 100644 codes/a2554028123/10984030.java
delete mode 100644 codes/a2565345148/15777154.java
delete mode 100644 codes/a2565345148/15831524.java
delete mode 100644 codes/a2667860490/15858891.java
delete mode 100644 codes/a2942278197/15788264.java
delete mode 100644 codes/a3681298224/15797237.java
delete mode 100644 codes/a6765357/15866940.java
delete mode 100644 codes/a857934324/15786660.java
delete mode 100644 codes/a940959221/15733763.java
delete mode 100644 codes/aAuely/15714122.java
delete mode 100644 codes/a_0650/15775427.java
delete mode 100644 codes/aa123456789/15808647.java
delete mode 100644 codes/aaa_zzz/15684144.java
delete mode 100644 codes/aaajiancai/15816333.java
delete mode 100644 codes/aamphiprioninae/18302197.java
delete mode 100644 codes/aas123/15713924.java
delete mode 100644 codes/aass123/15720115.java
delete mode 100644 codes/aassdd/15775537.java
delete mode 100644 codes/abaoge/15684921.java
delete mode 100644 codes/abaper/.keep
delete mode 100644 codes/abaper/10978249.java
delete mode 100644 codes/acc8226/15757227.java
delete mode 100644 codes/achun123/15779154.java
delete mode 100644 codes/acloudio/11274672.java
delete mode 100644 codes/activemy/14206633.java
delete mode 160000 codes/activity-school
delete mode 100644 codes/adasdas34/.keep
delete mode 100644 codes/adasdas34/15827500.java
delete mode 100644 codes/addqian/14612723.java
delete mode 100644 codes/address/11226902.java
delete mode 100644 codes/admin228855/10967397.java
delete mode 100644 codes/adminuser/10040823.java
delete mode 100644 codes/adsf45362/.keep
delete mode 100644 codes/adsf45362/15743460.java
delete mode 100644 codes/af345sdga/.keep
delete mode 100644 codes/af345sdga/15743439.java
delete mode 100644 codes/afasfasf24214/.keep
delete mode 100644 codes/afasfasf24214/15743480.java
delete mode 100644 codes/afssaffc774/.keep
delete mode 100644 codes/afssaffc774/15831351.java
delete mode 100644 codes/aikun66/15577937.java
delete mode 100644 codes/airgege/.keep
delete mode 100644 codes/airgege/15850162.java
delete mode 100644 codes/aiyowei12366/.keep
delete mode 100644 codes/aiyowei12366/15798748.java
delete mode 100644 codes/alchemists/.keep
delete mode 100644 codes/alchemists/15772130.java
delete mode 100644 codes/alleylyf666/.keep
delete mode 100644 codes/alleylyf666/15844554.java
delete mode 100644 codes/amoxilin/15519580.java
delete mode 100644 codes/an629712562/.keep
delete mode 100644 codes/an629712562/15629207.java
delete mode 100644 codes/andng00/.keep
delete mode 100644 codes/andng00/15836934.java
delete mode 100644 codes/angel521/15721117.java
delete mode 100644 codes/anqi12301/15532075.java
delete mode 100644 codes/aqbodc/15816413.java
delete mode 100644 codes/argument/11235878.java
delete mode 100644 codes/aria111/.keep
delete mode 100644 codes/aria111/10043458.java
delete mode 100644 codes/arvinsblog/15525225.java
delete mode 100644 codes/as1234567890/.keep
delete mode 100644 codes/as1234567890/10979740.java
delete mode 100644 codes/asdafcv22/.keep
delete mode 100644 codes/asdafcv22/15742508.java
delete mode 100644 codes/asen_1898/15541357.java
delete mode 100644 codes/asf1afasd4/.keep
delete mode 100644 codes/asf1afasd4/15831471.java
delete mode 100644 codes/asf424524sa/.keep
delete mode 100644 codes/asf424524sa/15830408.java
delete mode 100644 codes/asf435adf/.keep
delete mode 100644 codes/asf435adf/15743462.java
delete mode 100644 codes/asfafas8931/.keep
delete mode 100644 codes/asfafas8931/15831378.java
delete mode 100644 codes/asfasc228/.keep
delete mode 100644 codes/asfasc228/15831133.java
delete mode 100644 codes/asfasfa22/.keep
delete mode 100644 codes/asfasfa22/15742636.java
delete mode 100644 codes/asfasfa22/15864908.java
delete mode 100644 codes/asffasf67/.keep
delete mode 100644 codes/asffasf67/15743465.java
delete mode 100644 codes/asffsac224/.keep
delete mode 100644 codes/asffsac224/15831080.java
delete mode 100644 codes/asfsafaf223/.keep
delete mode 100644 codes/asfsafaf223/15743410.java
delete mode 100644 codes/asfsyw34124/.keep
delete mode 100644 codes/asfsyw34124/15830756.java
delete mode 100644 codes/aurorawhite/15775954.java
delete mode 100644 codes/aurorawhite03/15831384.java
delete mode 100644 codes/aurorawhite04/15837015.java
delete mode 100644 codes/avania/14344405.java
delete mode 100644 codes/aweige/.keep
delete mode 100644 codes/aweige/15855036.java
delete mode 100644 codes/azhen666/15569325.java
delete mode 100644 codes/b1t333/12428176.java
delete mode 100644 codes/b2247960736/15520708.java
delete mode 100644 codes/bIU999lve/.keep
delete mode 100644 codes/bIU999lve/11090549.java
delete mode 100644 codes/babala/15779520.java
delete mode 100644 codes/babale/15775745.java
delete mode 100644 codes/baiwenyu/.15781013.java.swp
delete mode 100644 codes/baiwenyu/15781013.java
delete mode 100644 codes/baixiaobai/15198492.java
delete mode 100644 codes/baixiaobai/15198733.java
delete mode 100644 codes/baixiaobai/15198745.java
delete mode 100644 codes/baixiaobai/15199487.java
delete mode 100644 codes/banlala/15846317.java
delete mode 100644 codes/baozhang/.keep
delete mode 100644 codes/baozhang/15860610.java
delete mode 100644 codes/bbb222/.keep
delete mode 100644 codes/bbb222/15831163.java
delete mode 100644 codes/bbswangzhs/.keep
delete mode 100644 codes/bbswangzhs/15844812.java
delete mode 100644 codes/bc521bc/9954342.java
delete mode 100644 codes/bc99991/11118867.java
delete mode 100644 codes/beaker123/15831015.java
delete mode 100644 codes/beaker1234/15831394.java
delete mode 100644 codes/bei123/15714125.java
delete mode 100644 codes/beibeiya/15775215.java
delete mode 100644 codes/beiyang/.keep
delete mode 100644 codes/beiyang/15851229.java
delete mode 100644 codes/benben/15721436.java
delete mode 100644 codes/bertao/11204465.java
delete mode 100644 codes/bic-omg/.keep
delete mode 100644 codes/bic-omg/10972075.java
delete mode 100644 codes/biechigege/18629854.java
delete mode 100644 codes/biechigege/18653461.java
delete mode 100644 codes/bigDog/11298506.java
delete mode 100644 codes/bitexplorers/.keep
delete mode 100644 codes/bitexplorers/15774316.java
delete mode 100644 codes/bjfuhyk26/15775960.java
delete mode 100644 codes/blackgaryc/14345942.java
delete mode 100644 codes/bless_qian/15628082.java
delete mode 100644 codes/blingpotato/15623762.java
delete mode 100644 codes/blockup/15585762.java
delete mode 100644 codes/bmyy111/15635777.java
delete mode 100644 codes/book123/15699999.java
delete mode 100644 codes/bopiox/11219150.java
delete mode 100644 codes/bowen123456/.keep
delete mode 100644 codes/bowen123456/15815214.java
delete mode 100644 codes/buaa562/15843584.java
delete mode 100644 codes/budasan/11121691.java
delete mode 100644 codes/buffoZipper/.keep
delete mode 100644 codes/buffoZipper/15842330.java
delete mode 100644 codes/buhuiruner/.keep
delete mode 100644 codes/buhuiruner/15842260.java
delete mode 100644 codes/buhuizhiyuqianduan/11245496.java
delete mode 100644 codes/bujin521/11301842.java
delete mode 100644 codes/bundle/11196164.java
delete mode 100644 codes/bupiovm0101/11122657.java
delete mode 100644 codes/bushioo/11276443.java
delete mode 100644 codes/buzhidao/11118686.java
delete mode 100644 codes/bzy-080408/18668050.java
delete mode 100644 codes/c1444444444/15811953.java
delete mode 100644 codes/c1484941716/15859323.java
delete mode 100644 codes/ca3130049622/15790269.java
delete mode 100644 codes/cai0002/15520914.java
delete mode 100644 codes/cai001/15520883.java
delete mode 100644 codes/caishen/.keep
delete mode 100644 codes/caishen/15856729.java
delete mode 100644 codes/caiyanghong/15835895.java
delete mode 100644 codes/caizengming/15396209.java
delete mode 100644 codes/caozhou/10869186.java
delete mode 100644 codes/captaining/15614511.java
delete mode 100644 codes/carino5555/15527193.java
delete mode 100644 codes/caroline/15374117.java
delete mode 100644 codes/cccqqq/.keep
delete mode 100644 codes/cccqqq/10039861.java
delete mode 100644 codes/ccone123/15713748.java
delete mode 100644 codes/ccout0/12264632.java
delete mode 100644 codes/cenm00/15829376.java
delete mode 100644 codes/ceshi001/.keep
delete mode 100644 codes/ceshi001/9637800.java
delete mode 100644 codes/cghg547546/.keep
delete mode 100644 codes/cghg547546/15743428.java
delete mode 100644 codes/changgeng/16563760.java
delete mode 100644 codes/chanziruu/.keep
delete mode 100644 codes/chanziruu/10042211.java
delete mode 100644 codes/chase11/15577508.java
delete mode 100644 codes/chenabing/15724269.java
delete mode 100644 codes/chenchen1234/15630722.java
delete mode 100644 codes/chency/15542287.java
delete mode 100644 codes/chengchen/10039151.java
delete mode 100644 codes/chengqi/.keep
delete mode 100644 codes/chengqi/15845978.java
delete mode 100644 codes/chengzhi/11005917.java
delete mode 100644 codes/chenhan1129/15542140.java
delete mode 100644 codes/chenqiuyun/15860178.java
delete mode 100644 codes/chenwy/15816299.java
delete mode 100644 codes/chenyongru/.keep
delete mode 100644 codes/chenyongru/15764377.java
delete mode 100644 codes/chenyunhao/15874841.java
delete mode 100644 codes/chenzhongyao/15851007.java
delete mode 100644 codes/cherryaini/.keep
delete mode 100644 codes/cherryaini/15838357.java
delete mode 100644 codes/cherrypocky/15837631.java
delete mode 100644 codes/chnechenya/15815769.java
delete mode 100644 codes/chris2024/15600397.java
delete mode 100644 codes/chuyuxuan/15685256.java
delete mode 100644 codes/cieasefires/.keep
delete mode 100644 codes/cieasefires/15844532.java
delete mode 100644 codes/ckx1234/15830693.java
delete mode 100644 codes/ckx17837725358/15859776.java
delete mode 100644 codes/clausliang/11466217.java
delete mode 100644 codes/cloudchasers/.keep
delete mode 100644 codes/cloudchasers/15772624.java
delete mode 100644 codes/cly2589/15577808.java
delete mode 100644 codes/cmosinverter/15780363.java
delete mode 100644 codes/coco08/11244510.java
delete mode 100644 codes/codeelite/.keep
delete mode 100644 codes/codeelite/15774516.java
delete mode 100644 codes/codemovers/.keep
delete mode 100644 codes/codemovers/15776343.java
delete mode 100644 codes/codeshallow/.java
delete mode 100644 codes/codeshallow/9947400.java
delete mode 100644 codes/comTom/10859102.java
delete mode 100644 codes/comefly/16334983.java
delete mode 100644 codes/conanz/.keep
delete mode 100644 codes/conanz/10041693.java
delete mode 100644 codes/coo6666/11212756.java
delete mode 100644 codes/coolbob/11342463.java
delete mode 100644 codes/coreliu/9889405.java
delete mode 100644 codes/coshpr/18429589.java
delete mode 100644 codes/course/15530455.java
delete mode 100644 codes/cppdkuo/11329887.java
delete mode 100644 codes/cr12345/.keep
delete mode 100644 codes/cr12345/10985032.java
delete mode 100644 codes/craftsmen/.keep
delete mode 100644 codes/craftsmen/15775673.java
delete mode 100644 codes/credit/15777503.java
delete mode 100644 codes/crh111/15562582.java
delete mode 100644 codes/cslearn/10428388.java
delete mode 100644 codes/cstzt6/15454369.java
delete mode 100644 codes/cstzt6/16340693.java
delete mode 100644 codes/cumtsgw/.15377867.java.swp
delete mode 100644 codes/cumtsgw/15377867.java
delete mode 100644 codes/current/11226352.java
delete mode 100644 codes/cursor/.java
delete mode 100644 codes/cursor/13859449.java
delete mode 100644 codes/cwt1216/15777958.java
delete mode 100644 codes/cxy11/15898495.java
delete mode 100644 codes/cxy2801439718/15898495.java
delete mode 100644 codes/cyanide/15311596.java
delete mode 100644 codes/cybernexuss/.keep
delete mode 100644 codes/cybernexuss/15776044.java
delete mode 100644 codes/cyberwarriors/.keep
delete mode 100644 codes/cyberwarriors/15771923.java
delete mode 100644 codes/cyc991026/.keep
delete mode 100644 codes/cyc991026/10042475.java
delete mode 100644 codes/cyqlxxy/15777955.java
delete mode 100644 codes/cyrusyu/11179070.java
delete mode 100644 codes/dabing/.keep
delete mode 100644 codes/dabing/15831131.java
delete mode 100644 codes/daisyw0221/15531109.java
delete mode 100644 codes/damingya/15777770.java
delete mode 100644 codes/dappwwww/10999016.java
delete mode 100644 codes/darkfu/15693973.java
delete mode 100644 codes/dasdasd2341/.keep
delete mode 100644 codes/dasdasd2341/15743468.java
delete mode 100644 codes/dasdasd2341/15799082.java
delete mode 100644 codes/dashengfa/15837719.java
delete mode 100644 codes/datacubes/.keep
delete mode 100644 codes/datacubes/15775733.java
delete mode 100644 codes/datudou/15775955.java
delete mode 100644 codes/dawnli/15533387.java
delete mode 100644 codes/daxiong/.keep
delete mode 100644 codes/daxiong/15846450.java
delete mode 100644 codes/dayeee/12165634.java
delete mode 100644 codes/dayuya/10044865.java
delete mode 100644 codes/ddi123456/15775627.java
delete mode 100644 codes/ddl667/.keep
delete mode 100644 codes/ddl667/15814859.java
delete mode 100644 codes/deCoder2024/.keep
delete mode 100644 codes/deCoder2024/15847492.java
delete mode 100644 codes/deaita/.keep
delete mode 100644 codes/deaita/15845569.java
delete mode 100644 codes/dedeya/15742795.java
delete mode 100644 codes/deijia909/11468750.java
delete mode 100644 codes/dekali/.keep
delete mode 100644 codes/dekali/15845962.java
delete mode 100644 codes/denghaodongmy123/.keep
delete mode 100644 codes/denghaodongmy123/15838830.java
delete mode 100644 codes/devinroot/9687540.java
delete mode 100644 codes/df452aff/.keep
delete mode 100644 codes/df452aff/15831296.java
delete mode 100644 codes/dfg56tsdfas/.keep
delete mode 100644 codes/dfg56tsdfas/15743482.java
delete mode 100644 codes/dfghrtdfgge5/.keep
delete mode 100644 codes/dfghrtdfgge5/15828963.java
delete mode 100644 codes/dgq420377903/.keep
delete mode 100644 codes/dgq420377903/15776080.java
delete mode 100644 codes/diantun00/13629189.java
delete mode 100644 codes/dioopp/11292585.java
delete mode 100644 codes/disaner/.keep
delete mode 100644 codes/disaner/15798333.java
delete mode 100644 codes/dishierge/.keep
delete mode 100644 codes/dishierge/15758829.java
delete mode 100644 codes/dishige/.keep
delete mode 100644 codes/dishige/15758406.java
delete mode 100644 codes/dishijiuge/.keep
delete mode 100644 codes/dishijiuge/15759226.java
delete mode 100644 codes/dishiliuge/.keep
delete mode 100644 codes/dishiliuge/15759149.java
delete mode 100644 codes/dishiqige/.keep
delete mode 100644 codes/dishiqige/15759140.java
delete mode 100644 codes/dishisi/.keep
delete mode 100644 codes/dishisi/15758975.java
delete mode 100644 codes/dishissange/.keep
delete mode 100644 codes/dishissange/15759022.java
delete mode 100644 codes/dishiwuge/.keep
delete mode 100644 codes/dishiwuge/15759050.java
delete mode 100644 codes/dist11/15779201.java
delete mode 100644 codes/dist22/15779370.java
delete mode 100644 codes/dist33/15779447.java
delete mode 100644 codes/dist55/15779566.java
delete mode 100644 codes/dist66/15782518.java
delete mode 100644 codes/dist77/15782715.java
delete mode 100644 codes/dist88/15782777.java
delete mode 100644 codes/dist99/15782896.java
delete mode 100644 codes/diudiuge12262792/15499955.java
delete mode 100644 codes/dkptlv/15520718.java
delete mode 100644 codes/dmw681/16541740.java
delete mode 100644 codes/dogepalm/.keep
delete mode 100644 codes/dogepalm/15845073.java
delete mode 100644 codes/downsider/.keep
delete mode 100644 codes/downsider/15814998.java
delete mode 100644 codes/dragg123/15718958.java
delete mode 100644 codes/dragonir/11357510.java
delete mode 100644 codes/dsfggsd445/.keep
delete mode 100644 codes/dsfggsd445/15828546.java
delete mode 100644 codes/dsfsqerada33/.keep
delete mode 100644 codes/dsfsqerada33/15743351.java
delete mode 100644 codes/duanshusheng/15508667.java
delete mode 100644 codes/duanxintao/15684621.java
delete mode 100644 codes/duixiang/.keep
delete mode 100644 codes/duixiang/15814647.java
delete mode 100644 codes/dulong/11749087.java
delete mode 100644 codes/dundun/15861800.java
delete mode 100644 codes/duoduo172/15759065.java
delete mode 100644 codes/duzidundun/15860749.java
delete mode 100644 codes/duziteng/10968772.java
delete mode 100644 codes/dxr13146640122/15867024.java
delete mode 100644 codes/dxy18882636878/15829939.java
delete mode 100644 codes/ebb29bbe/9945255.java
delete mode 100644 codes/educ157441/.keep
delete mode 100644 codes/educ157441/15842827.java
delete mode 100644 codes/ee858882845/15848149.java
delete mode 100644 codes/eedd22/15875744.java
delete mode 100644 codes/ekdher/11188020.java
delete mode 100644 codes/ekwwu1/11122460.java
delete mode 100644 codes/enRENE1/11005023.java
delete mode 100644 codes/enkilee/15372338.java
delete mode 100644 codes/enoughisenough/11364587.java
delete mode 100644 codes/ergeren/.keep
delete mode 100644 codes/ergeren/15799133.java
delete mode 100644 codes/ericxu/16282084.java
delete mode 100644 codes/ewrt3425sdfs/.keep
delete mode 100644 codes/ewrt3425sdfs/15831329.java
delete mode 100644 codes/express77/15513152.java
delete mode 100644 codes/ezh3wx95/11002373.java
delete mode 100644 codes/f13306939842/.keep
delete mode 100644 codes/f13306939842/10968297.java
delete mode 100644 codes/f18967940562/.keep
delete mode 100644 codes/f18967940562/10972030.java
delete mode 100644 codes/f19555076671/15837167.java
delete mode 100644 codes/f370857894/.keep
delete mode 100644 codes/f370857894/10970517.java
delete mode 100644 codes/f435wedt/.keep
delete mode 100644 codes/f435wedt/15743453.java
delete mode 100644 codes/f456af67654/.keep
delete mode 100644 codes/f456af67654/15743470.java
delete mode 100644 codes/f734tasaf/.keep
delete mode 100644 codes/f734tasaf/15743456.java
delete mode 100644 codes/fangfangha/15775625.java
delete mode 100644 codes/fanghua/.keep
delete mode 100644 codes/fanghua/10971642.java
delete mode 100644 codes/fangqb/.keep
delete mode 100644 codes/fangqb/10043498.java
delete mode 100644 codes/fangying1/.keep
delete mode 100644 codes/fangying1/10968297.java
delete mode 100644 codes/fasfaf227/.keep
delete mode 100644 codes/fasfaf227/15820189.java
delete mode 100644 codes/fasfasfas234/.keep
delete mode 100644 codes/fasfasfas234/15743358/15743358.java
delete mode 100644 codes/fasfasfas234/15830971.java
delete mode 100644 codes/fasfsa2412/.keep
delete mode 100644 codes/fasfsa2412/15743474.java
delete mode 100644 codes/fasfsaf292/.keep
delete mode 100644 codes/fasfsaf292/15743418.java
delete mode 100644 codes/fasfsf2442/.keep
delete mode 100644 codes/fasfsf2442/15831391.java
delete mode 100644 codes/fasioc924/.keep
delete mode 100644 codes/fasioc924/15743426.java
delete mode 100644 codes/fasttiger/10143432.java
delete mode 100644 codes/fcc321/15630159.java
delete mode 100644 codes/feifeixi/15846547.java
delete mode 100644 codes/feihudui/.keep
delete mode 100644 codes/feihudui/15846656.java
delete mode 100644 codes/feipao/11252573.java
delete mode 100644 codes/feiya123/15719128.java
delete mode 100644 codes/fendou/15635967.java
delete mode 100644 codes/feng666/15777226.java
delete mode 100644 codes/fengling/15838545.java
delete mode 100644 codes/fengshang/15510907.java
delete mode 100644 codes/fengshang/fengshang/15510907.java
delete mode 100644 codes/fengyeorz/15629835.java
delete mode 100644 codes/fengyu176/15759028.java
delete mode 100644 codes/fhbb111/15605446.java
delete mode 100644 codes/fhkjhkl876/.keep
delete mode 100644 codes/fhkjhkl876/15743332.java
delete mode 100644 codes/fhl3yue/15692389.java
delete mode 100644 codes/fhvz199/15759040.java
delete mode 100644 codes/fitzge/.keep
delete mode 100644 codes/fitzge/15867203.java
delete mode 100644 codes/flutter/11187840.java
delete mode 100644 codes/fofone/15772455.java
delete mode 100644 codes/forz4ever/18245446.java
delete mode 100644 codes/fosmos/10385999.java
delete mode 100644 codes/fq18552765314/.keep
delete mode 100644 codes/fq18552765314/10972612.java
delete mode 100644 codes/franki_lxsq/9958657.java
delete mode 100644 codes/freeliujian/11351490.java
delete mode 100644 codes/friklogff/15528029.java
delete mode 100644 codes/fsa722/.keep
delete mode 100644 codes/fsa722/15742665.java
delete mode 100644 codes/fsafacc232/.keep
delete mode 100644 codes/fsafacc232/15743001.java
delete mode 100644 codes/fsafas8979812/.keep
delete mode 100644 codes/fsafas8979812/15831387.java
delete mode 100644 codes/fsafsa234/.keep
delete mode 100644 codes/fsafsa234/15831509.java
delete mode 100644 codes/fsafsc2132/.keep
delete mode 100644 codes/fsafsc2132/15831373.java
delete mode 100644 codes/fsdf435sdf/.keep
delete mode 100644 codes/fsdf435sdf/15743405.java
delete mode 100644 codes/fsdfsdfh32/.keep
delete mode 100644 codes/fsdfsdfh32/15827710.java
delete mode 100644 codes/fsk1234/15790091.java
delete mode 100644 codes/fubing3/.keep
delete mode 100644 codes/fubing3/9619048.java
delete mode 100644 codes/fuzhong/10967384.java
delete mode 100644 codes/fuzio35/16199622.java
delete mode 100644 codes/fx18902464802/.keep
delete mode 100644 codes/fx18902464802/10971972.java
delete mode 100644 codes/fy13073414213/.keep
delete mode 100644 codes/fy13073414213/10972162.java
delete mode 100644 codes/fyt345sdfgsd/.keep
delete mode 100644 codes/fyt345sdfgsd/15743397.java
delete mode 100644 codes/gaoxinjmj/.keep
delete mode 100644 codes/gaoxinjmj/15759215.java
delete mode 100644 codes/gddclct/15959388.java
delete mode 100644 codes/gedeshidai/15539757.java
delete mode 100644 codes/genghai/.keep
delete mode 100644 codes/genghai/15831364.java
delete mode 100644 codes/gflu777/15508845.java
delete mode 100644 codes/ghdfg3452/.keep
delete mode 100644 codes/ghdfg3452/15743429.java
delete mode 100644 codes/gin-lsl/11448781.java
delete mode 100644 codes/giooter/.keep
delete mode 100644 codes/giooter/15773918.java
delete mode 100644 codes/gobuster/15555259.java
delete mode 100644 codes/godawang/.keep
delete mode 100644 codes/godawang/15764594.java
delete mode 100644 codes/godgod/15775680.java
delete mode 100644 codes/godofkingsdonw6/.keep
delete mode 100644 codes/godofkingsdonw6/15815850.java
delete mode 100644 codes/gogomo/.keep
delete mode 100644 codes/gogomo/15865953.java
delete mode 100644 codes/goodstudymyx/.keep
delete mode 100644 codes/goodstudymyx/15846322.java
delete mode 100644 codes/gotchar/15775671.java
delete mode 100644 codes/gqhomegitee/.keep
delete mode 100644 codes/gqhomegitee/15846699.java
delete mode 100644 codes/grfewryhh55/.keep
delete mode 100644 codes/grfewryhh55/15828725.java
delete mode 100644 codes/gsdrt657/.keep
delete mode 100644 codes/gsdrt657/15831411.java
delete mode 100644 codes/gtuwer64/.keep
delete mode 100644 codes/gtuwer64/15828885.java
delete mode 100644 codes/guagua123/15620667.java
delete mode 100644 codes/guanghua/.keep
delete mode 100644 codes/guanghua/15756054.java
delete mode 100644 codes/guanghua/15772570.java
delete mode 100644 codes/guanghua/15819545.java
delete mode 100644 codes/guanghua/15820837.java
delete mode 100644 codes/guanj123/15699820.java
delete mode 100644 codes/gufengxiao/15851937.java
delete mode 100644 codes/gugulogs/15521175.java
delete mode 100644 codes/guhhzz/15835674.java
delete mode 100644 codes/gui8989/11228793.java
delete mode 100644 codes/gujian3724/15541800.java
delete mode 100644 codes/gunange/.keep
delete mode 100644 codes/gunange/15846499.java
delete mode 100644 codes/guoguoya/15742850.java
delete mode 100644 codes/gwya123/15699461.java
delete mode 100644 codes/h178414/.keep
delete mode 100644 codes/h178414/15842656.java
delete mode 100644 codes/h295276/15685251.java
delete mode 100644 codes/h4ppyguys/.keep
delete mode 100644 codes/h4ppyguys/15843449.java
delete mode 100644 codes/h891539721/15718815.java
delete mode 100644 codes/h915754289/15853542.java
delete mode 100644 codes/haha176/15759089.java
delete mode 100644 codes/hahalin/15846388.java
delete mode 100644 codes/hahane/15772179.java
delete mode 100644 codes/haihai/.keep
delete mode 100644 codes/haihai/15860309.java
delete mode 100644 codes/handleRich/11471812.java
delete mode 100644 codes/handsonboards/.keep
delete mode 100644 codes/handsonboards/15841143.java
delete mode 100644 codes/haohua/.keep
delete mode 100644 codes/haohua/15830974.java
delete mode 100644 codes/haoranx98/.keep
delete mode 100644 codes/haoranx98/10039365.java
delete mode 100644 codes/happymo/11212155.java
delete mode 100644 codes/hatjs880328/.keep
delete mode 100644 codes/hatjs880328/15779413.java
delete mode 100644 codes/hclw_123/15865557.java
delete mode 100644 codes/hdhd13726801083/15811090.java
delete mode 100644 codes/heheer/9674738.java
delete mode 100644 codes/heiheiya/15775428.java
delete mode 100644 codes/heiopx/11121859.java
delete mode 100644 codes/helens0813/15861403.java
delete mode 100644 codes/helloAnhusts/.keep
delete mode 100644 codes/helloAnhusts/15846366.java
delete mode 100644 codes/helloY_Y/15644488.java
delete mode 100644 codes/heshu1/15640537.java
delete mode 100644 codes/hfghst45645d/.keep
delete mode 100644 codes/hfghst45645d/15831264.java
delete mode 100644 codes/hh456123/15721443.java
delete mode 100644 codes/hhhh2160350883/15855109.java
delete mode 100644 codes/hhj123/15639946.java
delete mode 100644 codes/hhmdsb/15837956.java
delete mode 100644 codes/hjh13525117665/15856794.java
delete mode 100644 codes/hlsscoder/15606370.java
delete mode 100644 codes/hly123/.keep
delete mode 100644 codes/hly123/10984210.java
delete mode 100644 codes/hly252984658/.keep
delete mode 100644 codes/hly252984658/10979977.java
delete mode 100644 codes/hnn111/15577556.java
delete mode 100644 codes/honghongwa/15846459.java
delete mode 100644 codes/hongshen/.keep
delete mode 100644 codes/hongshen/10039145.java
delete mode 100644 codes/hongxia/15876230.java
delete mode 100644 codes/hongyaya/15683533.java
delete mode 100644 codes/hongyu551600/15868757.java
delete mode 100644 codes/hopekai/15586507.java
delete mode 100644 codes/houhouya/15778311.java
delete mode 100644 codes/hua0x522/10375834.java
delete mode 100644 codes/huaano/15772611.java
delete mode 100644 codes/hualine/15772389.java
delete mode 100644 codes/huang856/.keep
delete mode 100644 codes/huang856/10982875.java
delete mode 100644 codes/huangduoyan2024/.I94UY3.java.swp
delete mode 100644 codes/huangduoyan2024/15343275.java
delete mode 100644 codes/huangwenli666/15867725.java
delete mode 100644 codes/huangxiaoyan/10971566.java
delete mode 100644 codes/huangzi/.keep
delete mode 100644 codes/huangzi/15867961.java
delete mode 100644 codes/huanji1212/.keep
delete mode 100644 codes/huanji1212/15860624.java
delete mode 100644 codes/huanjiyan/15607160.java
delete mode 100644 codes/huankuai/.java
delete mode 100644 codes/huankuai/9962039.java
delete mode 100644 codes/huliangsheng/.keep
delete mode 100644 codes/huliangsheng/15759181.java
delete mode 100644 codes/hunking/.keep
delete mode 100644 codes/hunking/15845445.java
delete mode 100644 codes/hunzita/.keep
delete mode 100644 codes/hunzita/15850843.java
delete mode 100644 codes/huoyin/15864042.java
delete mode 100644 codes/huqi88/15222808.java
delete mode 100644 codes/hyk111/15779480.java
delete mode 100644 codes/hyk222/15829718.java
delete mode 100644 codes/hzhong/15527208.java
delete mode 100644 codes/iHento/15964827.java
delete mode 100644 codes/iHento/15965308.java
delete mode 100644 codes/idealismer/15406184.java
delete mode 100644 codes/ignoreme/11207270.java
delete mode 100644 codes/ikzsm77/15613401.java
delete mode 100644 codes/ilove360/9937750.java
delete mode 100644 codes/imyunbiao/14371419.java
delete mode 100644 codes/includebits/.15775863.java.swp
delete mode 100644 codes/includebits/15775863.java
delete mode 100644 codes/interceptors/11148333.java
delete mode 100644 codes/ivan886/15517024.java
delete mode 100644 codes/jack250/15895412.java
delete mode 100644 codes/jacksoftware/15864608.java
delete mode 100644 codes/jackson0007/.keep
delete mode 100644 codes/jackson0007/15846232.java
delete mode 100644 codes/jacksonstack/15157304.java
delete mode 100644 codes/jakobz/18423069.java
delete mode 100644 codes/java0111/15636073.java
delete mode 100644 codes/jayjay/9955470.java
delete mode 100644 codes/jbace2/.keep
delete mode 100644 codes/jbace2/10041152.java
delete mode 100644 codes/jerrywang/.keep
delete mode 100644 codes/jerrywang/10972482.java
delete mode 100644 codes/jerrywang/10972482.java]
delete mode 100644 codes/jerrywang1982/15623035.java
delete mode 100644 codes/jggttcd55/.keep
delete mode 100644 codes/jggttcd55/15828240.java
delete mode 100644 codes/jgjfvj767/.keep
delete mode 100644 codes/jgjfvj767/15743251.java
delete mode 100644 codes/jiacheng/.keep
delete mode 100644 codes/jiacheng/15830646.java
delete mode 100644 codes/jiacheng02/.keep
delete mode 100644 codes/jiacheng02/15830816.java
delete mode 100644 codes/jianghao/15366705.java
delete mode 100644 codes/jiasrt/15781311.java
delete mode 100644 codes/jiayinzinc/.keep
delete mode 100644 codes/jiayinzinc/15845797.java
delete mode 100644 codes/jichen/12429463.java
delete mode 100644 codes/jideliy89mxp/10942446.java
delete mode 100644 codes/jieming/.keep
delete mode 100644 codes/jieming/15831124.java
delete mode 100644 codes/jijing/.keep
delete mode 100644 codes/jijing/15866624.java
delete mode 100644 codes/jingge15116238811/10969429.java
delete mode 100644 codes/jingqing3948/15533535.java
delete mode 100644 codes/jinguo/15825503.java
delete mode 100644 codes/jinjin1234567/15628228.java
delete mode 100644 codes/jinpeng/.keep
delete mode 100644 codes/jinpeng/15794435.java
delete mode 100644 codes/jinshi/.keep
delete mode 100644 codes/jinshi/15846626.java
delete mode 100644 codes/jinxin177/15759096.java
delete mode 100644 codes/jinya123/15684545.java
delete mode 100644 codes/jinyuan/.keep
delete mode 100644 codes/jinyuan/15867508.java
delete mode 100644 codes/jiucai131/11476990.java
delete mode 100644 codes/jiujiu/15555981.java
delete mode 100644 codes/jiujiuhaizi/.keep
delete mode 100644 codes/jiujiuhaizi/10972159.java
delete mode 100644 codes/jj625625/15742603.java
delete mode 100644 codes/jkgao007/10515263.java
delete mode 100644 codes/jkxllj/15631418.java
delete mode 100644 codes/jmdajiang/.keep
delete mode 100644 codes/jmdajiang/15764743.java
delete mode 100644 codes/jokemanfire/11650604.java
delete mode 100644 codes/jony2258/15804822.java
delete mode 100644 codes/joohwan/16200342.java
delete mode 100644 codes/jpq110/.java
delete mode 100644 codes/jpq110/15848383.java
delete mode 100644 codes/juanmaola/15776278.java
delete mode 100644 codes/juking/10340196.java
delete mode 100644 codes/jyz1092752421/15867277.java
delete mode 100644 codes/k8scat/11864664.java
delete mode 100644 codes/kaiSYJ/15488956.java
delete mode 100644 codes/kaiSYJ/15589878.java
delete mode 100644 codes/kakki1003/18431839.java
delete mode 100644 codes/kangwang/11615067.java
delete mode 100644 codes/kankanha/15775398.java
delete mode 100644 codes/kankanya/15772087.java
delete mode 100644 codes/katooo/11209021.java
delete mode 100644 codes/kekene/15777867.java
delete mode 100644 codes/kikiya/15846231.java
delete mode 100644 codes/kingzhuo666/.keep
delete mode 100644 codes/kingzhuo666/15846704.java
delete mode 100644 codes/kira11535/15774608.java
delete mode 100644 codes/kkya123/15722815.java
delete mode 100644 codes/knight9dog/.keep
delete mode 100644 codes/knight9dog/15845028.java
delete mode 100644 codes/kongbaige/.keep
delete mode 100644 codes/kongbaige/15845868.java
delete mode 100644 codes/konglingdi/9696377.java
delete mode 100644 codes/kongshang/15699583.java
delete mode 100644 codes/kongshang/15699673.java
delete mode 100644 codes/kongshang/15700235.java
delete mode 100644 codes/kristira/15804034.java
delete mode 100644 codes/kukuku123/.15650271.java.swp
delete mode 100644 codes/kukuku123/15650271.java
delete mode 100644 codes/kunleya/15775724.java
delete mode 100644 codes/kunzhi/.keep
delete mode 100644 codes/kunzhi/15606505.java
delete mode 100644 codes/kuqiu123/15585804.java
delete mode 100644 codes/kyi667gfhg/.keep
delete mode 100644 codes/kyi667gfhg/15831315.java
delete mode 100644 codes/l1017026323/15630469.java
delete mode 100644 codes/l15872381947/15962935.java
delete mode 100644 codes/l18877577615/15776334.java
delete mode 100644 codes/l2746415679/15850006.java
delete mode 100644 codes/l3112624513/15836906.java
delete mode 100644 codes/l5211314/15854497.java
delete mode 100644 codes/lailailai/11211174.java
delete mode 100644 codes/lala12/15700256.java
delete mode 100644 codes/lambdang/11472883.java
delete mode 100644 codes/lan0bo/11297643.java
delete mode 100644 codes/lanlan/11115524.java
delete mode 100644 codes/lanlanya/15684957.java
delete mode 100644 codes/laomocy/.keep
delete mode 100644 codes/laomocy/15768870.java
delete mode 100644 codes/laoshifu/15520696.java
delete mode 100644 codes/last123/15721253.java
delete mode 100644 codes/lbhusvkfj/15582699.java
delete mode 100644 codes/lc12345678/15853848.java
delete mode 100644 codes/lee001/15817464.java
delete mode 100644 codes/legary/18735642.java
delete mode 100644 codes/leikaiya/15772650.java
delete mode 100644 codes/leikaya/15772650.java
delete mode 100644 codes/leitongjiang2/.keep
delete mode 100644 codes/leitongjiang2/15757898
delete mode 100644 codes/leitongjiang2/15757898.java
delete mode 100644 codes/lelewa/15846345.java
delete mode 100644 codes/leoaeon/15620248.java
delete mode 100644 codes/leshan/.keep
delete mode 100644 codes/leshan/15799241.java
delete mode 100644 codes/levi123/15859682.java
delete mode 100644 codes/lgy1584899472/15607389.java
delete mode 100644 codes/lh775123/.keep
delete mode 100644 codes/lh775123/15815281.java
delete mode 100644 codes/lhcoder/15630391.java
delete mode 100644 codes/lhtcn/.keep
delete mode 100644 codes/lhtscavc/.keep
delete mode 100644 codes/lhtscavc/15710834.java
delete mode 100644 codes/lhzs123/15684690.java
delete mode 100644 codes/li781117/15518855.java
delete mode 100644 codes/liaojiji/15699956.java
delete mode 100644 codes/liaoxinghai/15778644.java
delete mode 100644 codes/lideshengdsb/15545860.java
delete mode 100644 codes/lidongshi/10229157.java
delete mode 100644 codes/lienbj/18149367.java
delete mode 100644 codes/lige123/.keep
delete mode 100644 codes/lige123/15798937.java
delete mode 100644 codes/lihai18898/15807887.java
delete mode 100644 codes/lihaoran887/.keep
delete mode 100644 codes/lihaoran887/15815869.java
delete mode 100644 codes/lihuizhe666/15774599.java
delete mode 100644 codes/lili183/15775952.java
delete mode 100644 codes/linchong/9954468.java
delete mode 100644 codes/linliangdong/.keep
delete mode 100644 codes/linliangdong/15764880.java
delete mode 100644 codes/linling0421/.keep
delete mode 100644 codes/linling0421/10979563.java
delete mode 100644 codes/linlingEdu/.keep
delete mode 100644 codes/linlingEdu/15815233.java
delete mode 100644 codes/liquor/11292981.java
delete mode 100644 codes/lishugood1/.keep
delete mode 100644 codes/lishugood1/15846106.java
delete mode 100644 codes/lisonghao/15710966.java
delete mode 100644 codes/liuYanFen/15720723.java
delete mode 100644 codes/liu_chen_yang/15629230.java
delete mode 100644 codes/liugela/.keep
delete mode 100644 codes/liugela/15756309.java
delete mode 100644 codes/liuguanghui/15875503.java
delete mode 100644 codes/liuguangsen0409/15717549.java
delete mode 100644 codes/liujiayi/10517239.java
delete mode 100644 codes/liujin_long/15778303.java
delete mode 100644 codes/liulink/15774650.java
delete mode 100644 codes/liuyctt12/15630469.java
delete mode 100644 codes/liuyiyi/15714289.java
delete mode 100644 codes/liuyupeng999/.keep
delete mode 100644 codes/liuyupeng999/15845114.java
delete mode 100644 codes/liuyuxuan666/.keep
delete mode 100644 codes/liuyuxuan666/15815202.java
delete mode 100644 codes/liwei2496/11466656.java
delete mode 100644 codes/lixiang1996/15516370.java
delete mode 100644 codes/liyanfen/15875628.java
delete mode 100644 codes/liyanfen1/15607550.java
delete mode 100644 codes/liyanyan/15864049.java
delete mode 100644 codes/liyou041/15836638.java
delete mode 100644 "codes/liyou041/\345\244\215\345\210\266\347\232\204"
delete mode 100644 codes/lj18263537279/.keep
delete mode 100644 codes/lj18263537279/10972375.java
delete mode 100644 codes/ljc13512881480/15775859.java
delete mode 100644 codes/ll13174074984/.keep
delete mode 100644 codes/ll13174074984/10972293.java
delete mode 100644 codes/ll13808780223/15790801.java
delete mode 100644 codes/lmc666/15632201.java
delete mode 100644 codes/lodyn123/15488861.java
delete mode 100644 codes/logic111/.keep
delete mode 100644 codes/logic111/15819546.java
delete mode 100644 codes/lolitot/.keep
delete mode 100644 codes/lolitot/10040248.java
delete mode 100644 codes/long22/11031968.java
delete mode 100644 codes/long93/15676797.java
delete mode 100644 codes/longquefeng/15835894.java
delete mode 100644 codes/longxiqwe1/.keep
delete mode 100644 codes/longxiqwe1/15842971.java
delete mode 100644 codes/longxixi/18735649.java
delete mode 100644 codes/loveer/15720497.java
delete mode 100644 codes/lovemeatsss/.keep
delete mode 100644 codes/lovemeatsss/15841023.java
delete mode 100644 codes/loveta1/15852677.java
delete mode 100644 codes/lovewang/11307245.java
delete mode 100644 codes/lovingcode3/.keep
delete mode 100644 codes/lovingcode3/15844469.java
delete mode 100644 codes/lovscene/11290992.java
delete mode 100644 codes/lsl990410/15777331.java
delete mode 100644 codes/lsmir2/13427738.java
delete mode 100644 codes/lsnjxkw634/15836665.java
delete mode 100644 codes/lsnjxkw635/15847008.java
delete mode 100644 codes/ltq0319/15757963.java
delete mode 100644 codes/luo111/15754678.java
delete mode 100644 codes/luogege/15634607.java
delete mode 100644 codes/luoluo123/15634481.java
delete mode 100644 codes/luowei/15609646.java
delete mode 100644 codes/luox12/15700214.java
delete mode 100644 codes/luv3704/15810371.java
delete mode 100644 codes/luzhanheng2023/12213445.java
delete mode 100644 codes/lvbin2/.keep
delete mode 100644 codes/lvbin2/15758178.java
delete mode 100644 codes/lvlv123/15693242.java
delete mode 100644 codes/lvrui233/15855727.java
delete mode 100644 codes/lvxl111/15528312.java
delete mode 100644 codes/lx1122334/12138905.java
delete mode 100644 codes/lx13579/15807637.java
delete mode 100644 codes/lxnb666/14201242.java
delete mode 100644 codes/lxsq1905951174/15775065.java
delete mode 100644 codes/ly614155/15775591.java
delete mode 100644 codes/lynlon/12376594.java
delete mode 100644 codes/lyx123123/15775949.java
delete mode 100644 codes/lyxgitee1/.keep
delete mode 100644 codes/lyxgitee1/15815289.java
delete mode 100644 codes/lzf1123/15542355.java
delete mode 100644 codes/lzr565520/15742467.java
delete mode 100644 codes/m88888686/11201957.java
delete mode 100644 codes/ma17533610893/15816305.java
delete mode 100644 codes/ma_yin/15529443.java
delete mode 100644 codes/mabofu/10606075.java
delete mode 100644 codes/macw_379/15655907.java
delete mode 100644 codes/mafuqiang/10166179.java
delete mode 100644 codes/mahaoliang/15538747.java
delete mode 100644 codes/mahaoliang/15540967.java
delete mode 100644 codes/maisaki/15487137.java
delete mode 100644 codes/maiswemlilo1/11241067.java
delete mode 100644 codes/manbaoutsi/.keep
delete mode 100644 codes/manbaoutsi/15845869.java
delete mode 100644 codes/manyuemei/15869904.java
delete mode 100644 codes/maqingshan123/15622329.java
delete mode 100644 codes/matrixHall/.keep
delete mode 100644 codes/matrixHall/15815802.java
delete mode 100644 codes/matrixsquad/.keep
delete mode 100644 codes/matrixsquad/15774031.java
delete mode 100644 codes/maxsky010/15734024.java
delete mode 100644 codes/mcfly001/11350844.java
delete mode 100644 codes/meiyaya/15775357.java
delete mode 100644 codes/memuqee/11238999.java
delete mode 100644 codes/meng123/15699639.java
delete mode 100644 codes/mengbo/.keep
delete mode 100644 codes/mengbo/15855465.java
delete mode 100644 codes/mengjian/15775342.java
delete mode 100644 codes/mengwenxu/15578436.java
delete mode 100644 codes/mengzhong/15775328.java
delete mode 100644 codes/menmazqj/15277745.java
delete mode 100644 codes/mercurio/15782388.java
delete mode 100644 codes/mewchen/.keep
delete mode 100644 codes/mewchen/10042032.java
delete mode 100644 codes/mi9688/15776507.java
delete mode 100644 codes/mianyang/.keep
delete mode 100644 codes/mianyang/15856153.java
delete mode 100644 codes/milkyTea/11201805.java
delete mode 100644 codes/mimeik/14612577.java
delete mode 100644 codes/ming18641275939/15838279.java
delete mode 100644 codes/mingt123/15699576.java
delete mode 100644 codes/mingyaya/15775661.java
delete mode 100644 codes/mingzhi/.keep
delete mode 100644 codes/mingzhi/15846139.java
delete mode 100644 codes/minixin/11115487.java
delete mode 100644 codes/mirabit/18384785.java
delete mode 100644 codes/miyuer/15846351.java
delete mode 100644 codes/mjzhutianxiu/15555031.java
delete mode 100644 codes/mjzhutianxiu/15578951.java
delete mode 100644 codes/mmkk26/15845961.java
delete mode 100644 codes/mmm111/15648151.java
delete mode 100644 codes/mmm123456/15625950.java
delete mode 100644 codes/mmmmmm/11121934.java
delete mode 100644 codes/mmnn123/15720368.java
delete mode 100644 codes/mmx050623/15846455.java
delete mode 100644 codes/momo1234/15630942.java
delete mode 100644 codes/momozi/15562400.java
delete mode 100644 codes/moonmoon/15777672.java
delete mode 100644 codes/morikawakaho/15830357.java
delete mode 100644 codes/mouse123/.issueld.java.swp
delete mode 100644 codes/mouse123/15837734.java
delete mode 100644 codes/mouse123/issueld.java
delete mode 100644 codes/moyu9527/15633448.java
delete mode 100644 codes/moyudaren/.keep
delete mode 100644 codes/moyudaren/15860459.java
delete mode 100644 codes/mozi123/15863565.java
delete mode 100644 codes/mr_lk123/.java
delete mode 100644 codes/mr_lk123/9954396.java
delete mode 100644 codes/msc12345678/15659945.java
delete mode 100644 codes/msk6527/15520710.java
delete mode 100644 codes/mtfx0516/15585376.java
delete mode 100644 codes/mujing/15841257.java
delete mode 100644 codes/mupimage/11254168.java
delete mode 100644 codes/musei123/15775718.java
delete mode 100644 codes/muyang/.keep
delete mode 100644 codes/muyang/15799169.java
delete mode 100644 codes/muzhuo0205/15809688.java
delete mode 100644 codes/mwy280429/15517713.java
delete mode 100644 codes/myclubocr/11122342.java
delete mode 100644 codes/myyaya/15774943.java
delete mode 100644 codes/nannanya/15777923.java
delete mode 100644 codes/nargnij7/15839361.java
delete mode 100644 codes/nbdopa/11116411.java
delete mode 100644 codes/ndliang/15628397.java
delete mode 100644 codes/ne8848/11116344.java
delete mode 100644 codes/neineiya/11260235.java
delete mode 100644 codes/nekoko/.keep
delete mode 100644 codes/nekoko/15845688.java
delete mode 100644 codes/nemolv/15195393.java
delete mode 100644 codes/nfnxfr/.keep
delete mode 100644 codes/nfnxfr/15775676.java
delete mode 100644 codes/nigger/15601489.java
delete mode 100644 codes/nightowl/9959740.java
delete mode 100644 codes/nihao01/.keep
delete mode 100644 codes/nihao01/15867137.java
delete mode 100644 codes/niumaa/15777757.java
delete mode 100644 codes/niyiyi/15684167.java
delete mode 100644 codes/njjkxllj/15631418.java
delete mode 100644 codes/nn314159/15826881.java
delete mode 100644 codes/no8gcoder/15578057.java
delete mode 100644 codes/nofear123/.15830815.java.swo
delete mode 100644 codes/nofear123/.15830815.java.swp
delete mode 100644 codes/nofear123/15831083.java
delete mode 100644 codes/nonowa/15831088.java
delete mode 100644 codes/ny960126/15626345.java
delete mode 100644 codes/nzqq54667/.keep
delete mode 100644 codes/nzqq54667/15841667.java
delete mode 100644 codes/o11ccm/.keep
delete mode 100644 codes/o11ccm/10041751.java
delete mode 100644 codes/o1982016781/11118518.java
delete mode 100644 codes/o389675/15718177.java
delete mode 100644 codes/obc147/11064483.java
delete mode 100644 codes/onenewcode/15333872.java
delete mode 100644 codes/ooooo_long/15253355.java
delete mode 100644 codes/ooooo_long/15256718.java
delete mode 100644 codes/ooopen/11302831.java
delete mode 100644 codes/opaozhouzhou04/.keep
delete mode 100644 codes/opaozhouzhou04/15846494.java
delete mode 100644 codes/openAI12/11234314.java
delete mode 100644 codes/openAsg/11491517.java
delete mode 100644 codes/openCI/11276263.java
delete mode 100644 codes/openZnolis/18398006.java
delete mode 100644 codes/openZnolis/18398008.java
delete mode 100644 codes/openZnolis/18398010.java
delete mode 100644 codes/openZnolis/18398011.java
delete mode 100644 codes/openZnolis/18398012.java
delete mode 100644 codes/openanolis_idear/.keep
delete mode 100644 codes/openanolis_idear/15698658.java
delete mode 100644 codes/opsation/11293380.java
delete mode 100644 codes/oroyade/11207786.java
delete mode 100644 codes/os1024/10038969.java
delete mode 100644 codes/outclass2/.keep
delete mode 100644 codes/outclass2/15815855.java
delete mode 100644 codes/owccqq/11122165.java
delete mode 100644 codes/oyeeyo/18379057.java
delete mode 100644 codes/oyoumq/11452053.java
delete mode 100644 codes/p13285288040/.keep
delete mode 100644 codes/p13285288040/10972084.java
delete mode 100644 codes/p2948642664/15730688.java
delete mode 100644 codes/passass/11299378.java
delete mode 100644 codes/patrol12/.keep
delete mode 100644 codes/patrol12/15845811.java
delete mode 100644 codes/pcvvvc/11211727.java
delete mode 100644 codes/pddpxx/15781110.java
delete mode 100644 codes/pears123/15846338.java
delete mode 100644 codes/penguin95/15774820.java
delete mode 100644 codes/perscc/15846268.java
delete mode 100644 codes/philips/11302813.java
delete mode 100644 codes/pictur/15653765.java
delete mode 100644 codes/plugin/11199950.java
delete mode 100644 codes/plustub/11244425.java
delete mode 100644 codes/polodybala/.18365371.java.swp
delete mode 100644 codes/polodybala/18365371.java
delete mode 100644 codes/pondfish/15535613.java
delete mode 100644 codes/ppdplius/11212528.java
delete mode 100644 codes/pper2024/15867590.java
delete mode 100644 codes/pplac2/.keep
delete mode 100644 codes/pplac2/15814992.java
delete mode 100644 codes/pppp0000/15840340.java
delete mode 100644 codes/progle/17034577.java
delete mode 100644 codes/promse/11152350.java
delete mode 100644 codes/publicstringms/.keep
delete mode 100644 codes/publicstringms/15844875.java
delete mode 100644 codes/pui9001/11232878.java
delete mode 100644 codes/pumpkin/15658869.java
delete mode 100644 codes/puzzle/15806930.java
delete mode 100644 codes/pyqyzjznbw1/.15782703.java.swp
delete mode 100644 codes/pyqyzjznbw1/15782703,java
delete mode 100644 codes/pyqyzjznbw1/15782703.java
delete mode 100644 codes/pysunlightse/.keep
delete mode 100644 codes/pysunlightse/15846452.java
delete mode 100644 codes/pzzzzzzzzz/.keep
delete mode 100644 codes/pzzzzzzzzz/15778160.java
delete mode 100644 codes/q1229173945/15755759.java
delete mode 100644 codes/q225692/15860954.java
delete mode 100644 codes/q6666666868/11202065.java
delete mode 100644 codes/qaz123qaz/15859565
delete mode 100644 codes/qaz123qaz/15859565.java
delete mode 100644 codes/qazwsx061jk/15838272.java
delete mode 100644 codes/qianshi/13339610.java
delete mode 100644 codes/qianxiaxingkong/11737212.java
delete mode 100644 codes/qianyege/.keep
delete mode 100644 codes/qianyege/15846025.java
delete mode 100644 codes/qichang0921/15671954.java
delete mode 100644 codes/qierbao/15832037.java
delete mode 100644 codes/qigela/.keep
delete mode 100644 codes/qigela/15757052.java
delete mode 100644 codes/qihuan/15568203.java
delete mode 100644 codes/qingfeng/15541061.java
delete mode 100644 codes/qingkouwei/15823415.java
delete mode 100644 codes/qingqingjiang/15876459.java
delete mode 100644 codes/qingyunzhishang/15861715.java
delete mode 100644 codes/qiqixiongdi/.keep
delete mode 100644 codes/qiqixiongdi/15846620.java
delete mode 100644 codes/qiu040905/.15783626.java.swo
delete mode 100644 codes/qiu040905/.15783626.java.swp
delete mode 100644 codes/qiu040905/15783626.java
delete mode 100644 codes/qiuwenjie/.keep
delete mode 100644 codes/qiuwenjie/15846265.java
delete mode 100644 codes/qixiaobao/15829693.java
delete mode 100644 codes/qjpdjk578/15514740.java
delete mode 100644 codes/qq13189019228/15808396.java
delete mode 100644 codes/qq2121809344/15831326.java
delete mode 100644 codes/qq753755635/15717531.java
delete mode 100644 codes/qqyy123/15845835.java
delete mode 100644 codes/qsh123/15845262.java
delete mode 100644 codes/qwaszx/15543578.java
delete mode 100644 codes/qwe123457/15854887.java
delete mode 100644 codes/qwer121234/15859995.java
delete mode 100644 codes/qwer121256/15860383.java
delete mode 100644 codes/qwer121278/15860433.java
delete mode 100644 codes/qwer121290/.keep
delete mode 100644 codes/qwer121290/15860549.java
delete mode 100644 codes/qwerplm6/15587872.java
delete mode 100644 codes/qwert4678/.keep
delete mode 100644 codes/qwert4678/15743469.java
delete mode 100644 codes/qwfasfy4/.keep
delete mode 100644 codes/qwfasfy4/15831401.java
delete mode 100644 codes/ranball/15775950.java
delete mode 100644 codes/renhaihang/15681912.java
delete mode 100644 codes/replying/11277017.java
delete mode 100644 codes/reseta/.keep
delete mode 100644 codes/reseta/15854468.java
delete mode 100644 codes/rhp1234/15674333.java
delete mode 100644 codes/rice18302947981/15717388.java
delete mode 100644 codes/rider666/18719506.java
delete mode 100644 codes/rlzvpz/.keep
delete mode 100644 codes/rlzvpz/15777666.java
delete mode 100644 codes/robert_bo/15545727.java
delete mode 100644 codes/robert_bo/15669897.java
delete mode 100644 codes/robert_bo/15669960.java
delete mode 100644 codes/rockandro1l/.keep
delete mode 100644 codes/rockandro1l/15844987.java
delete mode 100644 codes/roklly/11207828.java
delete mode 100644 codes/root0day/10353744.java
delete mode 100644 codes/roy12345666/15845812.java
delete mode 100644 codes/rree123/15719870.java
delete mode 100644 codes/rrffhj/.keep
delete mode 100644 codes/rrffhj/15778997.java
delete mode 100644 codes/rrr170459/15857158.java
delete mode 100644 codes/rtsp8080/11303570.java
delete mode 100644 codes/ruoruokpl/.keep
delete mode 100644 codes/ruoruokpl/15815244.java
delete mode 100644 codes/ruoruone/15775867.java
delete mode 100644 codes/ryange/.keep
delete mode 100644 codes/ryange/15846346.java
delete mode 100644 codes/ryer767gfgs/.keep
delete mode 100644 codes/ryer767gfgs/15743395.java
delete mode 100644 codes/s0nder/15635858.java
delete mode 100644 codes/s18836251852/15717550.java
delete mode 100644 codes/s18893442896/16477528.java
delete mode 100644 codes/s19555077769/15839271.java
delete mode 100644 codes/s20050520/15545690.java
delete mode 100644 codes/sa17737119814/15860032.java
delete mode 100644 codes/sa17833901967/15859863.java
delete mode 100644 codes/sad546aa/.keep
delete mode 100644 codes/sad546aa/15743452.java
delete mode 100644 codes/sadboy/10979809.java
delete mode 100644 codes/sadboy/15628230.java
delete mode 100644 codes/saf546qafd/.keep
delete mode 100644 codes/saf546qafd/15743461.java
delete mode 100644 codes/safafsaiuiu24/.keep
delete mode 100644 codes/safafsaiuiu24/15831227.java
delete mode 100644 codes/safasf342351/.keep
delete mode 100644 codes/safasf342351/15743467.java
delete mode 100644 codes/safasf647/.keep
delete mode 100644 codes/safasf647/15831068.java
delete mode 100644 codes/saffasckkk77/.keep
delete mode 100644 codes/saffasckkk77/15743383.java
delete mode 100644 codes/sag546fa/.keep
delete mode 100644 codes/sag546fa/15799007.java
delete mode 100644 codes/sahofav587/11220243.java
delete mode 100644 codes/sakut2/15592208.java
delete mode 100644 codes/sam9029/.java.swp
delete mode 100644 codes/sam9029/9968905.java
delete mode 100644 codes/samzoe_openanolis/15733701.java
delete mode 100644 codes/sandbox/11142279.java
delete mode 100644 codes/sangeta/.keep
delete mode 100644 codes/sangeta/15720730.java
delete mode 100644 codes/sansiya/15776109.java
delete mode 100644 codes/sanya123/15772128.java
delete mode 100644 codes/sanzhanggui/15824093.java
delete mode 100644 codes/sar34dg674/.keep
delete mode 100644 codes/sar34dg674/15831280.java
delete mode 100644 codes/say1ka/16051921.java
delete mode 100644 codes/sayslot/11250439.java
delete mode 100644 codes/sccc2124/.keep
delete mode 100644 codes/sccc2124/15831363.java
delete mode 100644 codes/sda2022421943/15859661.java
delete mode 100644 codes/sdafaf4251/.keep
delete mode 100644 codes/sdafaf4251/15743466.java
delete mode 100644 codes/sdasr5542/.keep
delete mode 100644 codes/sdasr5542/15743114.java
delete mode 100644 codes/sdd42424/.keep
delete mode 100644 codes/sdd42424/15824581.java
delete mode 100644 codes/sdfghfd34/.keep
delete mode 100644 codes/sdfghfd34/15826951.java
delete mode 100644 codes/sdg56sdfasf/.keep
delete mode 100644 codes/sdg56sdfasf/15831417.java
delete mode 100644 codes/sdsacc23/.keep
delete mode 100644 codes/sdsacc23/15825736.java
delete mode 100644 codes/sdt345sdfs/.keep
delete mode 100644 codes/sdt345sdfs/15743451.java
delete mode 100644 codes/seebee/16266160.java
delete mode 100644 codes/selena/11289878.java
delete mode 100644 codes/seven/15710966.java
delete mode 100644 codes/sevenpppplus/10371725.java
delete mode 100644 codes/sf35463af/.keep
delete mode 100644 codes/sf35463af/15831476.java
delete mode 100644 codes/sfaf234214/.keep
delete mode 100644 codes/sfaf234214/15831503.java
delete mode 100644 codes/sfasffasf2434/.keep
delete mode 100644 codes/sfasffasf2434/15831014.java
delete mode 100644 codes/sfccwad902/.keep
delete mode 100644 codes/sfccwad902/15826644.java
delete mode 100644 codes/sfdafas422/.keep
delete mode 100644 codes/sfdafas422/15743380.java
delete mode 100644 codes/sgdfg56/.keep
delete mode 100644 codes/sgdfg56/15743475.java
delete mode 100644 codes/sgdfgw234/.keep
delete mode 100644 codes/sgdfgw234/15829828.java
delete mode 100644 codes/shangxing117/.keep
delete mode 100644 codes/shangxing117/15742267.java
delete mode 100644 codes/shankailun10/.keep
delete mode 100644 codes/shankailun10/9637756.java
delete mode 100644 codes/shankailun10/9638206.java
delete mode 100644 codes/shankailun10/9682326.java
delete mode 100644 codes/sharpery/15562912.java
delete mode 100644 codes/shelly/9674981.java
delete mode 100644 codes/shelove/11217672.java
delete mode 100644 codes/shenshenwa/15846503.java
delete mode 100644 codes/sherlinz0/9688047.java
delete mode 100644 codes/shiguang173/15759081.java
delete mode 100644 codes/shihantao/.keep
delete mode 100644 codes/shihantao/10039704.java
delete mode 100644 codes/shihantao1/.keep
delete mode 100644 codes/shiove/15669581.java
delete mode 100644 codes/shiyigela/.keep
delete mode 100644 codes/shiyigela/15758629.java
delete mode 100644 codes/shongz/15517802.java
delete mode 100644 codes/shrcc1314/.keep
delete mode 100644 codes/shrcc1314/15844211.java
delete mode 100644 codes/shuchaoyang/15534407.java
delete mode 100644 codes/shuijiao/15776076.java
delete mode 100644 codes/shunvdouniu/15841229.java
delete mode 100644 codes/shuoshu131/18614920.java
delete mode 100644 codes/shuyiyi/15683952.java
delete mode 100644 codes/sianjen/10330887.java
delete mode 100644 codes/sichen123/15721908.java
delete mode 100644 codes/silverSmith/15774806.java
delete mode 100644 codes/siqiwang/.keep
delete mode 100644 codes/siqiwang/15311318.java
delete mode 100644 codes/sisiya/15723000.java
delete mode 100644 codes/siwuge2/.keep
delete mode 100644 codes/siwuge2/15720932.java
delete mode 100644 codes/sjms1u2n3s4h5/10104996.java
delete mode 100644 codes/sk1234/15778693.java
delete mode 100644 codes/sk123456/15858299.java
delete mode 100644 codes/skysky/15776206.java
delete mode 100644 codes/slamer/11242607.java
delete mode 100644 codes/smartpulse/.keep
delete mode 100644 codes/smartpulse/15774449.java
delete mode 100644 codes/smcO0O/.java
delete mode 100644 codes/smcO0O/10708545.java
delete mode 100644 codes/smesa6/11229202.java
delete mode 100644 codes/snowfog/11357833.java
delete mode 100644 codes/solo1017805211/.java
delete mode 100644 codes/solo1017805211/16409853.java
delete mode 100644 codes/solo1017805211/16441292.java
delete mode 100644 codes/solo1017805211/16442270.java
delete mode 100644 codes/solo1017805211/16445723.java
delete mode 100644 codes/solo1017805211/16558637.java
delete mode 100644 codes/someoneunknown/.keep
delete mode 100644 codes/someoneunknown/15815800.java
delete mode 100644 codes/sqScripter/.keep
delete mode 100644 codes/sqScripter/15846693.java
delete mode 100644 codes/ss12wzh/15780057.java
delete mode 100644 codes/ssr88888888/10999180.java
delete mode 100644 codes/sssdzh/15830739.java
delete mode 100644 codes/sssyl547222/15827096.jaba
delete mode 100644 codes/sssyl547222/15827096.java
delete mode 100644 codes/ssy123/15792965.java
delete mode 100644 codes/ssya12/15718593.java
delete mode 100644 codes/steven_0324/15724446.java
delete mode 100644 codes/stevenchendy/10044195.java
delete mode 100644 codes/stevending1st/15193096.java
delete mode 100644 codes/subNvue/11264972.java
delete mode 100644 codes/suisuiya/15775252.java
delete mode 100644 codes/suixin186/15758969.java
delete mode 100644 codes/suiyue97/15816307.java
delete mode 100644 codes/sundong/15615609.java
delete mode 100644 codes/sunfei2024/15869590.java
delete mode 100644 codes/sunjinglei/9956147.java
delete mode 100644 codes/sunxiaoke/15838991.java
delete mode 100644 codes/sunxiaoshou/15541950.java
delete mode 100644 codes/sunys312/10087139.java
delete mode 100644 codes/suporisom/.keep
delete mode 100644 codes/suporisom/15815852.java
delete mode 100644 codes/survivor/15602447.java
delete mode 100644 codes/sushi13075929819/.keep
delete mode 100644 codes/sushi13075929819/10971905.java
delete mode 100644 codes/susuplus/11211308.java
delete mode 100644 codes/sususu/11260612.java
delete mode 100644 codes/suyingjie/.keep
delete mode 100644 codes/suyingjie/15845547.java
delete mode 100644 codes/sw12345677/15860800.java
delete mode 100644 codes/swgger/11211222.java
delete mode 100644 codes/sxb1110/15840824.java
delete mode 100644 codes/sym1453052794/15771464.java
delete mode 100644 codes/sym1453052794/15821043.java
delete mode 100644 codes/sym1453052794/15821842.java
delete mode 100644 codes/sym1453052794/15822577.java
delete mode 100644 codes/sym1453052794/15843194.java
delete mode 100644 codes/syst1m/15514292.java
delete mode 100644 codes/t1785968235/15860463.java
delete mode 100644 codes/taishai/.keep
delete mode 100644 codes/taishai/15867030.java
delete mode 100644 codes/tangda/.keep
delete mode 100644 codes/tangda/15764487.java
delete mode 100644 codes/tangmingqing1998/11752180.java
delete mode 100644 codes/tangxiaoting/15835893.java
delete mode 100644 codes/taohua/.keep
delete mode 100644 codes/taohua/15867385.java
delete mode 100644 codes/taoz123/15720694.java
delete mode 100644 codes/tdnginx/11207793.java
delete mode 100644 codes/techoc/18512141.java
delete mode 100644 codes/techstars/.keep
delete mode 100644 codes/techstars/15774401.java
delete mode 100644 codes/template/11204937.java
delete mode 100644 codes/tender/15568442.java
delete mode 100644 codes/tfboy168/11207647.java
delete mode 100644 codes/tg666tg/15860299.java
delete mode 100644 codes/tgtian/.keep
delete mode 100644 codes/tgtian/15866236.java
delete mode 100644 codes/theSeven/15555656.java
delete mode 100644 codes/thesky11/.keep
delete mode 100644 codes/thesky11/15811112.java
delete mode 100644 codes/thisisanuo/15720471.java
delete mode 100644 codes/thisisericq/15715035.java
delete mode 100644 codes/thisisluosheng/15730125.java
delete mode 100644 codes/thisislwl/15583856.java
delete mode 100644 codes/thisisqlbw/15722233.java
delete mode 100644 codes/thisissmdmy/15724112.java
delete mode 100644 codes/threestones/15517626.java
delete mode 100644 codes/tian0311/15831475.java
delete mode 100644 codes/tiandao186/15758999.java
delete mode 100644 codes/tingtingya/15775825.java
delete mode 100644 codes/titita/.keep
delete mode 100644 codes/titita/15866821.java
delete mode 100644 codes/titiya/15830842.java
delete mode 100644 codes/tjjcdxmy/.keep
delete mode 100644 codes/tjjcdxmy/15844593.java
delete mode 100644 codes/toutouya/15742811.java
delete mode 100644 codes/tr1120753883/15634698.java
delete mode 100644 codes/ttfei123/15719497.java
delete mode 100644 codes/ttyy23/15846026.java
delete mode 100644 codes/ttyylb/11228246.java
delete mode 100644 codes/tuboshu/.keep
delete mode 100644 codes/tuboshu/15767771.java
delete mode 100644 codes/tuoera/11301685.java
delete mode 100644 codes/turinglegacy/.keep
delete mode 100644 codes/turinglegacy/15775469.java
delete mode 100644 codes/txb0318/.15528488.java.swp
delete mode 100644 codes/txb0318/15528488.java
delete mode 100644 codes/uacdtsun/11202127.java
delete mode 100644 codes/uasda921/.keep
delete mode 100644 codes/uasda921/15782380.java
delete mode 100644 codes/uavjuju/10971568.java
delete mode 100644 codes/uetvuetv/.keep
delete mode 100644 codes/uetvuetv/11207718.java
delete mode 100644 codes/uibottommm/.keep
delete mode 100644 codes/uibottommm/15844862.java
delete mode 100644 codes/uioplck/11253331.java
delete mode 100644 codes/uiuiya/15772564.java
delete mode 100644 codes/umiapp/11244024.java
delete mode 100644 codes/uniqueO/11369940.java
delete mode 100644 codes/upgrade/11267063.java
delete mode 100644 codes/user-2352414618/15578257.java
delete mode 100644 codes/user-9548709343/14554338.java
delete mode 100644 codes/uukkya/15846280.java
delete mode 100644 codes/vajiangjiang/15837419.java
delete mode 100644 codes/vanguard/.keep
delete mode 100644 codes/vanguard/15772450.java
delete mode 100644 codes/vermouth001/15833957.java
delete mode 100644 codes/victory2/15555436.java
delete mode 100644 codes/viewport/11328946.java
delete mode 100644 codes/vipsoso/11207552.java
delete mode 100644 codes/vodka001/15830352.java
delete mode 100644 codes/vv0102/.keep
delete mode 100644 codes/vv0102/15831508.java
delete mode 100644 codes/vv89889901/11286616.java
delete mode 100644 codes/w13097865367/15857389.java
delete mode 100644 codes/w18438720464/15860134.java
delete mode 100644 codes/w188555/.keep
delete mode 100644 codes/w188555/10043819.java
delete mode 100644 codes/w193005/15783193.java
delete mode 100644 codes/w3172773640/15857664.java
delete mode 100644 codes/w964061684/15543696.java
delete mode 100755 codes/walicode/9651246.java
delete mode 100644 codes/wang001/15732362.java
delete mode 100644 codes/wang123123/15816325.java
delete mode 100644 codes/wang_lz/15895908.java
delete mode 100644 codes/wangaobin/15830618.java
delete mode 100644 codes/wangeditor/11461619.java
delete mode 100644 codes/wangjingru/15775677.java
delete mode 100644 codes/wangjz18551603897/9965927.java
delete mode 100644 codes/wanglian/.keep
delete mode 100644 codes/wanglian/15768118.java
delete mode 100644 codes/wangliping111/15556238.java
delete mode 100644 codes/wanglumin/15110274.java
delete mode 100644 codes/wangsheng112/.keep
delete mode 100644 codes/wangsheng112/15741948.java
delete mode 100644 codes/wangth/12284554.java
delete mode 100644 codes/wangyaru01/9678121.java
delete mode 100644 codes/wangzixuan654/.keep
delete mode 100644 codes/wangzixuan654/15815873.java
delete mode 100644 codes/wanmeijuhao/15724276.java
delete mode 100644 codes/wanwanya/15775672.java
delete mode 100644 codes/waste985/15615158.java
delete mode 100644 codes/waterdrop/15514437.java
delete mode 100644 codes/waveriders/.keep
delete mode 100644 codes/waveriders/15772349.java
delete mode 100644 codes/wb-qtt862918/9675682.java
delete mode 100644 codes/wcc0066/11473178.java
delete mode 100644 codes/wcjm2023/11233911.java
delete mode 100644 codes/wdg1994/15654397.java
delete mode 100644 codes/wdnmd123/10967263.java
delete mode 100644 codes/web-dream/.keep
delete mode 100644 codes/web-dream/15776234.java
delete mode 100644 codes/web3dapp/10996679.java
delete mode 100644 codes/web4usss/.keep
delete mode 100644 codes/web4usss/15844605.java
delete mode 100644 codes/webAssembly/11131659.java
delete mode 100644 codes/wechat/11212111.java
delete mode 100644 codes/wee223/15861853.java
delete mode 100644 codes/weiha162/15759131.java
delete mode 100644 codes/weijinhang/15838774.java
delete mode 100644 codes/weishuai/.keep
delete mode 100644 codes/weishuai/15795582.java
delete mode 100644 codes/weisss/15526691.java
delete mode 100644 codes/weiwei1/15837298.java
delete mode 100644 codes/weiwenjie/15736197.java
delete mode 100644 codes/weiyanqiu/15624187.java
delete mode 100644 codes/wenhuiyu/.keep
delete mode 100644 codes/wenhuiyu/15765207.java
delete mode 100644 codes/wenjlong/18626126.java
delete mode 100644 codes/wenrou99/.keep
delete mode 100644 codes/wenrou99/15831418.java
delete mode 100644 codes/werxcg435/.keep
delete mode 100644 codes/werxcg435/15829881.java
delete mode 100644 codes/wesdfwerw/.keep
delete mode 100644 codes/wesdfwerw/15831338.java
delete mode 100644 codes/whc666/15671266.java
delete mode 100644 codes/whiteSteelRain/15781044.java
delete mode 100644 codes/windaos13/.keep
delete mode 100644 codes/windaos13/15841934.java
delete mode 100644 codes/wingwf/15632876.java
delete mode 100644 codes/wisemansxl/.keep
delete mode 100644 codes/wisemansxl/15844299.java
delete mode 100644 codes/witty1972/10970403.java
delete mode 100644 codes/wjhh111/15628801.java
delete mode 100644 codes/wjy030522/15582699.java
delete mode 100644 codes/wll123/10971000.java
delete mode 100644 codes/wll123/15541001.java
delete mode 100644 codes/wmmnmd/11212424.java
delete mode 100644 codes/workii/9727876.java
delete mode 100644 codes/wq456wrfs/.keep
delete mode 100644 codes/wq456wrfs/15743473.java
delete mode 100644 codes/wrtgre24513/.keep
delete mode 100644 codes/wrtgre24513/15831250.java
delete mode 100644 codes/wsq1234567/.keep
delete mode 100644 codes/wsq1234567/15815251.java
delete mode 100644 codes/wtfock/11212229.java
delete mode 100644 codes/wu123-/15587168.java
delete mode 100644 codes/wu13935784487/15636076.java
delete mode 100644 codes/wu616562636/9947556.java
delete mode 100644 codes/wuDaoya/11122066.java
delete mode 100644 codes/wucga1/11179945.java
delete mode 100644 codes/wuchangjun/15842345.java
delete mode 100644 codes/wudi6662/.keep
delete mode 100644 codes/wudi6662/15814869.java
delete mode 100644 codes/wuli12345/15825475.java
delete mode 100644 codes/wulibaibao/9691535.java
delete mode 100644 codes/wuliuge/.keep
delete mode 100644 codes/wuliuge/15721048.java
delete mode 100644 codes/wupengyu/10969882.java
delete mode 100644 codes/wuyifan1/.keep
delete mode 100644 codes/wuyifan1/15775795.java
delete mode 100644 codes/wuyifang8012/.keep
delete mode 100644 codes/wuyifang8012/15815804.java
delete mode 100644 codes/wuyiwei/.keep
delete mode 100644 codes/wuyiwei/15853979.java
delete mode 100644 codes/wuzhenzi001/15711848.java
delete mode 100644 codes/wwee123/15720571.java
delete mode 100644 codes/wwh1096046571/.keep
delete mode 100644 codes/wwh1096046571/10040814.java
delete mode 100644 codes/wws001227/15774783.java
delete mode 100644 codes/www123456/15837892.java
delete mode 100644 codes/wxf68725032/10117253.java
delete mode 100644 codes/wxyaya/15684359.java
delete mode 100644 codes/wy16651754941/.keep
delete mode 100644 codes/wy16651754941/10972345.java
delete mode 100644 codes/wyg12345/15860946.java
delete mode 100644 codes/wyj111/15781098.java
delete mode 100644 codes/wyk12345/9950042.java
delete mode 100644 codes/wyk18220700018/15845948.java
delete mode 100644 codes/wypdao/15807776.java
delete mode 100644 codes/wypdao/15837238.java
delete mode 100644 codes/wza20021216/15778780.java
delete mode 100644 codes/wzj123/15628771.java
delete mode 100644 codes/wzj66666/15848821.java
delete mode 100644 codes/wzj666662/15860936.java
delete mode 100644 codes/x123456/10987993.java
delete mode 100644 codes/x123456/15539350.java
delete mode 100644 codes/x13433445193/15781690.java
delete mode 100644 codes/xaioli/15562718.java
delete mode 100644 codes/xcw18988783240/.keep
delete mode 100644 codes/xcw18988783240/10972415.java
delete mode 100644 codes/xd16750866428/.keep
delete mode 100644 codes/xd16750866428/10972670.java
delete mode 100644 codes/xhm17860971687/.keep
delete mode 100644 codes/xhm17860971687/10043024.java
delete mode 100644 codes/xi13313987553/.keep
delete mode 100644 codes/xi13313987553/10972326.java
delete mode 100644 codes/xiandeya/15845628.java
delete mode 100644 codes/xiao15108075188/15845548.java
delete mode 100644 codes/xiao555/.java.swp
delete mode 100644 codes/xiao555/15576144.java
delete mode 100644 codes/xiaoai/15563405.java
delete mode 100644 codes/xiaochen322/15821124.java
delete mode 100644 codes/xiaoduo/15742206.java
delete mode 100644 codes/xiaoer1/15626743.java
delete mode 100644 codes/xiaohanhan/15743008.java
delete mode 100644 codes/xiaohuaya/15742515.java
delete mode 100644 codes/xiaohudui/15724769.java
delete mode 100644 codes/xiaohudui/:wqwq
delete mode 100644 codes/xiaojun614/15778779.java
delete mode 100644 codes/xiaomi167/15759142.java
delete mode 100644 codes/xiaosheng333/15692737.java
delete mode 100644 codes/xiaowang818/15651046.java
delete mode 100644 codes/xiaowuya/15742288.java
delete mode 100644 codes/xiaoxiaoxiao/15833583.java
delete mode 100644 codes/xiaoxiaoya/15742403.java
delete mode 100644 codes/xiaoxiaoyusheng/.keep
delete mode 100644 codes/xiaoxiaoyusheng/15831390.java
delete mode 100644 codes/xiaoxuzhu/15488956.java
delete mode 100644 codes/xiaoyiyi/15742502.java
delete mode 100644 codes/xie-yuxuan44/13983623.java
delete mode 100644 codes/xierya/15742677.java
delete mode 100644 codes/xieyiyi/9964192.java
delete mode 100644 codes/xileya/15685017.java
delete mode 100644 codes/xindeya/15845628.java
delete mode 100644 codes/xindongli/.keep
delete mode 100644 codes/xindongli/15831053.java
delete mode 100644 codes/xindongli/15831053/15831053.java
delete mode 100644 codes/xingwang/11302451.java
delete mode 100644 codes/xingxing/15775128.java
delete mode 100644 codes/xingya6/15700119.java
delete mode 100644 codes/xingyao686/15775329.java
delete mode 100644 codes/xinsui/15719607.java
delete mode 100644 codes/xinyi7441/.keep
delete mode 100644 codes/xinyi7441/15815223.java
delete mode 100644 codes/xinyuxu/.keep
delete mode 100644 codes/xinyuxu/10987804.java
delete mode 100644 codes/xiucai/.keep
delete mode 100644 codes/xiucai/15799043.java
delete mode 100644 codes/xiucai/15799043/15799043.java
delete mode 100644 codes/xixi666/15859803.java
delete mode 100644 codes/xixihhh/15896349.java
delete mode 100644 codes/xizhiya/15699232.java
delete mode 100644 codes/xjz21571/15614490.java
delete mode 100644 codes/xmicai/15738579.java
delete mode 100644 codes/xpbxxx/.keep
delete mode 100644 codes/xpbxxx/15780704.java
delete mode 100644 codes/xpc2017/15790304.java
delete mode 100644 codes/xtsyx123/.keep
delete mode 100644 codes/xtsyx123/15838548.java
delete mode 100644 codes/xuanxuan/15630222.java
delete mode 100644 codes/xujinxin001/9946130.java
delete mode 100644 codes/xuliang/.keep
delete mode 100644 codes/xuliang/10045776.java
delete mode 100644 codes/xunmi666/15832154.java
delete mode 100644 codes/xunnan/15643977.java
delete mode 100644 codes/xuwangcheng14/10934340.java
delete mode 100644 codes/xuxidong/15575339.java
delete mode 100644 codes/xwq188168/15816345.java
delete mode 100644 codes/xxii77/15720091.java
delete mode 100644 codes/xxll123/15831335.java
delete mode 100644 codes/xxy88888888/11073406.java
delete mode 100644 codes/xymdaysgone/15343399.java
delete mode 100644 codes/xyy071125/15861718.java
delete mode 100644 codes/xzl999/11211117.java
delete mode 100644 codes/y133567204341/15831123.java
delete mode 100644 codes/y15336955334/15860441.java
delete mode 100644 codes/y15964620935/15831048.java
delete mode 100644 codes/y17275674594/15840277.java
delete mode 100644 codes/y18352279320/.keep
delete mode 100644 codes/y18352279320/10972594.java
delete mode 100644 codes/y18968462468/15860285.java
delete mode 100644 codes/y2915445410/15860746.java
delete mode 100644 codes/y80730176/15381500.java
delete mode 100644 codes/yai214/11079560.java
delete mode 100644 codes/yalou1/11209005.java
delete mode 100644 codes/yanerya/15771918.java
delete mode 100644 codes/yanfei06/15781511.java
delete mode 100644 codes/yang123456/15540673.java
delete mode 100644 codes/yang666/15777058.java
delete mode 100644 codes/yang666/yang666.java
delete mode 100644 codes/yanggege/.keep
delete mode 100644 codes/yanggege/15846286.java
delete mode 100644 codes/yanghai01/.keep
delete mode 100644 codes/yanghai01/15814831.java
delete mode 100644 codes/yangqing/9755006.java
delete mode 100644 codes/yangxue1/.keep
delete mode 100644 codes/yangxue1/10041714.java
delete mode 100644 codes/yangyang167/15759151.java
delete mode 100644 codes/yangyx/15808181.java
delete mode 100644 codes/yangzhiqi/15839789.java
delete mode 100644 codes/yanson/15355616.java
delete mode 100644 codes/yanyan123/15721395.java
delete mode 100644 codes/yanzi666/15636134.java
delete mode 100644 codes/yaodaojidegou/15816443.java
delete mode 100644 codes/yatou888/15861472.java
delete mode 100644 codes/yeats_liao/.keep
delete mode 100644 codes/yeats_liao/9946775.java
delete mode 100644 codes/yeyeya/15775016.java
delete mode 100644 codes/yf200304/.keep
delete mode 100644 codes/yf200304/15843198.java
delete mode 100644 codes/yf20030921/15807359.java
delete mode 100644 codes/yhfysun/15523539.java
delete mode 100644 codes/yigekongbai/.keep
delete mode 100644 codes/yigekongbai/15867120.java
delete mode 100644 codes/yiiixxxx/15688342.java
delete mode 100644 codes/yikanji/10160695.java
delete mode 100644 codes/yimengzhiyan/16563760.java
delete mode 100644 codes/yinrr123/15627843.java
delete mode 100644 codes/yisheng/15775181.java
delete mode 100644 codes/yisuiyuan/.java
delete mode 100644 codes/yisuiyuan/15539123.java
delete mode 100644 codes/yixiak/15186898.java
delete mode 100644 codes/yiyi123/15684743.java
delete mode 100644 codes/yiyicoder/15630262.java
delete mode 100644 codes/yiyiguowang/15885939.java
delete mode 100644 codes/yj1198222879/9947891.java
delete mode 100644 codes/yjh123456/15542529.java
delete mode 100644 codes/yk12345/15606552.java
delete mode 100644 codes/ylolpeng/11122754.java
delete mode 100644 codes/yls3050933027/15895415.java
delete mode 100644 codes/ymx2026/11211004.java
delete mode 100644 codes/yoU_Qu/15526866.java
delete mode 100644 codes/you1229/15774816.java
delete mode 100644 codes/yp33posit/.keep
delete mode 100644 codes/yp33posit/15840404.java
delete mode 100644 codes/yqh15977954304/15861888.java
delete mode 100644 codes/yrr456/15542411.java
delete mode 100644 codes/ysyhl9tian/15698870.java
delete mode 100644 codes/ytaomg/11211641.java
delete mode 100644 codes/yuanps/10188803.java
delete mode 100644 codes/yueliang9809/15847888.java
delete mode 100644 codes/yujinghui/15805872.java
delete mode 100644 codes/yulinL/.java
delete mode 100644 codes/yulinL/13638622.java
delete mode 100644 codes/yuliwei/15592333.java
delete mode 100644 codes/yunyunne/15775145.java
delete mode 100644 codes/yuyuya/15772019.java
delete mode 100644 codes/yuyuyu11/15522885.java
delete mode 100644 codes/yuzhanao/15592466.java
delete mode 100644 codes/ywf123456/15834908.java
delete mode 100644 codes/yxy522/15832952.java
delete mode 100644 codes/yy19047006973/.keep
delete mode 100644 codes/yy19047006973/10972205.java
delete mode 100644 codes/yyds0102/11208011.java
delete mode 100644 codes/yyguaiguaizai/15651703.java
delete mode 100644 codes/yyh520/15551703.java
delete mode 100644 codes/yyui123/15718758.java
delete mode 100644 codes/yyya12/15700309.java
delete mode 100644 codes/yzqzhiqi/.keep
delete mode 100644 codes/yzqzhiqi/15805886.java
delete mode 100644 codes/z1126376522/15835615.java
delete mode 100644 codes/z13213005762/15514594.java
delete mode 100644 codes/z13213005762/15515049.java
delete mode 100644 codes/z16692104570/15823309.java
delete mode 100644 codes/z17735706081/15774718.java
delete mode 100644 codes/z2468479040/11197656.java
delete mode 100644 codes/zangzang/9952436.java
delete mode 100644 codes/zcx1534344521/16410752.java
delete mode 100644 codes/zer0_1s/10517202.java
delete mode 100644 codes/zeroday/15115160.java
delete mode 100644 codes/zerofei_tsai/10742215.java
delete mode 100644 codes/zgm1214/15650118.java
delete mode 100644 codes/zhangll/10007624.java
delete mode 100644 codes/zhangmin_1/15815725.java
delete mode 100644 codes/zhangpc/10298011.java
delete mode 100644 codes/zhangshaopu/9785926.java
delete mode 100644 codes/zhangwei001/15709943.java
delete mode 100644 codes/zhangxiao123/15858470.java
delete mode 100644 codes/zhangxiaoQ/15509138.java
delete mode 100644 codes/zhangyuyun/18461684.java
delete mode 100644 codes/zhao1218jk/.keep
delete mode 100644 codes/zhao1218jk/10981574.java
delete mode 100644 codes/zhaokang/15619865.java
delete mode 100644 codes/zhengxinyue/15833712.java
delete mode 100644 codes/zhenhan0502/.keep
delete mode 100644 codes/zhenhan0502/10987497.java
delete mode 100644 codes/zhenkuai/.keep
delete mode 100644 codes/zhenkuai/15817268.java
delete mode 100644 codes/zhixinheyi/15775293.java
delete mode 100644 codes/zhizhihua1/15588689.java
delete mode 100644 codes/zhizhixia/15563504.java
delete mode 100644 codes/zhizi123/15635289.java
delete mode 100644 codes/zhonggui/11896235.java
delete mode 100644 codes/zhongyaya/15846137.java
delete mode 100644 codes/zhoucheng/11464584.java
delete mode 100644 codes/zhouxuan01/.keep
delete mode 100644 codes/zhouxuan01/15845799.java
delete mode 100644 codes/zhouyi/15778243.java
delete mode 100644 codes/zhuweiZy/.keep
delete mode 100644 codes/zhuweiZy/15846061.java
delete mode 100644 codes/zhw_tt/16576195.java
delete mode 100644 codes/zihao2003/15810758.java
delete mode 100644 codes/zk_cxz/15621975.java
delete mode 100644 codes/zl940825/.keep
delete mode 100644 codes/zl940825/10979064.java
delete mode 100644 codes/zl954208/.keep
delete mode 100644 codes/zl954208/10981200.java
delete mode 100644 codes/zmq11111/15512070.java
delete mode 100644 codes/zn18829358170/15861141.java
delete mode 100644 codes/znnzmm/11212509.java
delete mode 100644 codes/zouyu5521/11464070.java
delete mode 100644 codes/zrccxx/10850939.java
delete mode 100644 codes/zrzrzr/15805335.java
delete mode 100644 codes/ztpmasters/.keep
delete mode 100644 codes/ztpmasters/15846690.java
delete mode 100644 codes/zu15047422887/.keep
delete mode 100644 codes/zu15047422887/15607358.java
delete mode 100644 codes/zu15047422887/15607367.java
delete mode 100644 codes/zu15147473922/.keep
delete mode 100644 codes/zu15147473922/15837017.java
delete mode 100644 codes/zu15147473922/15837089.java
delete mode 100644 codes/zu15147473922/15837113.java
delete mode 100644 codes/zuileya/15775295.java
delete mode 100644 codes/zuobao/.keep
delete mode 100644 codes/zuobao/15858174.java
delete mode 100644 codes/zuokem6/11118132.java
delete mode 100644 codes/zuotian/15659839.java
delete mode 100644 codes/zwjdashabi1001/15895572.java
delete mode 100644 codes/zwl111/15779557.java
delete mode 100644 codes/zwl111/15779562.java
delete mode 100644 codes/zxc123/15513151.java
delete mode 100644 codes/zxcvbaa225/.keep
delete mode 100644 codes/zxcvbaa225/15735743.java
delete mode 100644 codes/zxd30022/10164256.java
delete mode 100644 codes/zxf1795065101/15563222.java
delete mode 100644 codes/zxg_god/11128523.java
delete mode 100644 codes/zxj158300/15866865.java
delete mode 100644 codes/zxmyigeren/15488956.java
delete mode 100644 codes/zxmyigeren/15539430.java
delete mode 100644 codes/zxntbj6/.keep
delete mode 100644 codes/zxntbj6/15846512.java
delete mode 100644 codes/zxq777/15540332.java
delete mode 100644 codes/zy2239106/14616675.java
delete mode 100644 codes/zycq13350636821/15859606.java
delete mode 100644 codes/zyx1373529784/.11255507.java.swp
delete mode 100644 codes/zyx1373529784/11255507.java
delete mode 100644 codes/zyy022/15592411.java
delete mode 100644 codes/zzc666233/15861698.java
delete mode 100644 codes/zzcaicai/15725032.java
delete mode 100644 codes/zzdpop/11212991.java
delete mode 100644 codes/zzmini/11076797.java
delete mode 100644 codes/zzy2744726697/15860385.java
delete mode 100644 l1017026323/15630469.java
delete mode 100644 qwer121234/15859995.java
delete mode 100644 smcO0O/10708545.java
delete mode 100644 yimengzhiyan/16563760.java
delete mode 100644 zhouyi/15778243.java
diff --git a/.idea/.gitignore b/.idea/.gitignore
deleted file mode 100644
index 13566b81..00000000
--- a/.idea/.gitignore
+++ /dev/null
@@ -1,8 +0,0 @@
-# Default ignored files
-/shelf/
-/workspace.xml
-# Editor-based HTTP Client requests
-/httpRequests/
-# Datasource local storage ignored files
-/dataSources/
-/dataSources.local.xml
diff --git a/.idea/checkstyle-idea.xml b/.idea/checkstyle-idea.xml
deleted file mode 100644
index 287a44db..00000000
--- a/.idea/checkstyle-idea.xml
+++ /dev/null
@@ -1,17 +0,0 @@
-
-
-
-
-
-
\ No newline at end of file
diff --git a/.idea/inspectionProfiles/Project_Default.xml b/.idea/inspectionProfiles/Project_Default.xml
deleted file mode 100644
index 6560a989..00000000
--- a/.idea/inspectionProfiles/Project_Default.xml
+++ /dev/null
@@ -1,36 +0,0 @@
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/.idea/misc.xml b/.idea/misc.xml
deleted file mode 100644
index 8ed5f34d..00000000
--- a/.idea/misc.xml
+++ /dev/null
@@ -1,6 +0,0 @@
-
-
-
-
-
-
\ No newline at end of file
diff --git a/.idea/modules.xml b/.idea/modules.xml
deleted file mode 100644
index 0b11f0fd..00000000
--- a/.idea/modules.xml
+++ /dev/null
@@ -1,8 +0,0 @@
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/.idea/vcs.xml b/.idea/vcs.xml
deleted file mode 100644
index 35eb1ddf..00000000
--- a/.idea/vcs.xml
+++ /dev/null
@@ -1,6 +0,0 @@
-
-
-
-
-
-
\ No newline at end of file
diff --git a/15372338.java b/15372338.java
deleted file mode 100644
index c2afaa24..00000000
--- a/15372338.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/15620229.java b/15620229.java
deleted file mode 100644
index 462bdb84..00000000
--- a/15620229.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/15651046.java b/15651046.java
deleted file mode 100644
index fbce6b9f..00000000
--- a/15651046.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; ++j) {
- if(a[j] > a[j + 1]) {
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-} //end
-
diff --git a/15684741.java b/15684741.java
deleted file mode 100644
index 421e92a6..00000000
--- a/15684741.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 arr[j] 和 arr[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/15778243.java b/15778243.java
deleted file mode 100644
index a57d0565..00000000
--- a/15778243.java
+++ /dev/null
@@ -1 +0,0 @@
-sr
diff --git a/15781013.java b/15781013.java
deleted file mode 100644
index 9d6bf11c..00000000
--- a/15781013.java
+++ /dev/null
@@ -1,24 +0,0 @@
-public class Color {
- public enum color{红,蓝,绿,黄,黑};
- public static void main(String arg[]){
- int i,j,k,num=0;
- color colors[]=color.values();
- System.out.println("从红，蓝，绿，黄，黑这五种颜色中取出三种不同颜色的排列有以下可能性：");
- for(i=0;i a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/9619048.java b/9619048.java
deleted file mode 100644
index 49439b98..00000000
--- a/9619048.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过重复地遍历待排序数组，比较并交换相邻元素，使无序数组变得有序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j < n - 1 - i; j++) {
- // 如果当前元素大于下一个元素，则交换它们
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/LICENSE b/LICENSE
deleted file mode 100644
index c8df5b0c..00000000
--- a/LICENSE
+++ /dev/null
@@ -1,29 +0,0 @@
-BSD 3-Clause License
-
-Copyright (c) 2024, njjkxllj
-All rights reserved.
-
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions are met:
-
-* Redistributions of source code must retain the above copyright notice, this
- list of conditions and the following disclaimer.
-
-* Redistributions in binary form must reproduce the above copyright notice,
- this list of conditions and the following disclaimer in the documentation
- and/or other materials provided with the distribution.
-
-* Neither the name of the copyright holder nor the names of its
- contributors may be used to endorse or promote products derived from
- this software without specific prior written permission.
-
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
-FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
-DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
-SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
-CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
-OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/README.en.md b/README.en.md
deleted file mode 100644
index 15602cc0..00000000
--- a/README.en.md
+++ /dev/null
@@ -1,36 +0,0 @@
-# activity-school
-
-#### Description
-高校活动-pr仓库
-
-#### Software Architecture
-Software architecture description
-
-#### Installation
-
-1. xxxx
-2. xxxx
-3. xxxx
-
-#### Instructions
-
-1. xxxx
-2. xxxx
-3. xxxx
-
-#### Contribution
-
-1. Fork the repository
-2. Create Feat_xxx branch
-3. Commit your code
-4. Create Pull Request
-
-
-#### Gitee Feature
-
-1. You can use Readme\_XXX.md to support different languages, such as Readme\_en.md, Readme\_zh.md
-2. Gitee blog [blog.gitee.com](https://blog.gitee.com)
-3. Explore open source project [https://gitee.com/explore](https://gitee.com/explore)
-4. The most valuable open source project [GVP](https://gitee.com/gvp)
-5. The manual of Gitee [https://gitee.com/help](https://gitee.com/help)
-6. The most popular members [https://gitee.com/gitee-stars/](https://gitee.com/gitee-stars/)
diff --git a/README.md b/README.md
deleted file mode 100644
index f30f250c..00000000
--- a/README.md
+++ /dev/null
@@ -1,5 +0,0 @@
-## 介绍
-
-本仓库用于提交龙蜥一刻-高校活动任务的PR。
-
-注意：完成迁移后，必须将成果提交到本仓库，才能获得贡献值。
diff --git a/Zoey12138/15846229.java b/Zoey12138/15846229.java
deleted file mode 100644
index 5cc1c636..00000000
--- a/Zoey12138/15846229.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * 功能：将无序数组 a 按照从小到大的顺序进行排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 外层循环控制所有轮数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环控制每一轮的比较次数
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/activity-school b/activity-school
deleted file mode 160000
index e3039d45..00000000
--- a/activity-school
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit e3039d45f32adcbac55d745197aa67e2d487bb6f
diff --git a/activity-school.iml b/activity-school.iml
deleted file mode 100644
index c76917ee..00000000
--- a/activity-school.iml
+++ /dev/null
@@ -1,16 +0,0 @@
-
-
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/codes/ BHUIJ217892/11003994.java b/codes/ BHUIJ217892/11003994.java
deleted file mode 100644
index b9bf7818..00000000
--- a/codes/ BHUIJ217892/11003994.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/ Dreamlover/11202583.java b/codes/ Dreamlover/11202583.java
deleted file mode 100644
index 272a12fc..00000000
--- a/codes/ Dreamlover/11202583.java
+++ /dev/null
@@ -1,18 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- } //end
\ No newline at end of file
diff --git a/codes/ Greeter/11262621.java b/codes/ Greeter/11262621.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/ Greeter/11262621.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/ Iboydoss/11210866.java b/codes/ Iboydoss/11210866.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/ Iboydoss/11210866.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/ Jingyu/11302198.java b/codes/ Jingyu/11302198.java
deleted file mode 100644
index cacd12f1..00000000
--- a/codes/ Jingyu/11302198.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- a[j] = a[j]+a[j+1];
- a[j+1] = a[j]-a[j+1];
- a[j] = a[j]-a[j+1];
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/ NProgress/11324505.java b/codes/ NProgress/11324505.java
deleted file mode 100644
index 9e7534d4..00000000
--- a/codes/ NProgress/11324505.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡 排序 函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-}//end
\ No newline at end of file
diff --git a/codes/ OPReno/11276365.java b/codes/ OPReno/11276365.java
deleted file mode 100644
index cacd12f1..00000000
--- a/codes/ OPReno/11276365.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- a[j] = a[j]+a[j+1];
- a[j+1] = a[j]-a[j+1];
- a[j] = a[j]-a[j+1];
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/ PHPhph/.keep b/codes/ PHPhph/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/ PHPhph/11120724.java b/codes/ PHPhph/11120724.java
deleted file mode 100644
index 667eee0f..00000000
--- a/codes/ PHPhph/11120724.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/ Qw2229188799/11089611.java b/codes/ Qw2229188799/11089611.java
deleted file mode 100644
index 607a9246..00000000
--- a/codes/ Qw2229188799/11089611.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡 排序 函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-}//end
diff --git a/codes/ String/11118586.java b/codes/ String/11118586.java
deleted file mode 100644
index cacd12f1..00000000
--- a/codes/ String/11118586.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- a[j] = a[j]+a[j+1];
- a[j+1] = a[j]-a[j+1];
- a[j] = a[j]-a[j+1];
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/ YYDS2023/11094401.java b/codes/ YYDS2023/11094401.java
deleted file mode 100644
index 1c888994..00000000
--- a/codes/ YYDS2023/11094401.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/ Z3608759124/10979186.java b/codes/ Z3608759124/10979186.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/ Z3608759124/10979186.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/ budasan/11121691.java b/codes/ budasan/11121691.java
deleted file mode 100644
index 24b49b4b..00000000
--- a/codes/ budasan/11121691.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/ bupiovm0101/11122657.java b/codes/ bupiovm0101/11122657.java
deleted file mode 100644
index 4d7083fe..00000000
--- a/codes/ bupiovm0101/11122657.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int i, j;
-
- for(i=0; ia[j]){
- int temp;
- temp = a[j-1];
- a[j-1] = a[j];
- a[j] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/ buzhidao/11118686.java b/codes/ buzhidao/11118686.java
deleted file mode 100644
index 8d589d7e..00000000
--- a/codes/ buzhidao/11118686.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a,int n){
- int temp =0;
- for(int i = 0;ia[j+1]){
- temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-
-
-}
\ No newline at end of file
diff --git a/codes/ deijia909/.keep b/codes/ deijia909/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/ fasfaf227/.keep b/codes/ fasfaf227/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/ fasfaf227/15820189.java b/codes/ fasfaf227/15820189.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/ fasfaf227/15820189.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/ gui8989/11228793.java b/codes/ gui8989/11228793.java
deleted file mode 100644
index 24b49b4b..00000000
--- a/codes/ gui8989/11228793.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/ liwei2496/11466656.java b/codes/ liwei2496/11466656.java
deleted file mode 100644
index 272a12fc..00000000
--- a/codes/ liwei2496/11466656.java
+++ /dev/null
@@ -1,18 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- } //end
\ No newline at end of file
diff --git a/codes/ lovscene/11290992.java b/codes/ lovscene/11290992.java
deleted file mode 100644
index cacd12f1..00000000
--- a/codes/ lovscene/11290992.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- a[j] = a[j]+a[j+1];
- a[j+1] = a[j]-a[j+1];
- a[j] = a[j]-a[j+1];
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/ memuqee/11238999.java b/codes/ memuqee/11238999.java
deleted file mode 100644
index 24b49b4b..00000000
--- a/codes/ memuqee/11238999.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/ mupimage/11254168.java b/codes/ mupimage/11254168.java
deleted file mode 100644
index 8d589d7e..00000000
--- a/codes/ mupimage/11254168.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a,int n){
- int temp =0;
- for(int i = 0;ia[j+1]){
- temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-
-
-}
\ No newline at end of file
diff --git a/codes/ neineiya/11260235.java b/codes/ neineiya/11260235.java
deleted file mode 100644
index cacd12f1..00000000
--- a/codes/ neineiya/11260235.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- a[j] = a[j]+a[j+1];
- a[j+1] = a[j]-a[j+1];
- a[j] = a[j]-a[j+1];
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/ openAI12/11234314.java b/codes/ openAI12/11234314.java
deleted file mode 100644
index 272a12fc..00000000
--- a/codes/ openAI12/11234314.java
+++ /dev/null
@@ -1,18 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- } //end
\ No newline at end of file
diff --git a/codes/ opsation/11293380.java b/codes/ opsation/11293380.java
deleted file mode 100644
index cacd12f1..00000000
--- a/codes/ opsation/11293380.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- a[j] = a[j]+a[j+1];
- a[j+1] = a[j]-a[j+1];
- a[j] = a[j]-a[j+1];
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/ passass/11299378.java b/codes/ passass/11299378.java
deleted file mode 100644
index 9e7534d4..00000000
--- a/codes/ passass/11299378.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡 排序 函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-}//end
\ No newline at end of file
diff --git a/codes/ sdsacc23/.keep b/codes/ sdsacc23/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/ sdsacc23/15743254.java b/codes/ sdsacc23/15743254.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/ sdsacc23/15743254.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/ slamer/11242607.java b/codes/ slamer/11242607.java
deleted file mode 100644
index 8c505501..00000000
--- a/codes/ slamer/11242607.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;i a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/ subNvue/11264972.java b/codes/ subNvue/11264972.java
deleted file mode 100644
index 9e7534d4..00000000
--- a/codes/ subNvue/11264972.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡 排序 函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-}//end
\ No newline at end of file
diff --git a/codes/ susuplus/11211308.java b/codes/ susuplus/11211308.java
deleted file mode 100644
index 4d7083fe..00000000
--- a/codes/ susuplus/11211308.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int i, j;
-
- for(i=0; ia[j]){
- int temp;
- temp = a[j-1];
- a[j-1] = a[j];
- a[j] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/ swgger/11211222.java b/codes/ swgger/11211222.java
deleted file mode 100644
index 1c888994..00000000
--- a/codes/ swgger/11211222.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/ ttyylb/11228246.java b/codes/ ttyylb/11228246.java
deleted file mode 100644
index 9e7534d4..00000000
--- a/codes/ ttyylb/11228246.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡 排序 函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-}//end
\ No newline at end of file
diff --git a/codes/ uioplck/11253331.java b/codes/ uioplck/11253331.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/ uioplck/11253331.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/ xingwang/11302451.java b/codes/ xingwang/11302451.java
deleted file mode 100644
index 4d7083fe..00000000
--- a/codes/ xingwang/11302451.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int i, j;
-
- for(i=0; ia[j]){
- int temp;
- temp = a[j-1];
- a[j-1] = a[j];
- a[j] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/ zhoucheng/11464584.java b/codes/ zhoucheng/11464584.java
deleted file mode 100644
index cacd12f1..00000000
--- a/codes/ zhoucheng/11464584.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- a[j] = a[j]+a[j+1];
- a[j+1] = a[j]-a[j+1];
- a[j] = a[j]-a[j+1];
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/ znnzmm/11212509.java b/codes/ znnzmm/11212509.java
deleted file mode 100644
index 272a12fc..00000000
--- a/codes/ znnzmm/11212509.java
+++ /dev/null
@@ -1,18 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- } //end
\ No newline at end of file
diff --git a/codes/ zouyu5521/11464070.java b/codes/ zouyu5521/11464070.java
deleted file mode 100644
index a833d8d3..00000000
--- a/codes/ zouyu5521/11464070.java
+++ /dev/null
@@ -1,24 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int j=0;ja[i+1])
- {
- temp=a[i];
- a[i]=a[i+1];
- a[i+1]=temp;
- }
- }
- }
- //System.out.println(a);
-
-} //end
\ No newline at end of file
diff --git a/codes/.10968772.java.swo b/codes/.10968772.java.swo
deleted file mode 100644
index 2f0782cd2cfb53bcbe2e5e5d2ab0284ecdb06b84..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001
literal 12288
zcmeI%%}T>S5C`z7Cq0OwH&3gcL~OoFS}A=14<75GC5M={x+P75Spy=q&^Hi#79Yh&
z@$77py;$&45CZ>!$#f^X%jO3;gx=eCH@BkKwu$3VU#fUt6FsG=GULCh96ir`*~vSx
z^z)f|@D`q*#G{QRZ+b&3jFc>-db!G@$25(tD4k4m%dxNhUbpME=V1|UtV9C>5ZGQ|
zf9SbR`Kq6vor>e5;r3f%2M9m_0uX=z1Rwwb2tc4Q0xE0Kich;!pLn;ftzWesqCfxw
z5P$##AOHafKmY;|fB*y_&_IE3LgXG0C7k;IfAjtS&Eqf5PtFg{6=%Vjah7u%_^dcG
z1Rwwb2tWV=5P$##AOHafK;VA_mLxc;Yx!fZ3f(oaq_Ss*riSDBr4tO)bdmM-4AVE2
d?+1fw65lsnQ)QxrUaDsVeHx$W%`U_%{QyHKK>h##
diff --git a/codes/.14612723.java.swp b/codes/.14612723.java.swp
deleted file mode 100644
index ac73c7bef85da8629ba5874ee159d7b3721b6afa..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001
literal 12288
zcmeI1&ubGw6vwCHwJLh*?NvRriRosO8e7tcr-BDhQV%T=W;aPQNzBG%6Ix0Yp(=`4
z2*iqbNEJK?LeX1d+P}bmK(E;ig5W{$OmxoI3NkfI}rYH$>
z-B-|)hLKTpBNi_x>TF02TnPkcQoO{6DrtcT5P{iQ
zB0vO)01+SpM1Tko0U|Im1kBtRyN{c@}VYBzfLjs4fO%_6qQ6R
zqAsFNqJE?257ZY_4Yh}Qk9vc0`i&qjIx-O;0z`la5CI}U1c(3;AOb|-{}I>(MTuu)
z3~+2Z&%rl2)ADhi4tF<20;cpN&#uN7Gkg^y5%5pLMt8gCB5Ma{a;3i%)Sj)}lY_6M
zqHsGRBX~iL9-86ow6hM+IKo3-!0B?e+ob;j2_p|vB5Ohl@M>WU3y=jL2$UKIuQ%17
zJ#Zbrd)Tgna2-V30jq`A+o_fVv5JZ
F{sLd=>-7Kt
diff --git a/codes/.15531109.java.swp b/codes/.15531109.java.swp
deleted file mode 100644
index c864535bd03b34efb00f73d0285538349be06989..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001
literal 12288
zcmeI2&ubG=5XUE8#6ztp2;N3L*e0f%HB?)x;!zKtq#jywc)Od}7t?G^b`wNe5n4s5
z76P>*9^wxKZ-U?=j;Yg{sTQYZSxcK#uLZq51x`UFaajO
z1egF5U;<2l2`~XBFfs(3QVbqZw}<*2pX|rjzSy5~U;<2l2`~XBzyz286JP>NfC(@G
zCcp$nkbtlNDq{d$lKTE1zW?uy1Nfw$q!#HFsZKITNz!4`kD~zJNY6=`&sufhA{`aY7Z#Q>D}#g)3OZBubJ_(?lY451g{+lzk_;;#=HW>B0*)njpz8jouvyj~Jzu}rOcJL~?-I%T4oy$Zj!cD?4OArn=M
enAElqXc%ak>fU=&_rJdDW%8c3DHCY%IQ#*Lhu;7I
diff --git a/codes/.15781098.java.swp b/codes/.15781098.java.swp
deleted file mode 100644
index 7ab5fa2da02804ce9e1820104ce59e64b23ffae6..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001
literal 12288
zcmeI2&rcIU6vr2@iWv0*5D1-confXMNQ#U92Ey&$Jvq
zC1yYZNB{{S0VIF~kN^@u0!ZM<5KzKp%yV#i%yE3)>C1|GXNVmVKmter2_OL^fCP{L
z5$+mXPEDxHP9GH0NnxAfi8n~A%7Y)1xkR1K-QT@kQrJ=0!RP}AOR$R1dsp{KmthM
zKLq*+%L<{pe1P;9y#n0B5NLgbSbgzlbL^J|?s1bVKn#+~ibxL^4hw-Q((77bSwa_I
zXzyo?ohfxAW_+I2R#V!{FdcoZznN9D^IGD=&#e(7v#w1hwTTsdbC7;n)i+1YnCvJl
z>C@|4a$zqPqwy@=Ue=QtS9-V0Qcle|#}~Op6geumZJVoR1CvJTqduR7Lv2g8J=Z~Y
zAR$~^2dO5$b~BsM6)u$xLd@lSWT_A_q*&YSu=e5*6Q`Bs_I{Q^s*Y)!EFDg$8!>fb
znGOx;>vME|NzEqdSkgTS9Ol*(ft+J;-=1jO6CHbCP0U*hNBx~5Pa+DZK-Vpa0pgGP{hh)CNmi`d
z+S&U@5IT$Ax2umpys>Y)~q>(}Y0RJEV7bgA@66hfe
zq|t>%lJ85dmwU;*y!#|KT-vkSclR|_wmAb`N`0_B$L
zG*(yr{Oq(=Id1JyAsm%zJYn8btsB1Q0*~
z0R#|0009ILKmdV)fY%q99f~aSVgCPb-v4Gj&&Sl{2?P*8009ILKmY**5I_I{1Q7V2
Y0#y?y54Y7M38E~Hf-IKpR9CV{mR7Vcr~m)}
diff --git a/codes/.16199622.java.swp b/codes/.16199622.java.swp
deleted file mode 100644
index 32d3c90e5233ba647b45663b8ee036d1c77357fd..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001
literal 12288
zcmeI%%}&BV5C`zZgBL%eFR*H2P%N~?5J|y{Cl8(s9v~dr0%4ol61qT)LEgl~C-D`0
z4&%+UiLnak9e$~GS&}6na=;pqCV)9
zy62`_Dn^m+jU032_k#LD%ahu$V7pQbg?!K=w;P6j!3|sOs9=lbrdL
zlPMAeAOHafKmY;|fB*y_009U<00Jv0V7C~1-e&BbLjC`r{{Da4VeFOSg;~73OE^
zj@|H@RoTApSxilT4k~Fzv#M4s7F7$cs&-m4UlyIL>Z!!FlSh_r+6ntv5lHS)W1tz9
zcPT7S(~=cwRZvy8L`AI-xm;3JeepAOi}ePMFI*l;TT&W^qQ#wo}F002YK
B8@~Vm
diff --git a/codes/.9947891.swp b/codes/.9947891.swp
deleted file mode 100644
index fe92cb7063bbe4dfd1032f38b5a17ecf174b7b7c..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001
literal 12288
zcmeI%y9&ZE6oBEQyC}L#)m3fc1??j^IO^cmR>f)|MT?+=KB|wRt(QsaJ8UQ56@c_?Ly@*zCtc(LfiG@
z;26ZG&cWXp6WYF6t`4^23`S!|f5otY00RFKC`rGkpI5!rY*@AG>|cq=g8%{uAb$MI*adG3mJ0`jzWnDAbr%Ffq-<*dJpj7jnuH
z>aHIJhaif(JAbLvM)%XGoo?Gh%Qgnu%00NbKsFFS;12?oiP`TxpL(a=YBuVVKjb6@
z0tg_000IagfB*sr6h$BkOL9(&Ex!vceVL1LAL>K^0R#|0009ILKmY**5I_Kdyns6s
qxmHE)Y0v)uf4={p>-=$c5I_I{1Q0*~0R#|0009ILK%j5}fjj_;CL{C!
diff --git a/codes/.DS_Store b/codes/.DS_Store
deleted file mode 100644
index 08398a745c3ed48fadca1439299475676fa814c6..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001
literal 8196
zcmeHMU2GIp6u#fI&>1_>DO+d@u3e}AME8M9b{xlCtHc6`q4
zND)OKia->BC<0Lgq6qvOB0%44zlk^a?sIF@M-hl3@V|_Je?BDW@?|oVQ(Oi|2X#RS
zK+-P(f=2gL2LzZzD3hU_;xd5Jn!I{I2t`<8fWyh2@TZeZhH{Ea4rkzShHz(u6$*mg
z36}__GbFi;`X~ZX1m;G-Palb?Ok;UwTwA}pV_DPAlJ$e^m}$6PbMto)%E}iktf-JG
zDk~mJAGXKSp6V6clF#6-)6O-+dnEt@8r5)UDJAKA5x3Lf&#SN_9>(a|KiN^qr=eHXhYUSLNm$+cbM^*YKAa9`f{K
zo^P9D8X9qJ$7>H3%P300)%$c>%P8s{w4ys?(3U>1W|o@}-&$OI>&iRUtlO}8dumr#
z&vcbiy(Cr>TQ*oUTqA4h1LKC~9UfNQoNj4`b!dcwZF$DShVDq!SSIybYF-aea=pAl
zR2s#hLe@B1FuX^mmsBfNak)X>uhBz1U~4`~6P43qU|A(M#72EfyQ5RDiBh1xQ(hhG
zcj;M0Mdg}%VryglN9e6fipw?4u@-s2RI|D%DH>mGW2{vkEb=%@N*7mdiEWdIa&|sX
zkL=RpHgWY1+WCOLbGPbxJ!85xvw6GRDUY~^RY&g`C)$b1d5+jk`rz%6#Rqk2hG#n>
zH+GYY!~SwRHH}u{%3isT5QKLz-YZdBDndAH
zxsQgbQpP9CYgDi1>?-@6
z7`_-W;`Loa[wll+1]) {
-int temp=a[wll];
-a[wll]=a[wll+1];
-a[wll+1]=temp;
-}
-}
-}
-}
diff --git a/codes/11179070.java b/codes/11179070.java
deleted file mode 100644
index b6134020..00000000
--- a/codes/11179070.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
-
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-}//end
diff --git a/codes/11446072.java b/codes/11446072.java
deleted file mode 100644
index 17fde96e..00000000
--- a/codes/11446072.java
+++ /dev/null
@@ -1,19 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n-1; j++) {
- if(a[j] > a[j+1]){
- int tmp = 0;
- tmp = a[j];
- a[j] = a[j+1];
- a[j+1] = tmp;
- }
- }
- }
-} //end
diff --git a/codes/15527405.java b/codes/15527405.java
deleted file mode 100644
index cb54d2b3..00000000
--- a/codes/15527405.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
-} //end
diff --git a/codes/15541001.java b/codes/15541001.java
deleted file mode 100644
index 32468728..00000000
--- a/codes/15541001.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int tata = 0; tata < n - i - 1; tata++) {
- if(a[tata] > a[tata + 1]) {
- int temp = a[tata];
- a [tata] = a[tata + 1];
- a[tata + 1] = temp;
- }
- }
- }
-
-
-} //end,tatazj
diff --git a/codes/15582699.java b/codes/15582699.java
deleted file mode 100644
index e8b6c17b..00000000
--- a/codes/15582699.java
+++ /dev/null
@@ -1,18 +0,0 @@
-OB/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换a[j]和a[j+1]的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/15585762.java b/codes/15585762.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/15585762.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/15607358.java b/codes/15607358.java
deleted file mode 100644
index ebbb1f9f..00000000
--- a/codes/15607358.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- *
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换相邻两个元素的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
-
diff --git a/codes/15620229.java b/codes/15620229.java
deleted file mode 100644
index 462bdb84..00000000
--- a/codes/15620229.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/15636076.java b/codes/15636076.java
deleted file mode 100644
index 65e242d0..00000000
--- a/codes/15636076.java
+++ /dev/null
@@ -1,19 +0,0 @@
-```java
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/15699820.java b/codes/15699820.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/15699820.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/15700256.java b/codes/15700256.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/15700256.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/15700309.java b/codes/15700309.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/15700309.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/15732362.java b/codes/15732362.java
deleted file mode 100644
index 080b9658..00000000
--- a/codes/15732362.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过对相邻的元素进行两两比较，顺序相反则进行交换，每一轮比较会将当前未排序部分的最大值“冒泡”到未排序部分的末尾。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制所有轮数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮比较的次数
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // endi
diff --git a/codes/15759151.java b/codes/15759151.java
deleted file mode 100644
index 76cbddd8..00000000
--- a/codes/15759151.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int b = 0; b < n - i - 1; b++) {
- if(a[b] > a[b + 1]) {
- int temp = a[b];
- a [b] = a[b + 1];
- a[b + 1] = temp;
- }
- }
- }
-
-
-} //end
diff --git a/codes/15775145.java b/codes/15775145.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/15775145.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/15776507.java b/codes/15776507.java
deleted file mode 100644
index ae82e695..00000000
--- a/codes/15776507.java
+++ /dev/null
@@ -1,35 +0,0 @@
-/**
-
- * 冒泡排序函数
-
- * aa bb cc
-
- * @param a 待排序的数组
-
- * @param n 待排序的数组长度
-
- */
-
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0; i < n-1 ; i++){
-
- for (int j = 0;j < n-1-i;j++){
-
- if(a[j] > a[j+1]){
-
- int temp = a[j];
-
- a[j] = a[j+1];
-
- a[j+1] = temp;
-
- }
-
- }
-
- }
-
-
-
-} //end
diff --git a/codes/15834244.java b/codes/15834244.java
deleted file mode 100644
index 35961189..00000000
--- a/codes/15834244.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组a进行冒泡排序，将其变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序趟数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环，进行相邻元素比较和交换
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们
- // 交换a[j]和a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/15845628.java b/codes/15845628.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/15845628.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/16200342.java b/codes/16200342.java
deleted file mode 100644
index 044bc48a..00000000
--- a/codes/16200342.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
-
diff --git a/codes/17034577.java b/codes/17034577.java
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/18149367.java b/codes/18149367.java
deleted file mode 100644
index 63cda17a..00000000
--- a/codes/18149367.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- int temp;
- for(i=0; i < a.length - 1;i++) {
- for (int j = 0; j < arr.length - i - 1; j++) {
- if(a[j] > a[j+1]){
- temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-
- }
-} //end
diff --git a/codes/18379057.java b/codes/18379057.java
deleted file mode 100644
index c1922950..00000000
--- a/codes/18379057.java
+++ /dev/null
@@ -1,12 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; ++j) {
- if(a[j] > a[j + 1]) {
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-}
diff --git a/codes/9622480.java b/codes/9622480.java
deleted file mode 100644
index 02b68330..00000000
--- a/codes/9622480.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过重复地遍历待排序数组，比较并交换相邻元素，使无序数组变得有序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j < n - 1 - i; j++) {
- // 如果当前元素大于下一个元素，则交换它们
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/9785926.java b/codes/9785926.java
deleted file mode 100644
index 10dbc652..00000000
--- a/codes/9785926.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-} //end
diff --git a/codes/A13230295092/15791717.java b/codes/A13230295092/15791717.java
deleted file mode 100644
index 187e282d..00000000
--- a/codes/A13230295092/15791717.java
+++ /dev/null
@@ -1,26 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组a进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- // 设置一个标志位，用于判断本轮是否发生了交换
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 发生了交换，设置标志位为true
- swapped = true;
- }
- }
- // 如果本轮没有发生交换，说明数组已经有序，可以提前结束排序
- if (!swapped) {
- break;
- }
- }
-} // end
diff --git a/codes/A13753608906/15847648.java b/codes/A13753608906/15847648.java
deleted file mode 100644
index 809e6c45..00000000
--- a/codes/A13753608906/15847648.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素两两比较和交换，使得每一轮循环后最大（或最小）的元素“冒泡”到数组的末尾。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮比较的次数
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- // 交换 a[j] 和 a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/A13753635706/15847469.java b/codes/A13753635706/15847469.java
deleted file mode 100644
index 809e6c45..00000000
--- a/codes/A13753635706/15847469.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素两两比较和交换，使得每一轮循环后最大（或最小）的元素“冒泡”到数组的末尾。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮比较的次数
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- // 交换 a[j] 和 a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/A15579521660/15861437.java b/codes/A15579521660/15861437.java
deleted file mode 100644
index 54c5f386..00000000
--- a/codes/A15579521660/15861437.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
\ No newline at end of file
diff --git a/codes/A15579541660/15861674.java b/codes/A15579541660/15861674.java
deleted file mode 100644
index 54c5f386..00000000
--- a/codes/A15579541660/15861674.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
\ No newline at end of file
diff --git a/codes/A15898703309/15820507.java b/codes/A15898703309/15820507.java
deleted file mode 100644
index 33be1b95..00000000
--- a/codes/A15898703309/15820507.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
-* 冒泡排序函数
-* aa bb cc
-* @param a 待排序的数组
-* @param n 待排序的数组长度
-*/
-public static void bubbleSort(int [] a, int n){
-// 你的代码，使无序数组 a 变得有序
-for (int i = 0; i < n - 1; i++) {
-for (int j = 0; j < n - i - 1; j++) {
-if (a[j] > a[j + 1]) {
-// 交换元素
-int temp = a[j];
-a[j] = a[j + 1];
-a[j + 1] = temp;
-}
-}
-}
-} //end
diff --git a/codes/A1607142431/10995009.java b/codes/A1607142431/10995009.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/A1607142431/10995009.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/A16691797881/15854214.java b/codes/A16691797881/15854214.java
deleted file mode 100644
index db00df43..00000000
--- a/codes/A16691797881/15854214.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组进行冒泡排序，使得数组中的元素按从小到大的顺序排列
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 外层循环控制排序趟数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环负责进行每趟排序，通过相邻元素的比较和交换来移动较大元素到数组的末尾
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
- // 经过 n-1 趟排序后，数组已经变为有序
-} // end
diff --git a/codes/A17355931314/15646257.java b/codes/A17355931314/15646257.java
deleted file mode 100644
index 20575dc4..00000000
--- a/codes/A17355931314/15646257.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/A17730000544/15630407.java b/codes/A17730000544/15630407.java
deleted file mode 100644
index 20575dc4..00000000
--- a/codes/A17730000544/15630407.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/A17864114150/15832573.java b/codes/A17864114150/15832573.java
deleted file mode 100644
index 33be1b95..00000000
--- a/codes/A17864114150/15832573.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
-* 冒泡排序函数
-* aa bb cc
-* @param a 待排序的数组
-* @param n 待排序的数组长度
-*/
-public static void bubbleSort(int [] a, int n){
-// 你的代码，使无序数组 a 变得有序
-for (int i = 0; i < n - 1; i++) {
-for (int j = 0; j < n - i - 1; j++) {
-if (a[j] > a[j + 1]) {
-// 交换元素
-int temp = a[j];
-a[j] = a[j + 1];
-a[j + 1] = temp;
-}
-}
-}
-} //end
diff --git a/codes/A17864115054/15528622.java b/codes/A17864115054/15528622.java
deleted file mode 100644
index 20575dc4..00000000
--- a/codes/A17864115054/15528622.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/A18172972897/15861687.java b/codes/A18172972897/15861687.java
deleted file mode 100644
index 54c5f386..00000000
--- a/codes/A18172972897/15861687.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
\ No newline at end of file
diff --git a/codes/A18839698468/15830742.java b/codes/A18839698468/15830742.java
deleted file mode 100644
index d612a9d6..00000000
--- a/codes/A18839698468/15830742.java
+++ /dev/null
@@ -1,27 +0,0 @@
-/**
- * 冒泡排序函数
- * 将无序数组通过冒泡排序算法变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- // 设置一个标志位，用于优化算法，减少不必要的比较
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素比后一个元素大，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 如果有元素交换，则标志位设为true
- swapped = true;
- }
- }
- // 如果没有元素交换，说明数组已经有序，可以提前结束排序
- if (!swapped) {
- break;
- }
- }
-} //end
-
diff --git a/codes/A19114652439/15836795.java b/codes/A19114652439/15836795.java
deleted file mode 100644
index d0e7038d..00000000
--- a/codes/A19114652439/15836795.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。
- * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的次数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一轮比较的次数
- // 如果前一个元素比后一个元素大，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/A19127470761/15834094.java b/codes/A19127470761/15834094.java
deleted file mode 100644
index db00df43..00000000
--- a/codes/A19127470761/15834094.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组进行冒泡排序，使得数组中的元素按从小到大的顺序排列
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 外层循环控制排序趟数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环负责进行每趟排序，通过相邻元素的比较和交换来移动较大元素到数组的末尾
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
- // 经过 n-1 趟排序后，数组已经变为有序
-} // end
diff --git a/codes/A19356583352/15628459.java b/codes/A19356583352/15628459.java
deleted file mode 100644
index 20575dc4..00000000
--- a/codes/A19356583352/15628459.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/A19897301746/15836849.java b/codes/A19897301746/15836849.java
deleted file mode 100644
index d0e7038d..00000000
--- a/codes/A19897301746/15836849.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。
- * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的次数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一轮比较的次数
- // 如果前一个元素比后一个元素大，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/A2606488516/15814309.java b/codes/A2606488516/15814309.java
deleted file mode 100644
index 1d4a099c..00000000
--- a/codes/A2606488516/15814309.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 将无序数组 a 进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环负责每趟的比较和交换
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/A7777777/11213040.java b/codes/A7777777/11213040.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/A7777777/11213040.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/A853047901/.java b/codes/A853047901/.java
deleted file mode 100644
index 0d5a14b0..00000000
--- a/codes/A853047901/.java
+++ /dev/null
@@ -1,64 +0,0 @@
-ad
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
diff --git a/codes/A853047901/10845109.java b/codes/A853047901/10845109.java
deleted file mode 100644
index ab3d8f39..00000000
--- a/codes/A853047901/10845109.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/A8888888/11187517.java b/codes/A8888888/11187517.java
deleted file mode 100644
index 9c9fea7e..00000000
--- a/codes/A8888888/11187517.java
+++ /dev/null
@@ -1,18 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- } //end
diff --git a/codes/AA15930757026/15765678.java b/codes/AA15930757026/15765678.java
deleted file mode 100644
index 20575dc4..00000000
--- a/codes/AA15930757026/15765678.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/ABOD01/11326499.java b/codes/ABOD01/11326499.java
deleted file mode 100644
index 8d589d7e..00000000
--- a/codes/ABOD01/11326499.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a,int n){
- int temp =0;
- for(int i = 0;ia[j+1]){
- temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-
-
-}
\ No newline at end of file
diff --git a/codes/ARSHAM/11202647.java b/codes/ARSHAM/11202647.java
deleted file mode 100644
index 272a12fc..00000000
--- a/codes/ARSHAM/11202647.java
+++ /dev/null
@@ -1,18 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- } //end
\ No newline at end of file
diff --git a/codes/ASD8899/.keep b/codes/ASD8899/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/ASD8899/15742420.java b/codes/ASD8899/15742420.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/ASD8899/15742420.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/ASR1523580/15669420.java b/codes/ASR1523580/15669420.java
deleted file mode 100644
index 02a20ce5..00000000
--- a/codes/ASR1523580/15669420.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素两两比较和交换，将较大的元素逐步“浮”到数组的末尾，实现排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制需要比较的轮数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮比较的次数
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/Aa12345678/.keep b/codes/Aa12345678/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Aa12345678/10043731.java b/codes/Aa12345678/10043731.java
deleted file mode 100644
index 667eee0f..00000000
--- a/codes/Aa12345678/10043731.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/Airbnb/11260348.java b/codes/Airbnb/11260348.java
deleted file mode 100644
index 4d7083fe..00000000
--- a/codes/Airbnb/11260348.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int i, j;
-
- for(i=0; ia[j]){
- int temp;
- temp = a[j-1];
- a[j-1] = a[j];
- a[j] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/Allen123/18357308.java b/codes/Allen123/18357308.java
deleted file mode 100644
index ce0e06ef..00000000
--- a/codes/Allen123/18357308.java
+++ /dev/null
@@ -1,19 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < a.length - 1; i++) {
- for (int j = 0; j < a.length - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- a[j] ^= a[j + 1];
- a[j + 1] ^= a[j];
- a[j] ^= a[j + 1];
- }
- }
- }
-
- } //end
diff --git a/codes/Amyaaa/15624605.java b/codes/Amyaaa/15624605.java
deleted file mode 100644
index ad8ad09a..00000000
--- a/codes/Amyaaa/15624605.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素之间的比较和交换，使得每一轮比较后最大（或最小）的元素能够"冒泡"到数组的末尾。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每一趟排序多少次
- if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们的位置
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/Anheqiao/15630084.java b/codes/Anheqiao/15630084.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/Anheqiao/15630084.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/Anheqiao0512/15535529.java b/codes/Anheqiao0512/15535529.java
deleted file mode 100644
index 854beb62..00000000
--- a/codes/Anheqiao0512/15535529.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
-
diff --git a/codes/AnolisOpen/9754131.java b/codes/AnolisOpen/9754131.java
deleted file mode 100644
index 90103364..00000000
--- a/codes/AnolisOpen/9754131.java
+++ /dev/null
@@ -1,20 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- } //end
-
-
diff --git a/codes/AnshunEduc/.keep b/codes/AnshunEduc/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/AnshunEduc/15815295.java b/codes/AnshunEduc/15815295.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/AnshunEduc/15815295.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/AuuuAa/11292635.java b/codes/AuuuAa/11292635.java
deleted file mode 100644
index 4d7083fe..00000000
--- a/codes/AuuuAa/11292635.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int i, j;
-
- for(i=0; ia[j]){
- int temp;
- temp = a[j-1];
- a[j-1] = a[j];
- a[j] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/Ayj200417/15815229.java b/codes/Ayj200417/15815229.java
deleted file mode 100644
index 5335cfe3..00000000
--- a/codes/Ayj200417/15815229.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int t;
- for (int i = 0; i < n; i++){
- for (int j = i+1;j < n;j++){
- if(a[i] > a[j]){
- t=a[i];
- a[i]=a[j];
- a[j]=t;
- }
- }
- }
-
-} //end
diff --git a/codes/Ayuanlou/15592112.java b/codes/Ayuanlou/15592112.java
deleted file mode 100644
index ae82e695..00000000
--- a/codes/Ayuanlou/15592112.java
+++ /dev/null
@@ -1,35 +0,0 @@
-/**
-
- * 冒泡排序函数
-
- * aa bb cc
-
- * @param a 待排序的数组
-
- * @param n 待排序的数组长度
-
- */
-
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0; i < n-1 ; i++){
-
- for (int j = 0;j < n-1-i;j++){
-
- if(a[j] > a[j+1]){
-
- int temp = a[j];
-
- a[j] = a[j+1];
-
- a[j+1] = temp;
-
- }
-
- }
-
- }
-
-
-
-} //end
diff --git a/codes/BHUIJ217892/11003994.java b/codes/BHUIJ217892/11003994.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/BHUIJ217892/11003994.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/BMWAimee/15775743.java b/codes/BMWAimee/15775743.java
deleted file mode 100644
index e7912b20..00000000
--- a/codes/BMWAimee/15775743.java
+++ /dev/null
@@ -1,20 +0,0 @@
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- // 标记是否发生交换，用于优化，如果这一趟没有发生交换，说明已经有序
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 标记发生了交换
- swapped = true;
- }
- }
- // 如果这一趟没有发生交换，说明数组已经有序，提前结束排序
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/BY2487564355/15781003.java b/codes/BY2487564355/15781003.java
deleted file mode 100644
index f9b707d8..00000000
--- a/codes/BY2487564355/15781003.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过重复遍历待排序的数组，比较相邻的元素，如果它们的顺序错误就把它们交换过来。
- * 遍历数组的工作是重复地进行直到没有再需要交换，也就是说该数组已经排序完成。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/Beca0101/11118448.java b/codes/Beca0101/11118448.java
deleted file mode 100644
index 029e9d84..00000000
--- a/codes/Beca0101/11118448.java
+++ /dev/null
@@ -1,28 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
-*/
-public static void bubbleSort(int [] a, int n){
- int j , k;
- int flag = n ;//flag来记录最后交换的位置，也就是排序的尾边界
-
- while (flag > 0){//排序未结束标志
- k = flag; //k 来记录遍历的尾边界
- flag = 0;
-
- for(j=1; j a[j]){//前面的数字大于后面的数字就交换
- //交换a[j-1]和a[j]
- int temp;
- temp = a[j-1];
- a[j-1] = a[j];
- a[j]=temp;
-
- //表示交换过数据;
- flag = j;//记录最新的尾边界.
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/BitBlitz/.keep b/codes/BitBlitz/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/BitBlitz/15775656.java b/codes/BitBlitz/15775656.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/BitBlitz/15775656.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/Blue_Snow/15778600.java b/codes/Blue_Snow/15778600.java
deleted file mode 100644
index 2be998a0..00000000
--- a/codes/Blue_Snow/15778600.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素两两比较并交换位置，使得每一轮循环后最大（或最小）的元素能够“冒泡”到数组的末尾
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序的轮数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮需要比较的次数
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/BrokenDreams/11287383.java b/codes/BrokenDreams/11287383.java
deleted file mode 100644
index 4d7083fe..00000000
--- a/codes/BrokenDreams/11287383.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int i, j;
-
- for(i=0; ia[j]){
- int temp;
- temp = a[j-1];
- a[j-1] = a[j];
- a[j] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/C15703010346/15826230.java b/codes/C15703010346/15826230.java
deleted file mode 100644
index 24f513b3..00000000
--- a/codes/C15703010346/15826230.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/CC422AAACC/.keep b/codes/CC422AAACC/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/CC422AAACC/15742406.java b/codes/CC422AAACC/15742406.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/CC422AAACC/15742406.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/CKXGZXA/14237106.java b/codes/CKXGZXA/14237106.java
deleted file mode 100644
index 60c32309..00000000
--- a/codes/CKXGZXA/14237106.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- // 如果相邻元素逆序，则交换它们
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
diff --git a/codes/CMOSInverter/.keep b/codes/CMOSInverter/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/CMOSInverter/15780363.java b/codes/CMOSInverter/15780363.java
deleted file mode 100644
index 3e6ece81..00000000
--- a/codes/CMOSInverter/15780363.java
+++ /dev/null
@@ -1,27 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- if (n <= 1) return; // 如果数组长度小于等于1，不需要排序
-
- boolean swapped;
- for (int i = 0; i < n - 1; i++) {
- swapped = false;
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换a[j]和a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- swapped = true;
- }
- }
- // 如果这一轮没有发生交换，说明数组已经有序，退出排序
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/CS_Joer/11449450.java b/codes/CS_Joer/11449450.java
deleted file mode 100644
index cacd12f1..00000000
--- a/codes/CS_Joer/11449450.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- a[j] = a[j]+a[j+1];
- a[j+1] = a[j]-a[j+1];
- a[j] = a[j]-a[j+1];
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/CY3761/15780413.java b/codes/CY3761/15780413.java
deleted file mode 100644
index 14e46fcf..00000000
--- a/codes/CY3761/15780413.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- *
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j < n - 1 - i; j++) {
- if(a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/Calli990/11027717.java b/codes/Calli990/11027717.java
deleted file mode 100644
index a833d8d3..00000000
--- a/codes/Calli990/11027717.java
+++ /dev/null
@@ -1,24 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int j=0;ja[i+1])
- {
- temp=a[i];
- a[i]=a[i+1];
- a[i+1]=temp;
- }
- }
- }
- //System.out.println(a);
-
-} //end
\ No newline at end of file
diff --git a/codes/CangBOP/11303209.java b/codes/CangBOP/11303209.java
deleted file mode 100644
index 24b49b4b..00000000
--- a/codes/CangBOP/11303209.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/Cannon/11268645.java b/codes/Cannon/11268645.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/Cannon/11268645.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/Captaincc/.keep b/codes/Captaincc/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Captaincc/15781895.java b/codes/Captaincc/15781895.java
deleted file mode 100644
index 9f86eb58..00000000
--- a/codes/Captaincc/15781895.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- a[j] = a[j]+a[j+1];
- a[j+1] = a[j]-a[j+1];
- a[j] = a[j]-a[j+1];
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/Case19523171659/.keep b/codes/Case19523171659/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Case19523171659/10972507.java b/codes/Case19523171659/10972507.java
deleted file mode 100644
index 9eccfac5..00000000
--- a/codes/Case19523171659/10972507.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/Chailly/15776240.java b/codes/Chailly/15776240.java
deleted file mode 100644
index 659e1697..00000000
--- a/codes/Chailly/15776240.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 功能：将无序数组通过冒泡排序算法变得有序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++){
- for(int j = 0; j < n - 1 - i; j++){
- if(a[j] > a[j + 1]){
- // 如果前一个元素大于后一个元素，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/Charles953/11342263.java b/codes/Charles953/11342263.java
deleted file mode 100644
index b9bf7818..00000000
--- a/codes/Charles953/11342263.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/Chat-4/11187682.java b/codes/Chat-4/11187682.java
deleted file mode 100644
index 8c505501..00000000
--- a/codes/Chat-4/11187682.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;i a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/CheeseMen/11466037.java b/codes/CheeseMen/11466037.java
deleted file mode 100644
index 9e7534d4..00000000
--- a/codes/CheeseMen/11466037.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡 排序 函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-}//end
\ No newline at end of file
diff --git a/codes/ChengRunji/15532439.java b/codes/ChengRunji/15532439.java
deleted file mode 100644
index 2252b818..00000000
--- a/codes/ChengRunji/15532439.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/Chengxiaoyu/15650592.java b/codes/Chengxiaoyu/15650592.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/Chengxiaoyu/15650592.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/Chesed/18676140.java b/codes/Chesed/18676140.java
deleted file mode 100644
index bb4a2383..00000000
--- a/codes/Chesed/18676140.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * ð
- * aa bb cc
- * @param a
- * @param n 鳤
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/Christopher/15635786.java b/codes/Christopher/15635786.java
deleted file mode 100644
index 9c9fea7e..00000000
--- a/codes/Christopher/15635786.java
+++ /dev/null
@@ -1,18 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- } //end
diff --git a/codes/Chuck395/11358350.java b/codes/Chuck395/11358350.java
deleted file mode 100644
index b9bf7818..00000000
--- a/codes/Chuck395/11358350.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/Chy3095852337/18699632.java b/codes/Chy3095852337/18699632.java
deleted file mode 100644
index 09874a86..00000000
--- a/codes/Chy3095852337/18699632.java
+++ /dev/null
@@ -1,31 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 外层循环控制排序的总轮数，轮数等于数组长度减一
- for (int i = 0; i < n - 1; i++) {
- // 初始化一个标志位，用于判断当前轮是否发生了交换
- boolean swapped = false;
-
- // 内层循环控制每一轮的比较次数，每次比较相邻的两个元素
- for (int j = 0; j < n - i - 1; j++) {
- // 如果当前元素大于下一个元素，交换它们
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
-
- // 设置标志位为 true
- swapped = true;
- }
- }
-
- if (!swapped) {
- break;
- }
- }
-}
diff --git a/codes/CloudyLemonade/15780990.java b/codes/CloudyLemonade/15780990.java
deleted file mode 100644
index d6a8d70a..00000000
--- a/codes/CloudyLemonade/15780990.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 遍历数组，比较相邻元素，如果顺序错误则交换它们，重复这个过程直到没有需要交换的元素为止。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 如果前一个元素大于后一个元素，则交换它们
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/Cobytebyte/.keep b/codes/Cobytebyte/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Cobytebyte/15779518.java b/codes/Cobytebyte/15779518.java
deleted file mode 100644
index 83497d9a..00000000
--- a/codes/Cobytebyte/15779518.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡 排序 函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-}//end
\ No newline at end of file
diff --git a/codes/Coder_Kang/.keep b/codes/Coder_Kang/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Coder_Kang/15777819.java b/codes/Coder_Kang/15777819.java
deleted file mode 100644
index 343fcd48..00000000
--- a/codes/Coder_Kang/15777819.java
+++ /dev/null
@@ -1,18 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- } //end
\ No newline at end of file
diff --git a/codes/Colazxk/9952351.java b/codes/Colazxk/9952351.java
deleted file mode 100644
index 53759c2f..00000000
--- a/codes/Colazxk/9952351.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- int t=a[j];
- a[j]=a[j+1];
- a[j+1]=t;
- }
- }
- }
-
-} //end
diff --git a/codes/CuiChenyuan/15758456.java b/codes/CuiChenyuan/15758456.java
deleted file mode 100644
index 2252b818..00000000
--- a/codes/CuiChenyuan/15758456.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/D15059170203/.keep b/codes/D15059170203/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/D15059170203/10976249.java b/codes/D15059170203/10976249.java
deleted file mode 100644
index 9eccfac5..00000000
--- a/codes/D15059170203/10976249.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/DENGXC/10553088.java b/codes/DENGXC/10553088.java
deleted file mode 100644
index 7db1ed71..00000000
--- a/codes/DENGXC/10553088.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int []arr, int n) {
- for(int i=0; i < n-1; i++) {
- for(int j=0; j < n-i-1; j++) {
- if(arr[j]>arr[j+1]) {
- int temp = arr[j+1];
- arr[j+1] = arr[j];
- arr[j] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/DFSVVV/16465950.java b/codes/DFSVVV/16465950.java
deleted file mode 100644
index f7a73b33..00000000
--- a/codes/DFSVVV/16465950.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0;i < n-1 ; i++){
- for(int j = 1;j < n -i ;j++){
- if(a[j-1] > a[j]){
- int temp = a[j -1];
- a[j-1] = a[j];
- a[j] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/DH13480641255/15621028.java b/codes/DH13480641255/15621028.java
deleted file mode 100644
index 38ba933c..00000000
--- a/codes/DH13480641255/15621028.java
+++ /dev/null
@@ -1,20 +0,0 @@
-
-/**
- * 冒泡排序函数
- * 实现数组的冒泡排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1] 的值
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
-
diff --git a/codes/Daenery/.keep b/codes/Daenery/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Daenery/15780888.java b/codes/Daenery/15780888.java
deleted file mode 100644
index 9f86eb58..00000000
--- a/codes/Daenery/15780888.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- a[j] = a[j]+a[j+1];
- a[j+1] = a[j]-a[j+1];
- a[j] = a[j]-a[j+1];
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/DaybyDay/11117022.java b/codes/DaybyDay/11117022.java
deleted file mode 100644
index b9bf7818..00000000
--- a/codes/DaybyDay/11117022.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/DeepThinking/11452012.java b/codes/DeepThinking/11452012.java
deleted file mode 100644
index cacd12f1..00000000
--- a/codes/DeepThinking/11452012.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- a[j] = a[j]+a[j+1];
- a[j+1] = a[j]-a[j+1];
- a[j] = a[j]-a[j+1];
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/Dgwoisdg/11001326.java b/codes/Dgwoisdg/11001326.java
deleted file mode 100644
index 1c888994..00000000
--- a/codes/Dgwoisdg/11001326.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/Dobyhe4rts/.keep b/codes/Dobyhe4rts/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Dobyhe4rts/15844721.java b/codes/Dobyhe4rts/15844721.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/Dobyhe4rts/15844721.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/DongGuoPy/.keep b/codes/DongGuoPy/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/DongGuoPy/15844969.java b/codes/DongGuoPy/15844969.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/DongGuoPy/15844969.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/Dream1tposs/.keep b/codes/Dream1tposs/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Dream1tposs/15843789.java b/codes/Dream1tposs/15843789.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/Dream1tposs/15843789.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/Dream_37/15775021.java b/codes/Dream_37/15775021.java
deleted file mode 100644
index 2ec05a46..00000000
--- a/codes/Dream_37/15775021.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过不断比较相邻的元素，如果顺序错误则交换它们的位置，直到没有元素需要交换，排序完成。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 遍历整个数组
- for (int i = 0; i < n - 1; i++) {
- // Last i elements are already in place
- for (int j = 0; j < n - i - 1; j++) {
- // 遍历数组从 0 到 n-i-1，交换如果元素找到比下一个元素大
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/Dreamachine/15834244.java b/codes/Dreamachine/15834244.java
deleted file mode 100644
index 35961189..00000000
--- a/codes/Dreamachine/15834244.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组a进行冒泡排序，将其变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序趟数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环，进行相邻元素比较和交换
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们
- // 交换a[j]和a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/Dreamlover/11202583.java b/codes/Dreamlover/11202583.java
deleted file mode 100644
index 272a12fc..00000000
--- a/codes/Dreamlover/11202583.java
+++ /dev/null
@@ -1,18 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- } //end
\ No newline at end of file
diff --git a/codes/Duvet123/11306690.java b/codes/Duvet123/11306690.java
deleted file mode 100644
index 8d589d7e..00000000
--- a/codes/Duvet123/11306690.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a,int n){
- int temp =0;
- for(int i = 0;ia[j+1]){
- temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-
-
-}
\ No newline at end of file
diff --git a/codes/DuxiaoJava/.keep b/codes/DuxiaoJava/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/DuxiaoJava/15841250.java b/codes/DuxiaoJava/15841250.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/DuxiaoJava/15841250.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/EthanLeo/10155282.java b/codes/EthanLeo/10155282.java
deleted file mode 100644
index f9200439..00000000
--- a/codes/EthanLeo/10155282.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
diff --git a/codes/Evening/15453362.java b/codes/Evening/15453362.java
deleted file mode 100644
index 74d00cd5..00000000
--- a/codes/Evening/15453362.java
+++ /dev/null
@@ -1,25 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- boolean flag = false;
-
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- flag = true;
- }
- }
-
- if (!flag) {
- break;
- }
- }
-} //end
diff --git a/codes/F5Lauchers/.keep b/codes/F5Lauchers/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/F5Lauchers/15845684.java b/codes/F5Lauchers/15845684.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/F5Lauchers/15845684.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/FEEEDED/15775783.java b/codes/FEEEDED/15775783.java
deleted file mode 100644
index 14e46fcf..00000000
--- a/codes/FEEEDED/15775783.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- *
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j < n - 1 - i; j++) {
- if(a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/FE_winter/.keep b/codes/FE_winter/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/FE_winter/15781031.java b/codes/FE_winter/15781031.java
deleted file mode 100644
index 481ec544..00000000
--- a/codes/FE_winter/15781031.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/FNCdoinb/.keep b/codes/FNCdoinb/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/FNCdoinb/15845153.java b/codes/FNCdoinb/15845153.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/FNCdoinb/15845153.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/FOYEGE/11326121.java b/codes/FOYEGE/11326121.java
deleted file mode 100644
index 9e7534d4..00000000
--- a/codes/FOYEGE/11326121.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡 排序 函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-}//end
\ No newline at end of file
diff --git a/codes/Falcon/17001758.java b/codes/Falcon/17001758.java
deleted file mode 100644
index 731902b0..00000000
--- a/codes/Falcon/17001758.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 外层循环控制排序轮数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环进行相邻元素的比较和交换
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换a[j]和a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/Faweiya/11259965.java b/codes/Faweiya/11259965.java
deleted file mode 100644
index 24b49b4b..00000000
--- a/codes/Faweiya/11259965.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/FbxgIt/11302915.java b/codes/FbxgIt/11302915.java
deleted file mode 100644
index 4d7083fe..00000000
--- a/codes/FbxgIt/11302915.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int i, j;
-
- for(i=0; ia[j]){
- int temp;
- temp = a[j-1];
- a[j-1] = a[j];
- a[j] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/FiberMoney/.keep b/codes/FiberMoney/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/FiberMoney/15842105.java b/codes/FiberMoney/15842105.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/FiberMoney/15842105.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/Fickler/15510871.java b/codes/Fickler/15510871.java
deleted file mode 100644
index 09064e0d..00000000
--- a/codes/Fickler/15510871.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素两两比较和交换，将最大（或最小）的元素冒泡到数组末尾。
- * 重复执行，直到整个数组有序。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一趟排序多少次
- if (a[j] > a[j + 1]) { // 相邻元素两两比较，如果前一个元素比后一个元素大则交换它们
- // 交换 a[j] 和 a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end bubbleSort
diff --git a/codes/Firethrows/.keep b/codes/Firethrows/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Firethrows/15845639.java b/codes/Firethrows/15845639.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/Firethrows/15845639.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/Fitz_dev/9948244.java b/codes/Fitz_dev/9948244.java
deleted file mode 100644
index 191de91d..00000000
--- a/codes/Fitz_dev/9948244.java
+++ /dev/null
@@ -1,11 +0,0 @@
- public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < a.length - 1; i++) {
- for (int j = 0; j < a.length - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j + 1];
- a[j + 1] = a[j];
- a[j] = temp;
- }
- }
- }
- }
\ No newline at end of file
diff --git a/codes/Fog16623132936/.keep b/codes/Fog16623132936/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Fog16623132936/10972627.java b/codes/Fog16623132936/10972627.java
deleted file mode 100644
index 9eccfac5..00000000
--- a/codes/Fog16623132936/10972627.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/Freewarnings/.keep b/codes/Freewarnings/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Freewarnings/15841566.java b/codes/Freewarnings/15841566.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/Freewarnings/15841566.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/Fulovecode/.keep b/codes/Fulovecode/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Fulovecode/15843647.java b/codes/Fulovecode/15843647.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/Fulovecode/15843647.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/Fuysus/15342593.java b/codes/Fuysus/15342593.java
deleted file mode 100644
index 42efb78b..00000000
--- a/codes/Fuysus/15342593.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n)
-{
- for(int i = 0; i < n - 1; ++i)
- {
- for(int j = 0; j < n - i - 1; ++j)
- {
- if(a[j] > a[j+1])
- {
- a[j] = a[j] ^ a[j+1];
- a[j+1] = a[j] ^ a[j+1];
- a[j] = a[j]^ a[j+1];
- }
- }
- }
-}
diff --git a/codes/G3264043229/15813840.java b/codes/G3264043229/15813840.java
deleted file mode 100644
index 1d4a099c..00000000
--- a/codes/G3264043229/15813840.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 将无序数组 a 进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环负责每趟的比较和交换
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/G4me4399/.keep b/codes/G4me4399/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/G4me4399/15843085.java b/codes/G4me4399/15843085.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/G4me4399/15843085.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/GIN0001/15777016.java b/codes/GIN0001/15777016.java
deleted file mode 100644
index dd8f3220..00000000
--- a/codes/GIN0001/15777016.java
+++ /dev/null
@@ -1,26 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素两两比较并交换，使得每一轮循环后最大（或最小）的元素被放到正确的位置
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的轮数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮比较的次数
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
-
-
-
-
-
-
-
-
-
diff --git a/codes/GUIDM1966/15524857.java b/codes/GUIDM1966/15524857.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/GUIDM1966/15524857.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/GZofGO/.keep b/codes/GZofGO/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/GZofGO/15846696.java b/codes/GZofGO/15846696.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/GZofGO/15846696.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/Gesture/11255850.java b/codes/Gesture/11255850.java
deleted file mode 100644
index 4d7083fe..00000000
--- a/codes/Gesture/11255850.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int i, j;
-
- for(i=0; ia[j]){
- int temp;
- temp = a[j-1];
- a[j-1] = a[j];
- a[j] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/Ghib66/15510318.java b/codes/Ghib66/15510318.java
deleted file mode 100644
index a347a636..00000000
--- a/codes/Ghib66/15510318.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- // 内层循环控制每一趟排序多少次
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换两个元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/GiteeWy1/.keep b/codes/GiteeWy1/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/GiteeWy1/15843556.java b/codes/GiteeWy1/15843556.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/GiteeWy1/15843556.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/GoStraightOn/14341961.java b/codes/GoStraightOn/14341961.java
deleted file mode 100644
index 6115f0ce..00000000
--- a/codes/GoStraightOn/14341961.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n - 1; ++i) {
- for(int j = 0; j < n - i - 1; ++j){
- if(a[j] > a[j+1]){
- int k = a[j];
- a[j] = a[j+1];
- a[j+1] = k;
- }
- }
- }
-} //end
diff --git a/codes/Golangu4ge/.keep b/codes/Golangu4ge/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Golangu4ge/15844492.java b/codes/Golangu4ge/15844492.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/Golangu4ge/15844492.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/Greeter/11262621.java b/codes/Greeter/11262621.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/Greeter/11262621.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/Guna777/15714682.java b/codes/Guna777/15714682.java
deleted file mode 100644
index 7ba11c49..00000000
--- a/codes/Guna777/15714682.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素两两比较和交换，将较大的元素逐渐“浮”到数组的末尾，从而完成排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 外层循环，表示所有未排序部分的趟数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环，负责将当前未排序部分的最大值“浮”到末尾
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果前一个元素比后一个元素大，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
- // 当外层循环和内层循环都执行完毕后，数组a已变为有序
-} //end
diff --git a/codes/H17630975837/15780333.java b/codes/H17630975837/15780333.java
deleted file mode 100644
index 9e3572b1..00000000
--- a/codes/H17630975837/15780333.java
+++ /dev/null
@@ -1,26 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素之间的比较和交换，将最大的元素“冒泡”到数组的末尾
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- // 标志位，表示这一趟排序是否有数据交换
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果当前元素大于下一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 发生了交换，将标志位设为true
- swapped = true;
- }
- }
- // 如果这一趟没有发生交换，说明数组已经有序，可以提前结束排序
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/H17695838659/15775857.java b/codes/H17695838659/15775857.java
deleted file mode 100644
index 949cc5cb..00000000
--- a/codes/H17695838659/15775857.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 使用冒泡排序算法对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/HCTema/.keep b/codes/HCTema/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/HCTema/15846117.java b/codes/HCTema/15846117.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/HCTema/15846117.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/HMqusi/11299684.java b/codes/HMqusi/11299684.java
deleted file mode 100644
index 1c888994..00000000
--- a/codes/HMqusi/11299684.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/HUmui0101/11027238.java b/codes/HUmui0101/11027238.java
deleted file mode 100644
index 8c505501..00000000
--- a/codes/HUmui0101/11027238.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;i a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/Haichan/15780779.java b/codes/Haichan/15780779.java
deleted file mode 100644
index 8b62be3e..00000000
--- a/codes/Haichan/15780779.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 将数组 a 中的元素按照升序排列
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/HandsomeSean/11463861.java b/codes/HandsomeSean/11463861.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/HandsomeSean/11463861.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/HappyJess/16199150.java b/codes/HappyJess/16199150.java
deleted file mode 100644
index 0374d9db..00000000
--- a/codes/HappyJess/16199150.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-}
diff --git a/codes/HappyJess/16200488.java b/codes/HappyJess/16200488.java
deleted file mode 100644
index f5b52e93..00000000
--- a/codes/HappyJess/16200488.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
-
diff --git a/codes/HappyJess/16200532.java b/codes/HappyJess/16200532.java
deleted file mode 100644
index f5b52e93..00000000
--- a/codes/HappyJess/16200532.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
-
diff --git a/codes/HeRuo123/15520250.java b/codes/HeRuo123/15520250.java
deleted file mode 100644
index 1f0c75d3..00000000
--- a/codes/HeRuo123/15520250.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- *
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 外层循环控制排序的轮数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环控制每一轮排序中相邻元素的比较和交换
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
-
diff --git a/codes/HelloWorld1/11257582.java b/codes/HelloWorld1/11257582.java
deleted file mode 100644
index 272a12fc..00000000
--- a/codes/HelloWorld1/11257582.java
+++ /dev/null
@@ -1,18 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- } //end
\ No newline at end of file
diff --git a/codes/Henriette/11038762.java b/codes/Henriette/11038762.java
deleted file mode 100644
index efb824a4..00000000
--- a/codes/Henriette/11038762.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i=0;ia[j+1]) {
- tmp = a[j+1];
- a[j+1] = a[j];
- a[j] = tmp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/Hksr223/15534956.java b/codes/Hksr223/15534956.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/Hksr223/15534956.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/HotSpringEye/11446072.java b/codes/HotSpringEye/11446072.java
deleted file mode 100644
index 17fde96e..00000000
--- a/codes/HotSpringEye/11446072.java
+++ /dev/null
@@ -1,19 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n-1; j++) {
- if(a[j] > a[j+1]){
- int tmp = 0;
- tmp = a[j];
- a[j] = a[j+1];
- a[j+1] = tmp;
- }
- }
- }
-} //end
diff --git a/codes/HsuehBo/18504702.java b/codes/HsuehBo/18504702.java
deleted file mode 100644
index db7e56d7..00000000
--- a/codes/HsuehBo/18504702.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int tmp = 0;
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-} //end
-
diff --git a/codes/HunterHans/12287484.java b/codes/HunterHans/12287484.java
deleted file mode 100644
index ab3d8f39..00000000
--- a/codes/HunterHans/12287484.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/Hybridsky/.keep b/codes/Hybridsky/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Hybridsky/15775385.java b/codes/Hybridsky/15775385.java
deleted file mode 100644
index 1c888994..00000000
--- a/codes/Hybridsky/15775385.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/IM12138/11469383.java b/codes/IM12138/11469383.java
deleted file mode 100644
index 8c505501..00000000
--- a/codes/IM12138/11469383.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;i a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/IXHE2004/15639769.java b/codes/IXHE2004/15639769.java
deleted file mode 100644
index 92fad277..00000000
--- a/codes/IXHE2004/15639769.java
+++ /dev/null
@@ -1,25 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n - 1; i++){
- boolean swapped = false;
- for(int j = 0; j < n - i - 1; j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- swapped = true;
- }
- }
- if(!swapped){
- break;
- }
- }
-
-
-} //end
diff --git a/codes/Iboydoss/11210866.java b/codes/Iboydoss/11210866.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/Iboydoss/11210866.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/IoTanw/11135258.java b/codes/IoTanw/11135258.java
deleted file mode 100644
index 9e7534d4..00000000
--- a/codes/IoTanw/11135258.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡 排序 函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-}//end
\ No newline at end of file
diff --git a/codes/JJ18809227089/15752040.java b/codes/JJ18809227089/15752040.java
deleted file mode 100644
index 818e9152..00000000
--- a/codes/JJ18809227089/15752040.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 实现冒泡排序算法对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/JackieYe/15543330.java b/codes/JackieYe/15543330.java
deleted file mode 100644
index 4cb5df82..00000000
--- a/codes/JackieYe/15543330.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果当前元素大于下一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/Jang10/15536247.java b/codes/Jang10/15536247.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/Jang10/15536247.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/January/.keep b/codes/January/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/January/11070767.java b/codes/January/11070767.java
deleted file mode 100644
index 2bc93cad..00000000
--- a/codes/January/11070767.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- *
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[]a,int n){
- for (int i = 0; i < n-1; i++) {
- for (int j = i+1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[i];
- a[i] = a[j];
- a[j] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/JasenChao/13984025.java b/codes/JasenChao/13984025.java
deleted file mode 100644
index 8b3ae085..00000000
--- a/codes/JasenChao/13984025.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int t = a[j];
- a[j] = a[j + 1];
- a[j + 1] = t;
- }
- }
- }
-} //end
diff --git a/codes/Jasonakeke/15520912.java b/codes/Jasonakeke/15520912.java
deleted file mode 100644
index 9167756b..00000000
--- a/codes/Jasonakeke/15520912.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素比较和交换，使得每一轮迭代后最大（或最小）的元素被移动到数组的末尾。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/Jgf3096619665/15774713.java b/codes/Jgf3096619665/15774713.java
deleted file mode 100644
index 1cabf6d1..00000000
--- a/codes/Jgf3096619665/15774713.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素两两比较和交换，使得每一轮循环后最大（或最小）的元素能够“冒泡”到数组的末尾
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制需要排序的趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每趟排序的过程
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/Jingyu/11302198.java b/codes/Jingyu/11302198.java
deleted file mode 100644
index cacd12f1..00000000
--- a/codes/Jingyu/11302198.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- a[j] = a[j]+a[j+1];
- a[j+1] = a[j]-a[j+1];
- a[j] = a[j]-a[j+1];
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/Jinzj_828/15842649.java b/codes/Jinzj_828/15842649.java
deleted file mode 100644
index 8e911f6b..00000000
--- a/codes/Jinzj_828/15842649.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
-
diff --git a/codes/Juliani/11207255.java b/codes/Juliani/11207255.java
deleted file mode 100644
index 272a12fc..00000000
--- a/codes/Juliani/11207255.java
+++ /dev/null
@@ -1,18 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- } //end
\ No newline at end of file
diff --git a/codes/K18475329871/15592083.java b/codes/K18475329871/15592083.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/K18475329871/15592083.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/KEQI73205/.keep b/codes/KEQI73205/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/KEQI73205/15778430.java b/codes/KEQI73205/15778430.java
deleted file mode 100644
index 83497d9a..00000000
--- a/codes/KEQI73205/15778430.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡 排序 函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-}//end
\ No newline at end of file
diff --git a/codes/Kang12138/15653043.java b/codes/Kang12138/15653043.java
deleted file mode 100644
index 45f0745a..00000000
--- a/codes/Kang12138/15653043.java
+++ /dev/null
@@ -1,23 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 外层循环，遍历所有的数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环，进行当前轮的比较和交换
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果当前数比下一个数大，交换它们
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
-
-
diff --git a/codes/Keeper/15775425.java b/codes/Keeper/15775425.java
deleted file mode 100644
index 2d3a5301..00000000
--- a/codes/Keeper/15775425.java
+++ /dev/null
@@ -1,15 +0,0 @@
-public static void bubbleSort(int[] a,int n)
-{
- for(int i=0;ia[j+1])
- {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/KijD_wyp/15647839.java b/codes/KijD_wyp/15647839.java
deleted file mode 100644
index 5403354d..00000000
--- a/codes/KijD_wyp/15647839.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * 功能：对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 外层循环控制比较的次数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环负责具体的比较和交换
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果当前元素大于下一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/Kio1262902996/11044068.java b/codes/Kio1262902996/11044068.java
deleted file mode 100644
index 4d7083fe..00000000
--- a/codes/Kio1262902996/11044068.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int i, j;
-
- for(i=0; ia[j]){
- int temp;
- temp = a[j-1];
- a[j-1] = a[j];
- a[j] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/Kristen/11804698.java b/codes/Kristen/11804698.java
deleted file mode 100644
index fcd1392a..00000000
--- a/codes/Kristen/11804698.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/L13225391057/15834676.java b/codes/L13225391057/15834676.java
deleted file mode 100644
index d0e7038d..00000000
--- a/codes/L13225391057/15834676.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。
- * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的次数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一轮比较的次数
- // 如果前一个元素比后一个元素大，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/L21362757/15899070.java b/codes/L21362757/15899070.java
deleted file mode 100644
index 11828f51..00000000
--- a/codes/L21362757/15899070.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int []a,int n){
- for(int i=0;ia[j+1]){
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/LIJIAN-yuzhong/16982842.java b/codes/LIJIAN-yuzhong/16982842.java
deleted file mode 100644
index 8d011368..00000000
--- a/codes/LIJIAN-yuzhong/16982842.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
-
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/LJX0857/.keep b/codes/LJX0857/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/LJX0857/10042274.java b/codes/LJX0857/10042274.java
deleted file mode 100644
index 667eee0f..00000000
--- a/codes/LJX0857/10042274.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/LS2698853114/15540958.java b/codes/LS2698853114/15540958.java
deleted file mode 100644
index a7e15843..00000000
--- a/codes/LS2698853114/15540958.java
+++ /dev/null
@@ -1,26 +0,0 @@
-/**
- * 冒泡排序函数
- * 功能：对输入的整数数组进行冒泡排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- // 标志位，表示这一趟是否有交换
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果当前元素大于下一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 发生了交换，将标志位设为true
- swapped = true;
- }
- }
- // 如果在内层循环中没有发生交换，说明数组已经有序，可以退出排序
- if (!swapped) {
- break;
- }
- }
-} // end
diff --git a/codes/LX2745347279/16198492.java b/codes/LX2745347279/16198492.java
deleted file mode 100644
index 2bc77429..00000000
--- a/codes/LX2745347279/16198492.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j < n - 1 - i; j++) {
- // 如果当前元素大于下一个元素，则交换它们
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/Laodeng/15839462.java b/codes/Laodeng/15839462.java
deleted file mode 100644
index f5d92931..00000000
--- a/codes/Laodeng/15839462.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过重复遍历待排序的数组，比较每对相邻的元素，如果它们的顺序错误就把它们交换过来，
- * 遍历数组的工作是重复地进行直到没有再需要交换，也就是说该数组已经排序完成。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 遍历所有数组元素
- for (int i = 0; i < n - 1; i++) {
- // Last i elements are already in place
- for (int j = 0; j < n - i - 1; j++) {
- // 遍历数组从0到n-i-1，交换如果元素找到比下一个元素大
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/LatiaoPro/11352722.java b/codes/LatiaoPro/11352722.java
deleted file mode 100644
index 8c505501..00000000
--- a/codes/LatiaoPro/11352722.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;i a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/LightLeaf/14443538.java b/codes/LightLeaf/14443538.java
deleted file mode 100644
index 926b8102..00000000
--- a/codes/LightLeaf/14443538.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- int i=0;
- int temp;
- while(ia[j+1]){
- temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- i++;
- }
-} //end
diff --git a/codes/Likui123/.keep b/codes/Likui123/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Likui123/15713905.java b/codes/Likui123/15713905.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/Likui123/15713905.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/Lishen/.keep b/codes/Lishen/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Lishen/15630879.java b/codes/Lishen/15630879.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/Lishen/15630879.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/LongXiTWT/.keep b/codes/LongXiTWT/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/LongXiTWT/15840763.java b/codes/LongXiTWT/15840763.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/LongXiTWT/15840763.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/Lorin210926/15605953.java b/codes/Lorin210926/15605953.java
deleted file mode 100644
index 20575dc4..00000000
--- a/codes/Lorin210926/15605953.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/Lovershandd/.keep b/codes/Lovershandd/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Lovershandd/15845218.java b/codes/Lovershandd/15845218.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/Lovershandd/15845218.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/Lsaoei/15836207.java b/codes/Lsaoei/15836207.java
deleted file mode 100644
index d0e7038d..00000000
--- a/codes/Lsaoei/15836207.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。
- * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的次数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一轮比较的次数
- // 如果前一个元素比后一个元素大，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/Lundyli/11471416.java b/codes/Lundyli/11471416.java
deleted file mode 100644
index 8c505501..00000000
--- a/codes/Lundyli/11471416.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;i a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/Lyw413181892/15630146.java b/codes/Lyw413181892/15630146.java
deleted file mode 100644
index f2b711a4..00000000
--- a/codes/Lyw413181892/15630146.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int huat = 0; huat < n - i - 1; huat++) {
- if(a[huat] > a[huat + 1]) {
- int temp = a[huat];
- a [huat] = a[huat + 1];
- a[huat + 1] = temp;
- }
- }
- }
-
-
-} //end,huat
diff --git a/codes/M8M9900/11211820.java b/codes/M8M9900/11211820.java
deleted file mode 100644
index 1c888994..00000000
--- a/codes/M8M9900/11211820.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/MIngDx/11303026.java b/codes/MIngDx/11303026.java
deleted file mode 100644
index 029e9d84..00000000
--- a/codes/MIngDx/11303026.java
+++ /dev/null
@@ -1,28 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
-*/
-public static void bubbleSort(int [] a, int n){
- int j , k;
- int flag = n ;//flag来记录最后交换的位置，也就是排序的尾边界
-
- while (flag > 0){//排序未结束标志
- k = flag; //k 来记录遍历的尾边界
- flag = 0;
-
- for(j=1; j a[j]){//前面的数字大于后面的数字就交换
- //交换a[j-1]和a[j]
- int temp;
- temp = a[j-1];
- a[j-1] = a[j];
- a[j]=temp;
-
- //表示交换过数据;
- flag = j;//记录最新的尾边界.
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/ML777-7/15832109.java b/codes/ML777-7/15832109.java
deleted file mode 100644
index d0e7038d..00000000
--- a/codes/ML777-7/15832109.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。
- * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的次数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一轮比较的次数
- // 如果前一个元素比后一个元素大，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MardaWang/15960606.java b/codes/MardaWang/15960606.java
deleted file mode 100644
index 23e5c9e0..00000000
--- a/codes/MardaWang/15960606.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n-1; i++){
- for(int j=0; j < n-1-i; j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/Martin-9527/15628832.java b/codes/Martin-9527/15628832.java
deleted file mode 100644
index 20575dc4..00000000
--- a/codes/Martin-9527/15628832.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/.15571733.java.swp b/codes/MaxLeton/.15571733.java.swp
deleted file mode 100644
index 48a16a164a447d809c471f303c8ca39d8de57ac9..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001
literal 12288
zcmeI%O-ma=7zgmN=e~&T(ZW-UprP)VE^$42E!0!72c?IZO~fs6Cnl3%D=LCk1gQ}4
z1@RCO+H0XV)9AIIq37&|p85rP=(8q5+dvQALjME*%+6-#naL0KFhq~Pd^Sy!&bZ*#
zpM132$8{l!#@OrezxrUdJU`(r&AY}ed5dqCG85X%db3?q){=r!`8KEo_RUzyUoa*w
zeUr_VxeRu$D%0yiK4fg20lnQ@<{uU_@XLyzeGz|4&+VIl+|
z009U<00Izz00bb=djhu5C-|r@ZgsYPyVLjm)pv&IAOHafKmY;|fB*y_009U<00I!`
zK>?K&;_F=@9^B*2^Z)w+DYawhRFXKmY;|
zfB*y_009U<00RHFz$!_Z3;AG7+#JXGqnDDJjaut?vspiD)i!>7*=;s1 a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15571733.java b/codes/MaxLeton/15571733.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15571733.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15575568.java b/codes/MaxLeton/15575568.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15575568.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15576146.java b/codes/MaxLeton/15576146.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15576146.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15576148.java b/codes/MaxLeton/15576148.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15576148.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15576152.java b/codes/MaxLeton/15576152.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15576152.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15579562.java b/codes/MaxLeton/15579562.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15579562.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15579566.java b/codes/MaxLeton/15579566.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15579566.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15579567.java b/codes/MaxLeton/15579567.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15579567.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15579569.java b/codes/MaxLeton/15579569.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15579569.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15579570.java b/codes/MaxLeton/15579570.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15579570.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15594053.java b/codes/MaxLeton/15594053.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15594053.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15594054.java b/codes/MaxLeton/15594054.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15594054.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15594056.java b/codes/MaxLeton/15594056.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15594056.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15594059.java b/codes/MaxLeton/15594059.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15594059.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15594060.java b/codes/MaxLeton/15594060.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15594060.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15608880.java b/codes/MaxLeton/15608880.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15608880.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15608883.java b/codes/MaxLeton/15608883.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15608883.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15608887.java b/codes/MaxLeton/15608887.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15608887.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15608889.java b/codes/MaxLeton/15608889.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15608889.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15608891.java b/codes/MaxLeton/15608891.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15608891.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15626095.java b/codes/MaxLeton/15626095.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15626095.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15626097.java b/codes/MaxLeton/15626097.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15626097.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15626100.java b/codes/MaxLeton/15626100.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15626100.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15626101.java b/codes/MaxLeton/15626101.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15626101.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15626102.java b/codes/MaxLeton/15626102.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15626102.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15655523.java b/codes/MaxLeton/15655523.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15655523.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15655527.java b/codes/MaxLeton/15655527.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15655527.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15655529.java b/codes/MaxLeton/15655529.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15655529.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15655530.java b/codes/MaxLeton/15655530.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15655530.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15655532.java b/codes/MaxLeton/15655532.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15655532.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15670770.java b/codes/MaxLeton/15670770.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15670770.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15670771.java b/codes/MaxLeton/15670771.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15670771.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15670774.java b/codes/MaxLeton/15670774.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15670774.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15670778.java b/codes/MaxLeton/15670778.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15670778.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15670781.java b/codes/MaxLeton/15670781.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15670781.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15689390.java b/codes/MaxLeton/15689390.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15689390.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15689391.java b/codes/MaxLeton/15689391.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15689391.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15689394.java b/codes/MaxLeton/15689394.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15689394.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15689395.java b/codes/MaxLeton/15689395.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15689395.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15689399.java b/codes/MaxLeton/15689399.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15689399.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15701706.java b/codes/MaxLeton/15701706.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15701706.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15701711.java b/codes/MaxLeton/15701711.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15701711.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15701714.java b/codes/MaxLeton/15701714.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15701714.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15701718.java b/codes/MaxLeton/15701718.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15701718.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15701720.java b/codes/MaxLeton/15701720.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15701720.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15716047.java b/codes/MaxLeton/15716047.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15716047.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15716048.java b/codes/MaxLeton/15716048.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15716048.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15716049.java b/codes/MaxLeton/15716049.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15716049.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15716050.java b/codes/MaxLeton/15716050.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15716050.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15716053.java b/codes/MaxLeton/15716053.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15716053.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15747350.java b/codes/MaxLeton/15747350.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15747350.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15747354.java b/codes/MaxLeton/15747354.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15747354.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15747356.java b/codes/MaxLeton/15747356.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15747356.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15747359.java b/codes/MaxLeton/15747359.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15747359.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/15747361.java b/codes/MaxLeton/15747361.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/15747361.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/16519582.java b/codes/MaxLeton/16519582.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/16519582.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/16519586.java b/codes/MaxLeton/16519586.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/16519586.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/16519591.java b/codes/MaxLeton/16519591.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/16519591.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/16519593.java b/codes/MaxLeton/16519593.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/16519593.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/16519596.java b/codes/MaxLeton/16519596.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/16519596.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17040714.java b/codes/MaxLeton/17040714.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17040714.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17040715.java b/codes/MaxLeton/17040715.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17040715.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17040721.java b/codes/MaxLeton/17040721.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17040721.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17040722.java b/codes/MaxLeton/17040722.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17040722.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17040725.java b/codes/MaxLeton/17040725.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17040725.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17044792.java b/codes/MaxLeton/17044792.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17044792.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17044794.java b/codes/MaxLeton/17044794.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17044794.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17044796.java b/codes/MaxLeton/17044796.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17044796.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17044797.java b/codes/MaxLeton/17044797.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17044797.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17044800.java b/codes/MaxLeton/17044800.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17044800.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17061868.java b/codes/MaxLeton/17061868.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17061868.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17061869.java b/codes/MaxLeton/17061869.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17061869.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17061870.java b/codes/MaxLeton/17061870.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17061870.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17061871.java b/codes/MaxLeton/17061871.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17061871.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17061873.java b/codes/MaxLeton/17061873.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17061873.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17066605.java b/codes/MaxLeton/17066605.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17066605.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17066607.java b/codes/MaxLeton/17066607.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17066607.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17066608.java b/codes/MaxLeton/17066608.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17066608.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17066609.java b/codes/MaxLeton/17066609.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17066609.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17066611.java b/codes/MaxLeton/17066611.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17066611.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17066615.java b/codes/MaxLeton/17066615.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17066615.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17067867.java b/codes/MaxLeton/17067867.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17067867.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17067870.java b/codes/MaxLeton/17067870.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17067870.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17067871.java b/codes/MaxLeton/17067871.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17067871.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17067872.java b/codes/MaxLeton/17067872.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17067872.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17067874.java b/codes/MaxLeton/17067874.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17067874.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17084198.java b/codes/MaxLeton/17084198.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17084198.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17084201.java b/codes/MaxLeton/17084201.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17084201.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17084202.java b/codes/MaxLeton/17084202.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17084202.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17084204.java b/codes/MaxLeton/17084204.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17084204.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17084206.java b/codes/MaxLeton/17084206.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17084206.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17104411.java b/codes/MaxLeton/17104411.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17104411.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17104414.java b/codes/MaxLeton/17104414.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17104414.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17104415.java b/codes/MaxLeton/17104415.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17104415.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17104420.java b/codes/MaxLeton/17104420.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17104420.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17104424.java b/codes/MaxLeton/17104424.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17104424.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17118929.java b/codes/MaxLeton/17118929.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17118929.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17118934.java b/codes/MaxLeton/17118934.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17118934.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17118937.java b/codes/MaxLeton/17118937.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17118937.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17118939.java b/codes/MaxLeton/17118939.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17118939.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17118941.java b/codes/MaxLeton/17118941.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17118941.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17128518.java b/codes/MaxLeton/17128518.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17128518.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17128519.java b/codes/MaxLeton/17128519.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17128519.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17128522.java b/codes/MaxLeton/17128522.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17128522.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17128527.java b/codes/MaxLeton/17128527.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17128527.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17128530.java b/codes/MaxLeton/17128530.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17128530.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17142779.java b/codes/MaxLeton/17142779.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17142779.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17142782.java b/codes/MaxLeton/17142782.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17142782.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17142783.java b/codes/MaxLeton/17142783.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17142783.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17142784.java b/codes/MaxLeton/17142784.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17142784.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17142785.java b/codes/MaxLeton/17142785.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17142785.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17150613.java b/codes/MaxLeton/17150613.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17150613.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17150614.java b/codes/MaxLeton/17150614.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17150614.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17150616.java b/codes/MaxLeton/17150616.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17150616.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17150617.java b/codes/MaxLeton/17150617.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17150617.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17150619.java b/codes/MaxLeton/17150619.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17150619.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17168898.java b/codes/MaxLeton/17168898.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17168898.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17168901.java b/codes/MaxLeton/17168901.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17168901.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17168903.java b/codes/MaxLeton/17168903.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17168903.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17168905.java b/codes/MaxLeton/17168905.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17168905.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17168907.java b/codes/MaxLeton/17168907.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17168907.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17185943.java b/codes/MaxLeton/17185943.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17185943.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17185948.java b/codes/MaxLeton/17185948.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17185948.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17185950.java b/codes/MaxLeton/17185950.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17185950.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17185953.java b/codes/MaxLeton/17185953.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17185953.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17185957.java b/codes/MaxLeton/17185957.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17185957.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17199424.java b/codes/MaxLeton/17199424.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17199424.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17199427.java b/codes/MaxLeton/17199427.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17199427.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17199429.java b/codes/MaxLeton/17199429.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17199429.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17199431.java b/codes/MaxLeton/17199431.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17199431.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17199433.java b/codes/MaxLeton/17199433.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17199433.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17212361.java b/codes/MaxLeton/17212361.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17212361.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17212364.java b/codes/MaxLeton/17212364.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17212364.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17212369.java b/codes/MaxLeton/17212369.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17212369.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17212370.java b/codes/MaxLeton/17212370.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17212370.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/MaxLeton/17212371.java b/codes/MaxLeton/17212371.java
deleted file mode 100644
index 4fe168de..00000000
--- a/codes/MaxLeton/17212371.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j< n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/Melantha/15775251.java b/codes/Melantha/15775251.java
deleted file mode 100644
index 70c83839..00000000
--- a/codes/Melantha/15775251.java
+++ /dev/null
@@ -1,36 +0,0 @@
- /**
-
- * 冒泡排序函数
-
- * 功能：对输入的数组进行冒泡排序
-
- * @param a 待排序的数组
-
- * @param n 待排序的数组长度
-
- */
-
- public static void bubbleSort(int [] a, int n){
-
- for (int i = 0; i < n - 1; i++) {
-
- for (int j = 0; j < n - i - 1; j++) {
-
- // 如果前一个元素大于后一个元素，则交换它们的位置
-
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
-
- a[j] = a[j + 1];
-
- a[j + 1] = temp;
-
- }
-
- }
-
- }
-
- } //end
-
diff --git a/codes/Meng527/10036105.java b/codes/Meng527/10036105.java
deleted file mode 100644
index 42e67aad..00000000
--- a/codes/Meng527/10036105.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡 排序 函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-}//end
-
diff --git a/codes/Monorepo/11203800.java b/codes/Monorepo/11203800.java
deleted file mode 100644
index 326c3a05..00000000
--- a/codes/Monorepo/11203800.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n - 1; i++){
- for(int j = 0; j < n - 1 - i; j++){
- if(a[j] > a[j + 1])
- {
- int swap = 0;
- swap = a[j];
- a[j] = a[j+1];
- a[j+1] = swap;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/Mrzhao/11115789.java b/codes/Mrzhao/11115789.java
deleted file mode 100644
index 24b49b4b..00000000
--- a/codes/Mrzhao/11115789.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/Mu2024s/.keep b/codes/Mu2024s/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Mu2024s/15843378.java b/codes/Mu2024s/15843378.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/Mu2024s/15843378.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/MuZiNan/.15657839.java.swp b/codes/MuZiNan/.15657839.java.swp
deleted file mode 100644
index 09374482e60ca124f6bc6c7d84df8b257de59da0..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001
literal 12288
zcmeI1PiqrV6vba%w^|ikh>NR&)Wmc$jjhqC;?_l7D0PvN#haOgzA>2@CX>)0Q3|Q<
z6asbO&W-DWyA<_%xN|Wneg_fn{0SCgEOcezJUDaTym#)I#}8&Pj9Gm0V2#R)MZse}
zzNF)4Ux>i-!twpTs;ac>E4tS#b?Q&M_Ey)v8EpDXm5G+;aiAuxP<2$;Ewrpn&ueIw
zXV+TVTDzhiN>|gDSC(&;OScyt*^v_oSO5VKI6i^7_0p1_yy{o4T&DBq){h^BP7nYA
z5C8!X009sH0T2Lz6GtHQXT%FW^{MRSXR|ubAAkSb{qE;wFE*($VWVTJSQG4tKVbZx#C3z!$kQ>M5G#1_WWgwg6
zQuKLe^m-5t-yFQ_k9PMC_WR#=zeK|ihfMM>rg&RQGEK6qcpkkRj6S|klcHCjI7w)^
GocINfzq304
diff --git a/codes/MuZiNan/10041393.java b/codes/MuZiNan/10041393.java
deleted file mode 100644
index 7259ea26..00000000
--- a/codes/MuZiNan/10041393.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
-
diff --git a/codes/MuZiNan/15657839.java b/codes/MuZiNan/15657839.java
deleted file mode 100644
index 51d71b83..00000000
--- a/codes/MuZiNan/15657839.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
diff --git a/codes/Muzizy/15639710.java b/codes/Muzizy/15639710.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/Muzizy/15639710.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/Myron520/15614791.java b/codes/Myron520/15614791.java
deleted file mode 100644
index e5ce3441..00000000
--- a/codes/Myron520/15614791.java
+++ /dev/null
@@ -1,23 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int i, j;
-
- for (i = n - 1; i > 0; i--) {
- // 将a[0...i]中最大的数据放在末尾
- for (j = 0; j < i; j++) {
-
- if (a[j] > a[j + 1]) {
- // 交换a[j]和a[j+1]
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-} //end
diff --git a/codes/N193560C/15816303.java b/codes/N193560C/15816303.java
deleted file mode 100644
index 8a9fb777..00000000
--- a/codes/N193560C/15816303.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 使用冒泡排序算法对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/NANF41/11116589.java b/codes/NANF41/11116589.java
deleted file mode 100644
index 2289d8d3..00000000
--- a/codes/NANF41/11116589.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
-for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/NPUlhy/18473575.java b/codes/NPUlhy/18473575.java
deleted file mode 100644
index 608b6962..00000000
--- a/codes/NPUlhy/18473575.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
-
- // 你的代码，使无序数组 a 变得有序
- int b = 0;
- for(int i = 0; i < n-1;i++){
- for(int j = 0; j < n-1-i;j++){
- if(a[j] > a[j + 1]){
- b = a[j+1];
- a[j+1] = a[j];
- a[j] = b;
- }
- }
- }
-
-} //end
diff --git a/codes/NProgress/11324505.java b/codes/NProgress/11324505.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/NProgress/11324505.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/NX9990/15752874.java b/codes/NX9990/15752874.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/NX9990/15752874.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/NXJ19563886818/15812590.java b/codes/NXJ19563886818/15812590.java
deleted file mode 100644
index 166dea5d..00000000
--- a/codes/NXJ19563886818/15812590.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数通过冒泡排序算法对数组进行排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮的比较次数
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/Namesp4ces/.keep b/codes/Namesp4ces/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Namesp4ces/15839516.java b/codes/Namesp4ces/15839516.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/Namesp4ces/15839516.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/Navigation1/11130536.java b/codes/Navigation1/11130536.java
deleted file mode 100644
index 24b49b4b..00000000
--- a/codes/Navigation1/11130536.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/NeilGCT/15827010.java b/codes/NeilGCT/15827010.java
deleted file mode 100644
index b0f1eff4..00000000
--- a/codes/NeilGCT/15827010.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数使用冒泡排序算法对整数数组进行排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序的轮数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每一轮的比较次数
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/Ni123456/15562619.java b/codes/Ni123456/15562619.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/Ni123456/15562619.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/Ni123456/15630872.java b/codes/Ni123456/15630872.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/Ni123456/15630872.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/OPReno/11276365.java b/codes/OPReno/11276365.java
deleted file mode 100644
index cacd12f1..00000000
--- a/codes/OPReno/11276365.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- a[j] = a[j]+a[j+1];
- a[j+1] = a[j]-a[j+1];
- a[j] = a[j]-a[j+1];
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/OVO16199/15832632.java b/codes/OVO16199/15832632.java
deleted file mode 100644
index d0e7038d..00000000
--- a/codes/OVO16199/15832632.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。
- * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的次数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一轮比较的次数
- // 如果前一个元素比后一个元素大，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/OceanBase/11302025.java b/codes/OceanBase/11302025.java
deleted file mode 100644
index 9e7534d4..00000000
--- a/codes/OceanBase/11302025.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡 排序 函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-}//end
\ No newline at end of file
diff --git a/codes/Ohiyo123ywj/.keep b/codes/Ohiyo123ywj/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Ohiyo123ywj/15843898.java b/codes/Ohiyo123ywj/15843898.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/Ohiyo123ywj/15843898.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/OnMoreTime/10860781.java b/codes/OnMoreTime/10860781.java
deleted file mode 100644
index c05a772d..00000000
--- a/codes/OnMoreTime/10860781.java
+++ /dev/null
@@ -1,24 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int temp;
- for (int i = 0; i < n - 1; i++) {
- int count = 0;
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- count++;
- }
- }
- if (count == 0) {
- break;
- }
- }
-} //end
diff --git a/codes/OneMuMu/11370801.java b/codes/OneMuMu/11370801.java
deleted file mode 100644
index 1c888994..00000000
--- a/codes/OneMuMu/11370801.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/OutlEts/11343931.java b/codes/OutlEts/11343931.java
deleted file mode 100644
index 8d589d7e..00000000
--- a/codes/OutlEts/11343931.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a,int n){
- int temp =0;
- for(int i = 0;ia[j+1]){
- temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-
-
-}
\ No newline at end of file
diff --git a/codes/P4rt01/15689858.java b/codes/P4rt01/15689858.java
deleted file mode 100644
index 854beb62..00000000
--- a/codes/P4rt01/15689858.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
-
diff --git a/codes/PHPhph/11120724.java b/codes/PHPhph/11120724.java
deleted file mode 100644
index b9bf7818..00000000
--- a/codes/PHPhph/11120724.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/PUAdewo/11303488.java b/codes/PUAdewo/11303488.java
deleted file mode 100644
index 4d7083fe..00000000
--- a/codes/PUAdewo/11303488.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int i, j;
-
- for(i=0; ia[j]){
- int temp;
- temp = a[j-1];
- a[j-1] = a[j];
- a[j] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/Pengyouyou/15805929.java b/codes/Pengyouyou/15805929.java
deleted file mode 100644
index 24f513b3..00000000
--- a/codes/Pengyouyou/15805929.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/PexoPexo/11116939.java b/codes/PexoPexo/11116939.java
deleted file mode 100644
index 9e7534d4..00000000
--- a/codes/PexoPexo/11116939.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡 排序 函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-}//end
\ No newline at end of file
diff --git a/codes/Platform/11203867.java b/codes/Platform/11203867.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/Platform/11203867.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/PunkHeart/16456064.java b/codes/PunkHeart/16456064.java
deleted file mode 100644
index e3d6f776..00000000
--- a/codes/PunkHeart/16456064.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- //代码，使无序数组a变得有序
- for (int i = 0; i < n - 1;i++){
- for (int j = 0; j< n - i - 1; j++){
- if (a[j] > a[j + 1]){
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/Q13944328337/15841142.java b/codes/Q13944328337/15841142.java
deleted file mode 100644
index 47e0d6ef..00000000
--- a/codes/Q13944328337/15841142.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 功能：对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 遍历数组，从第一个元素到倒数第二个元素
- for (int j = 0; j < n - 1 - i; j++) { // 每次比较相邻的元素，最后一个元素已经是当前轮的最大值，无需再比较
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/Q18379787658/15861304.java b/codes/Q18379787658/15861304.java
deleted file mode 100644
index 54c5f386..00000000
--- a/codes/Q18379787658/15861304.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
\ No newline at end of file
diff --git a/codes/Q2529807676/15563540.java b/codes/Q2529807676/15563540.java
deleted file mode 100644
index ae82e695..00000000
--- a/codes/Q2529807676/15563540.java
+++ /dev/null
@@ -1,35 +0,0 @@
-/**
-
- * 冒泡排序函数
-
- * aa bb cc
-
- * @param a 待排序的数组
-
- * @param n 待排序的数组长度
-
- */
-
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0; i < n-1 ; i++){
-
- for (int j = 0;j < n-1-i;j++){
-
- if(a[j] > a[j+1]){
-
- int temp = a[j];
-
- a[j] = a[j+1];
-
- a[j+1] = temp;
-
- }
-
- }
-
- }
-
-
-
-} //end
diff --git a/codes/Q8888688888/11213062.java b/codes/Q8888688888/11213062.java
deleted file mode 100644
index cacd12f1..00000000
--- a/codes/Q8888688888/11213062.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- a[j] = a[j]+a[j+1];
- a[j+1] = a[j]-a[j+1];
- a[j] = a[j]-a[j+1];
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/QQ504113939/15788225.java b/codes/QQ504113939/15788225.java
deleted file mode 100644
index 33be1b95..00000000
--- a/codes/QQ504113939/15788225.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
-* 冒泡排序函数
-* aa bb cc
-* @param a 待排序的数组
-* @param n 待排序的数组长度
-*/
-public static void bubbleSort(int [] a, int n){
-// 你的代码，使无序数组 a 变得有序
-for (int i = 0; i < n - 1; i++) {
-for (int j = 0; j < n - i - 1; j++) {
-if (a[j] > a[j + 1]) {
-// 交换元素
-int temp = a[j];
-a[j] = a[j + 1];
-a[j + 1] = temp;
-}
-}
-}
-} //end
diff --git a/codes/QiQi77/15719621.java b/codes/QiQi77/15719621.java
deleted file mode 100644
index 5b72062d..00000000
--- a/codes/QiQi77/15719621.java
+++ /dev/null
@@ -1,27 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素之间的比较和交换，将最大的元素“冒泡”到数组的末尾
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- // 标记是否有交换发生，用于优化，如果这一趟没有交换，说明已经有序
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果当前元素大于下一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 标记发生了交换
- swapped = true;
- }
- }
- // 如果没有发生交换，说明数组已经有序，可以提前结束排序
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/Qking123/.15572198.java.swp b/codes/Qking123/.15572198.java.swp
deleted file mode 100644
index 17a500efb8338413057a3263ea6b3bd86e91a689..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001
literal 12288
zcmeI1O=}ZT6ozjF1(m8qL2z|cgqqk+CZ(pDDsEl45Ya_z7I!8|y-Au$CzGIvUs!85
zwh*Wb=|&I(3L0=BG_?K*ckX9ue}dq`bMw`j6ojrUya(R7b5G8F&zT2i5ypz%xqgGj
zN1}q`m=FiP{z_jybwcGZ!sO_nnkqp{L#suGXoX79W9w6vp>ea9YaLqpo0
zswnTlaLK;sIC;Z%Qt6U$Gp7pEW^B|j$Hw9@^V0Z8R#s%61ri_t0=p(KC`Myu^Ho24
z<}@7--QKkm4uSv(fB*=900@8p2!H?x>^%ZraX>ubvG=t{54G2Up0&Nj0sou#&vRD(W{jBeN
z<^$_F>n$Q63bC~3Ar=AzKmY_l00ck)1V8`;KmY_l;J+e3hLJ9$1ku4qeA$Y>
zcRJsn(OK!bQ`v}_q$}j5XNn1-lfBU_(j}ehoy%0gYnpTlll^5XLql!1t6jJA^iXVX
znQ>ei(q>t9iY9oOpaKn(Vwt>+M0!sc1_hs&ey)AmeD=y;ocHVV!OBzrU2WsdT(Df<
zs5ShBda&}*udjC-b(^SG6Q!FZNVUw1<-D?URPv;!Y^pdaMON9e^66WS>osSaO3DkQ
zhb%OQ2^)gKbgd{|Im5&H>o0=Es=vC_o}e+ex%|yveZQ?p?ogzEmXa)sY+K*^^VQ(X
Q+m@66a*dxw7~!z^15OFhhX4Qo
diff --git a/codes/Qking123/15572198.java b/codes/Qking123/15572198.java
deleted file mode 100644
index 13964cf8..00000000
--- a/codes/Qking123/15572198.java
+++ /dev/null
@@ -1,39 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-/*pulick static void bubbleSort(int []a, int n) {
- boolean flag = false;
- for (int i = 0; i < n; i++) {
- // 每轮遍历将最大的数移到末尾
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j+1]) {
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- if (flag == false){
- break;
- }else {
- flag = false;
- }
- }
-} //end
-*/
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
diff --git a/codes/Qw2229188799/11089611.java b/codes/Qw2229188799/11089611.java
deleted file mode 100644
index 9e7534d4..00000000
--- a/codes/Qw2229188799/11089611.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡 排序 函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-}//end
\ No newline at end of file
diff --git a/codes/Qw25526/11118523.java b/codes/Qw25526/11118523.java
deleted file mode 100644
index 2289d8d3..00000000
--- a/codes/Qw25526/11118523.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
-for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/Renswc/15592706.java b/codes/Renswc/15592706.java
deleted file mode 100644
index ae82e695..00000000
--- a/codes/Renswc/15592706.java
+++ /dev/null
@@ -1,35 +0,0 @@
-/**
-
- * 冒泡排序函数
-
- * aa bb cc
-
- * @param a 待排序的数组
-
- * @param n 待排序的数组长度
-
- */
-
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0; i < n-1 ; i++){
-
- for (int j = 0;j < n-1-i;j++){
-
- if(a[j] > a[j+1]){
-
- int temp = a[j];
-
- a[j] = a[j+1];
-
- a[j+1] = temp;
-
- }
-
- }
-
- }
-
-
-
-} //end
diff --git a/codes/Rudy1113693166/15803796.java b/codes/Rudy1113693166/15803796.java
deleted file mode 100644
index ce4123f3..00000000
--- a/codes/Rudy1113693166/15803796.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素两两比较和交换，使得每一轮过后最大（或最小）的元素被交换到序列末尾
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序的轮数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮的比较次数
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/S17673074125/15793739.java b/codes/S17673074125/15793739.java
deleted file mode 100644
index cf9befa4..00000000
--- a/codes/S17673074125/15793739.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数对输入的数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 遍历所有数组元素
- for (int i = 0; i < n - 1; i++) {
- // Last i elements are already in place
- for (int j = 0; j < n - i - 1; j++) {
- // 如果当前元素大于下一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/S19353041250/15722104.java b/codes/S19353041250/15722104.java
deleted file mode 100644
index f9a53254..00000000
--- a/codes/S19353041250/15722104.java
+++ /dev/null
@@ -1,26 +0,0 @@
-/**
- * 冒泡排序函数
- * 遍历数组，比较相邻元素，如果顺序错误则交换它们，重复这个过程直到没有需要交换的元素为止。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- // 标志位，用于标记本趟是否有交换，如果没有交换则已经有序，无需再继续比较
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 发生了交换，标志位设为true
- swapped = true;
- }
- }
- // 如果没有交换，则说明数组已经有序，无需继续后面的趟
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/SHALRU/15632282.java b/codes/SHALRU/15632282.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/SHALRU/15632282.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/SJq123456/.keep b/codes/SJq123456/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/SJq123456/15846703.java b/codes/SJq123456/15846703.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/SJq123456/15846703.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/Sakura125809/15297826.java b/codes/Sakura125809/15297826.java
deleted file mode 100644
index ada5cf36..00000000
--- a/codes/Sakura125809/15297826.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/Setinsung/.java b/codes/Setinsung/.java
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Setinsung/9697451.java b/codes/Setinsung/9697451.java
deleted file mode 100644
index 7368d1f0..00000000
--- a/codes/Setinsung/9697451.java
+++ /dev/null
@@ -1,19 +0,0 @@
-
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- a[j] = a[j]+a[j+1];
- a[j+1] = a[j]-a[j+1];
- a[j] = a[j]-a[j+1];
- }
- }
- }
-} //end
diff --git a/codes/ShaoXuan/12173130.java b/codes/ShaoXuan/12173130.java
deleted file mode 100644
index 689a8ca6..00000000
--- a/codes/ShaoXuan/12173130.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- //你的代码，使无序数组 a 变得有序
- int temp = 0;
-
- for(int i=0; i a[j+1]){
- temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
diff --git a/codes/Sharpery/15562912.java b/codes/Sharpery/15562912.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/Sharpery/15562912.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/Shephatiah/18693174.java b/codes/Shephatiah/18693174.java
deleted file mode 100644
index 9c9fea7e..00000000
--- a/codes/Shephatiah/18693174.java
+++ /dev/null
@@ -1,18 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- } //end
diff --git a/codes/SherlockZ/10666019.java b/codes/SherlockZ/10666019.java
deleted file mode 100644
index ab3d8f39..00000000
--- a/codes/SherlockZ/10666019.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/Shirley1/11532521.java b/codes/Shirley1/11532521.java
deleted file mode 100644
index 9e7534d4..00000000
--- a/codes/Shirley1/11532521.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡 排序 函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-}//end
\ No newline at end of file
diff --git a/codes/Shirley1/15780774.java b/codes/Shirley1/15780774.java
deleted file mode 100644
index 5edd6bf0..00000000
--- a/codes/Shirley1/15780774.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/ShowBuger/11475929.java b/codes/ShowBuger/11475929.java
deleted file mode 100644
index 24b49b4b..00000000
--- a/codes/ShowBuger/11475929.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/SmileWen/15629004.java b/codes/SmileWen/15629004.java
deleted file mode 100644
index eb07640e..00000000
--- a/codes/SmileWen/15629004.java
+++ /dev/null
@@ -1,27 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数实现了冒泡排序算法，将数组a中的元素按升序排列
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 遍历所有数组元素
- for (int i = 0; i < n - 1; i++) {
- // 标记变量，用于检查是否发生了交换
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果当前元素大于下一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 标记已发生交换
- swapped = true;
- }
- }
- // 如果内层循环没有发生交换，说明数组已经有序，可以提前退出
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/Snngulaf/15527734.java b/codes/Snngulaf/15527734.java
deleted file mode 100644
index b9f3f205..00000000
--- a/codes/Snngulaf/15527734.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/Snowfalls360/.keep b/codes/Snowfalls360/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Snowfalls360/15843952.java b/codes/Snowfalls360/15843952.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/Snowfalls360/15843952.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/Springboot/11121747.java b/codes/Springboot/11121747.java
deleted file mode 100644
index b9bf7818..00000000
--- a/codes/Springboot/11121747.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/Stonehuara/.keep b/codes/Stonehuara/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Stonehuara/15845722.java b/codes/Stonehuara/15845722.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/Stonehuara/15845722.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/StorIesc/11471295.java b/codes/StorIesc/11471295.java
deleted file mode 100644
index 8c505501..00000000
--- a/codes/StorIesc/11471295.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;i a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/String/11118586.java b/codes/String/11118586.java
deleted file mode 100644
index cacd12f1..00000000
--- a/codes/String/11118586.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- a[j] = a[j]+a[j+1];
- a[j+1] = a[j]-a[j+1];
- a[j] = a[j]-a[j+1];
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/TCplcker/11207395.java b/codes/TCplcker/11207395.java
deleted file mode 100644
index 1c888994..00000000
--- a/codes/TCplcker/11207395.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/TIANGESEC/15563393.java b/codes/TIANGESEC/15563393.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/TIANGESEC/15563393.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/TJ0000/15529221.java b/codes/TJ0000/15529221.java
deleted file mode 100644
index a833d8d3..00000000
--- a/codes/TJ0000/15529221.java
+++ /dev/null
@@ -1,24 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int j=0;ja[i+1])
- {
- temp=a[i];
- a[i]=a[i+1];
- a[i+1]=temp;
- }
- }
- }
- //System.out.println(a);
-
-} //end
\ No newline at end of file
diff --git a/codes/TPL666/11306800.java b/codes/TPL666/11306800.java
deleted file mode 100644
index 8c505501..00000000
--- a/codes/TPL666/11306800.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;i a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/TR9559559555/15866725.java b/codes/TR9559559555/15866725.java
deleted file mode 100644
index 24f513b3..00000000
--- a/codes/TR9559559555/15866725.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/TV18625742058/15860990.java b/codes/TV18625742058/15860990.java
deleted file mode 100644
index 54c5f386..00000000
--- a/codes/TV18625742058/15860990.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
\ No newline at end of file
diff --git a/codes/TXMQQ4/15716488.java b/codes/TXMQQ4/15716488.java
deleted file mode 100644
index 854beb62..00000000
--- a/codes/TXMQQ4/15716488.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
-
diff --git a/codes/TYboy2/11228569.java b/codes/TYboy2/11228569.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/TYboy2/11228569.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/TheZeroSunset/15775069.java b/codes/TheZeroSunset/15775069.java
deleted file mode 100644
index a73834e9..00000000
--- a/codes/TheZeroSunset/15775069.java
+++ /dev/null
@@ -1,26 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素之间的比较和交换，将无序数组变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- // 标记变量，用于优化，如果在一趟排序中没有交换，则数组已经有序
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 发生了交换，将标记设为true
- swapped = true;
- }
- }
- // 如果在内层循环中没有发生交换，则数组已经有序，提前退出
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/Tianxuan/11468972.java b/codes/Tianxuan/11468972.java
deleted file mode 100644
index 8c505501..00000000
--- a/codes/Tianxuan/11468972.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;i a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/Tomimi/18424592.java b/codes/Tomimi/18424592.java
deleted file mode 100644
index aad8da19..00000000
--- a/codes/Tomimi/18424592.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组进行冒泡排序，从小到大排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 外层循环控制所有元素是否排序完成
- for (int i = 0; i < n - 1; i++) {
- // 内层循环控制相邻元素两两比较
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果前一个元素大于后一个元素，则交换他们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/Tomorrowed/11451791.java b/codes/Tomorrowed/11451791.java
deleted file mode 100644
index 1c888994..00000000
--- a/codes/Tomorrowed/11451791.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/TonyStark_/15684919.java b/codes/TonyStark_/15684919.java
deleted file mode 100644
index fa8593fd..00000000
--- a/codes/TonyStark_/15684919.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-}
diff --git a/codes/Tory666/11472343.java b/codes/Tory666/11472343.java
deleted file mode 100644
index 8c505501..00000000
--- a/codes/Tory666/11472343.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;i a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/Tptogiar/10332054.java b/codes/Tptogiar/10332054.java
deleted file mode 100644
index 82b73c8f..00000000
--- a/codes/Tptogiar/10332054.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-} //end
-
diff --git a/codes/UMide9/11292872.java b/codes/UMide9/11292872.java
deleted file mode 100644
index 24b49b4b..00000000
--- a/codes/UMide9/11292872.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/UOAN29/15805546.java b/codes/UOAN29/15805546.java
deleted file mode 100644
index ce4123f3..00000000
--- a/codes/UOAN29/15805546.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素两两比较和交换，使得每一轮过后最大（或最小）的元素被交换到序列末尾
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序的轮数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮的比较次数
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/UsoDtst/.keep b/codes/UsoDtst/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/UsoDtst/11120436.java b/codes/UsoDtst/11120436.java
deleted file mode 100644
index 6def3d93..00000000
--- a/codes/UsoDtst/11120436.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/Vanish/15774749.java b/codes/Vanish/15774749.java
deleted file mode 100644
index 805879bb..00000000
--- a/codes/Vanish/15774749.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 功能：对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- // 如果当前元素大于下一个元素，则交换位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/VincentHuang218/11469479.java b/codes/VincentHuang218/11469479.java
deleted file mode 100644
index 8c505501..00000000
--- a/codes/VincentHuang218/11469479.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;i a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/W2045396389/15630059.java b/codes/W2045396389/15630059.java
deleted file mode 100644
index 3c660dce..00000000
--- a/codes/W2045396389/15630059.java
+++ /dev/null
@@ -1,28 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过比较相邻的元素并交换它们的位置，如果它们的顺序错误就把它们交换过来。
- * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- // 用于标记数组是否已经有序，如果某次循环中没有发生交换，则说明已经有序
- boolean isSorted = true;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果当前元素大于下一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 标记数组在本次循环中发生了交换，因此数组还未有序
- isSorted = false;
- }
- }
- // 如果在一次循环中没有发生任何交换，则数组已经有序，可以提前结束排序
- if (isSorted) {
- break;
- }
- }
-} //end
diff --git a/codes/W2848330317/15830359.java b/codes/W2848330317/15830359.java
deleted file mode 100644
index b16e04c1..00000000
--- a/codes/W2848330317/15830359.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * 功能：对输入的数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 外层循环控制排序的轮数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环控制每轮排序的比较次数
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果前一个元素比后一个元素大，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/W4tcherLock/.keep b/codes/W4tcherLock/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/W4tcherLock/15847592.java b/codes/W4tcherLock/15847592.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/W4tcherLock/15847592.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/WML321/15517626.java b/codes/WML321/15517626.java
deleted file mode 100644
index e55c540a..00000000
--- a/codes/WML321/15517626.java
+++ /dev/null
@@ -1,18 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
-} //end
diff --git a/codes/WQ18355919568/15742272.java b/codes/WQ18355919568/15742272.java
deleted file mode 100644
index ae82e695..00000000
--- a/codes/WQ18355919568/15742272.java
+++ /dev/null
@@ -1,35 +0,0 @@
-/**
-
- * 冒泡排序函数
-
- * aa bb cc
-
- * @param a 待排序的数组
-
- * @param n 待排序的数组长度
-
- */
-
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0; i < n-1 ; i++){
-
- for (int j = 0;j < n-1-i;j++){
-
- if(a[j] > a[j+1]){
-
- int temp = a[j];
-
- a[j] = a[j+1];
-
- a[j+1] = temp;
-
- }
-
- }
-
- }
-
-
-
-} //end
diff --git a/codes/W_changing/15829938.java b/codes/W_changing/15829938.java
deleted file mode 100644
index 14986e4a..00000000
--- a/codes/W_changing/15829938.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素两两比较，较大的元素逐渐后移，较小的元素逐渐前移，实现排序。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮比较次数
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/Weiyi888/.keep b/codes/Weiyi888/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Weiyi888/15720599.java b/codes/Weiyi888/15720599.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/Weiyi888/15720599.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/Whk15038723546/15482712.java b/codes/Whk15038723546/15482712.java
deleted file mode 100644
index f521686d..00000000
--- a/codes/Whk15038723546/15482712.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-
-} //end
diff --git a/codes/Wiarrara/.keep b/codes/Wiarrara/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Wiarrara/15845136.java b/codes/Wiarrara/15845136.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/Wiarrara/15845136.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/Wilmothe/15592034.java b/codes/Wilmothe/15592034.java
deleted file mode 100644
index ae82e695..00000000
--- a/codes/Wilmothe/15592034.java
+++ /dev/null
@@ -1,35 +0,0 @@
-/**
-
- * 冒泡排序函数
-
- * aa bb cc
-
- * @param a 待排序的数组
-
- * @param n 待排序的数组长度
-
- */
-
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0; i < n-1 ; i++){
-
- for (int j = 0;j < n-1-i;j++){
-
- if(a[j] > a[j+1]){
-
- int temp = a[j];
-
- a[j] = a[j+1];
-
- a[j+1] = temp;
-
- }
-
- }
-
- }
-
-
-
-} //end
diff --git a/codes/Winnie/.keep b/codes/Winnie/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Winnie/10042948.java b/codes/Winnie/10042948.java
deleted file mode 100644
index 667eee0f..00000000
--- a/codes/Winnie/10042948.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/Wiseung/15774607.java b/codes/Wiseung/15774607.java
deleted file mode 100644
index 091707ae..00000000
--- a/codes/Wiseung/15774607.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数将给定的数组进行冒泡排序，使其从小到大有序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 外层循环控制排序的轮数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环控制每轮比较的次数
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
- // 当所有循环结束后，数组a已经变得有序
-} //end
diff --git a/codes/WpWwangpeng/.keep b/codes/WpWwangpeng/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/WpWwangpeng/10039890.java b/codes/WpWwangpeng/10039890.java
deleted file mode 100644
index 29d27043..00000000
--- a/codes/WpWwangpeng/10039890.java
+++ /dev/null
@@ -1,23 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n-1; i++) {
- for (int j = 0; j < n-1-i; j++) {
- if (a[j] >= a[j+1]) {
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
- System.out.print("冒泡排序的结果是： ");
- for (int i : a) {
- System.out.print(i + " ");
- }
-} //end
\ No newline at end of file
diff --git a/codes/Wu18703486053/15850317.java b/codes/Wu18703486053/15850317.java
deleted file mode 100644
index 809e6c45..00000000
--- a/codes/Wu18703486053/15850317.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素两两比较和交换，使得每一轮循环后最大（或最小）的元素“冒泡”到数组的末尾。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮比较的次数
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- // 交换 a[j] 和 a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/Wybzshuai/.keep b/codes/Wybzshuai/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Wybzshuai/10980502.java b/codes/Wybzshuai/10980502.java
deleted file mode 100644
index 9eccfac5..00000000
--- a/codes/Wybzshuai/10980502.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/Wyh005116/15858691.java b/codes/Wyh005116/15858691.java
deleted file mode 100644
index 271d2f1d..00000000
--- a/codes/Wyh005116/15858691.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 将数组a按照从小到大的顺序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- // 交换a[j]和a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/XHrcool/.keep b/codes/XHrcool/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/XHrcool/15842556.java b/codes/XHrcool/15842556.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/XHrcool/15842556.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/XUANAIQ/15635606.java b/codes/XUANAIQ/15635606.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/XUANAIQ/15635606.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/XUEMAO/15513347.java b/codes/XUEMAO/15513347.java
deleted file mode 100644
index e8795f9a..00000000
--- a/codes/XUEMAO/15513347.java
+++ /dev/null
@@ -1,29 +0,0 @@
-/**
- * 冒泡排序函数
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- if (a == null || n <= 1) {
- return; // 如果数组为空或只有一个元素，不需要排序
- }
- boolean swapped;
- for (int i = 0; i < n - 1; i++) {
- swapped = false;
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- swapped = true;
- }
- }
- // 如果这一轮没有发生任何交换，说明数组已经排序完毕，可以直接退出
- if (!swapped) {
- break;
- }
- }
-} //end
-
-
diff --git a/codes/XXOPQQ/11202216.java b/codes/XXOPQQ/11202216.java
deleted file mode 100644
index 4d7083fe..00000000
--- a/codes/XXOPQQ/11202216.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int i, j;
-
- for(i=0; ia[j]){
- int temp;
- temp = a[j-1];
- a[j-1] = a[j];
- a[j] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/XiaoBoBo/15528811.java b/codes/XiaoBoBo/15528811.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/XiaoBoBo/15528811.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/XiaoYu/15641195.java b/codes/XiaoYu/15641195.java
deleted file mode 100644
index 2a7f382c..00000000
--- a/codes/XiaoYu/15641195.java
+++ /dev/null
@@ -1,25 +0,0 @@
-/**
- * 冒泡排序函数
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- // 标志位，表示这一趟是否有交换，优化冒泡排序的关键
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 发生了交换，将标志位设为true
- swapped = true;
- }
- }
- // 如果这一趟没有发生交换，说明数组已经有序，直接退出循环
- if (!swapped) {
- break;
- }
- }
-}
diff --git a/codes/Y158505/.keep b/codes/Y158505/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Y158505/10040580.java b/codes/Y158505/10040580.java
deleted file mode 100644
index 29d27043..00000000
--- a/codes/Y158505/10040580.java
+++ /dev/null
@@ -1,23 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n-1; i++) {
- for (int j = 0; j < n-1-i; j++) {
- if (a[j] >= a[j+1]) {
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
- System.out.print("冒泡排序的结果是： ");
- for (int i : a) {
- System.out.print(i + " ");
- }
-} //end
\ No newline at end of file
diff --git a/codes/Y18379639840/15861186.java b/codes/Y18379639840/15861186.java
deleted file mode 100644
index 54c5f386..00000000
--- a/codes/Y18379639840/15861186.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
\ No newline at end of file
diff --git a/codes/Y2602388224/15856296.java b/codes/Y2602388224/15856296.java
deleted file mode 100644
index db00df43..00000000
--- a/codes/Y2602388224/15856296.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组进行冒泡排序，使得数组中的元素按从小到大的顺序排列
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 外层循环控制排序趟数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环负责进行每趟排序，通过相邻元素的比较和交换来移动较大元素到数组的末尾
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
- // 经过 n-1 趟排序后，数组已经变为有序
-} // end
diff --git a/codes/YYDS2023/11094401.java b/codes/YYDS2023/11094401.java
deleted file mode 100644
index 272a12fc..00000000
--- a/codes/YYDS2023/11094401.java
+++ /dev/null
@@ -1,18 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- } //end
\ No newline at end of file
diff --git a/codes/Yanghw/16081530.java b/codes/Yanghw/16081530.java
deleted file mode 100644
index dcbf3e18..00000000
--- a/codes/Yanghw/16081530.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 外层循环控制所有的回合
- for (int i = 0; i < n - 1; i++) {
- // 内层循环控制每一轮的冒泡处理
- for (int j = 0; j < n - 1 - i; j++) {
- // 相邻元素进行比较，如果逆序则交换
- if (a[j] > a[j + 1]) {
- // 交换a[j]和a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/Yangtzev/15774600.java b/codes/Yangtzev/15774600.java
deleted file mode 100644
index e73d1592..00000000
--- a/codes/Yangtzev/15774600.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过比较相邻元素的大小，并互换位置，从而达到排序的目的
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/Yefori/15536426.java b/codes/Yefori/15536426.java
deleted file mode 100644
index 008f3f82..00000000
--- a/codes/Yefori/15536426.java
+++ /dev/null
@@ -1,29 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- // 遍历数组
- for (int i = 0; i < n; i++) {
- // 设置一个标志，用于优化（如果在一次遍历中没有发生交换，说明数组已经有序，可以提前结束排序）
- boolean flag = false;
- // 内层循环，从第一个元素到第 n-i-1 个元素
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素比后一个元素大，交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 发生了交换，标志设为 true
- flag = true;
- }
- }
- // 如果在一次遍历中没有发生交换，说明数组已经有序，可以提前结束排序
- if (!flag) {
- break;
- }
- }
-} //end
diff --git a/codes/Yefori/15536527.java b/codes/Yefori/15536527.java
deleted file mode 100644
index 008f3f82..00000000
--- a/codes/Yefori/15536527.java
+++ /dev/null
@@ -1,29 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- // 遍历数组
- for (int i = 0; i < n; i++) {
- // 设置一个标志，用于优化（如果在一次遍历中没有发生交换，说明数组已经有序，可以提前结束排序）
- boolean flag = false;
- // 内层循环，从第一个元素到第 n-i-1 个元素
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素比后一个元素大，交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 发生了交换，标志设为 true
- flag = true;
- }
- }
- // 如果在一次遍历中没有发生交换，说明数组已经有序，可以提前结束排序
- if (!flag) {
- break;
- }
- }
-} //end
diff --git a/codes/YixinTian/11315888.java b/codes/YixinTian/11315888.java
deleted file mode 100644
index c1e52c76..00000000
--- a/codes/YixinTian/11315888.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/Ys888888/.keep b/codes/Ys888888/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Ys888888/15780625.java b/codes/Ys888888/15780625.java
deleted file mode 100644
index 667eee0f..00000000
--- a/codes/Ys888888/15780625.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/Yuan10001/15307047.java b/codes/Yuan10001/15307047.java
deleted file mode 100644
index c005e4d1..00000000
--- a/codes/Yuan10001/15307047.java
+++ /dev/null
@@ -1,23 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- //外部循环控制排序的趟数。冒泡排序的每一趟会将最大的元素"冒泡"到数组的末尾，因此需要执行 n-1 趟，其中 n 是元素的总数
- for (int i = 0; i < n - 1; i++) {
- //内循环控制每趟比较的次数。由于每一趟都会将一个最大的元素沉到数组末尾，所以内循环次数逐渐减小。
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换arr[j]和arr[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
diff --git a/codes/Yuan_559/10716235.java b/codes/Yuan_559/10716235.java
deleted file mode 100644
index 84cdc570..00000000
--- a/codes/Yuan_559/10716235.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int aa=0; aaa[bb+1]) {
- int cc = a[bb];
- a[bb] = a[bb+1];
- a[bb+1] = cc;
- }
- }
- }
-} //end
diff --git a/codes/Yy7110829/15834374.java b/codes/Yy7110829/15834374.java
deleted file mode 100644
index d0e7038d..00000000
--- a/codes/Yy7110829/15834374.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。
- * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的次数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一轮比较的次数
- // 如果前一个元素比后一个元素大，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/Z18182089257/15541298.java b/codes/Z18182089257/15541298.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/Z18182089257/15541298.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/Z1831847001/.keep b/codes/Z1831847001/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Z1831847001/10985387.java b/codes/Z1831847001/10985387.java
deleted file mode 100644
index 9eccfac5..00000000
--- a/codes/Z1831847001/10985387.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/Z19849217092/15835445.java b/codes/Z19849217092/15835445.java
deleted file mode 100644
index d0e7038d..00000000
--- a/codes/Z19849217092/15835445.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。
- * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的次数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一轮比较的次数
- // 如果前一个元素比后一个元素大，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/Z3608759124/.keep b/codes/Z3608759124/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Z3608759124/10979186.java b/codes/Z3608759124/10979186.java
deleted file mode 100644
index 5edd6bf0..00000000
--- a/codes/Z3608759124/10979186.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/Z3n1th/15536338.java b/codes/Z3n1th/15536338.java
deleted file mode 100644
index 854beb62..00000000
--- a/codes/Z3n1th/15536338.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
-
diff --git a/codes/ZXCV2288/.keep b/codes/ZXCV2288/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/ZXCV2288/15820903.java b/codes/ZXCV2288/15820903.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/ZXCV2288/15820903.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/ZYwj4399/.keep b/codes/ZYwj4399/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/ZYwj4399/15846689.java b/codes/ZYwj4399/15846689.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/ZYwj4399/15846689.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/ZZH1331065/15816621.java b/codes/ZZH1331065/15816621.java
deleted file mode 100644
index 2851642b..00000000
--- a/codes/ZZH1331065/15816621.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * 使用冒泡排序算法对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 外层循环控制排序的轮数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环负责两两相邻元素的比较和交换
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/ZZQeducation/.keep b/codes/ZZQeducation/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/ZZQeducation/15846342.java b/codes/ZZQeducation/15846342.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/ZZQeducation/15846342.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/ZeroSunset/15775945.java b/codes/ZeroSunset/15775945.java
deleted file mode 100644
index a73834e9..00000000
--- a/codes/ZeroSunset/15775945.java
+++ /dev/null
@@ -1,26 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素之间的比较和交换，将无序数组变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- // 标记变量，用于优化，如果在一趟排序中没有交换，则数组已经有序
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 发生了交换，将标记设为true
- swapped = true;
- }
- }
- // 如果在内层循环中没有发生交换，则数组已经有序，提前退出
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/ZhangKai/11036581.java b/codes/ZhangKai/11036581.java
deleted file mode 100644
index 25d28ba4..00000000
--- a/codes/ZhangKai/11036581.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/Zhangzy/15657994.java b/codes/Zhangzy/15657994.java
deleted file mode 100644
index 4d760467..00000000
--- a/codes/Zhangzy/15657994.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 将数组 a 按照升序排列
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- // 如果当前元素大于下一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 使用临时变量交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/Zhihua611/.keep b/codes/Zhihua611/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Zhihua611/15840830.java b/codes/Zhihua611/15840830.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/Zhihua611/15840830.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/Zhongjin123/.keep b/codes/Zhongjin123/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Zhongjin123/15846007.java b/codes/Zhongjin123/15846007.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/Zhongjin123/15846007.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/ZianChang/15775142.java b/codes/ZianChang/15775142.java
deleted file mode 100644
index 4b73ad0d..00000000
--- a/codes/ZianChang/15775142.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j+1]) {
- // 交换a[j]和a[j+1]的值
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/ZoeLeo010/15732573.java b/codes/ZoeLeo010/15732573.java
deleted file mode 100644
index 7ec373ae..00000000
--- a/codes/ZoeLeo010/15732573.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过对相邻的元素进行两两比较，顺序相反则进行交换，每一轮比较会将当前未排序部分的最大值“冒泡”到未排序部分的末尾。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制所有轮数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮比较的次数
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/Zoey12138/15846229.java b/codes/Zoey12138/15846229.java
deleted file mode 100644
index 5cc1c636..00000000
--- a/codes/Zoey12138/15846229.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * 功能：将无序数组 a 按照从小到大的顺序进行排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 外层循环控制所有轮数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环控制每一轮的比较次数
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/Ztmanners/.keep b/codes/Ztmanners/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/Ztmanners/15844065.java b/codes/Ztmanners/15844065.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/Ztmanners/15844065.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/ZxCvBnM321/15837924.java b/codes/ZxCvBnM321/15837924.java
deleted file mode 100644
index 6beb7512..00000000
--- a/codes/ZxCvBnM321/15837924.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 使用冒泡排序算法对数组进行排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/a04040404/15774714.java b/codes/a04040404/15774714.java
deleted file mode 100644
index 568adf0f..00000000
--- a/codes/a04040404/15774714.java
+++ /dev/null
@@ -1,26 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过重复地遍历待排序的数组，比较每对相邻的元素，如果它们的顺序错误就把它们交换过来。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- // 标记变量，用于优化，如果在一趟排序中没有发生交换，则说明已经有序
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 发生了交换，将标记设为true
- swapped = true;
- }
- }
- // 如果在一趟排序中没有发生交换，则数组已经有序，跳出循环
- if (!swapped) {
- break;
- }
- }
-} // end
diff --git a/codes/a1034852656/.keep b/codes/a1034852656/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/a1034852656/10993428.java b/codes/a1034852656/10993428.java
deleted file mode 100644
index 9eccfac5..00000000
--- a/codes/a1034852656/10993428.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/a123cwl/15774901.java b/codes/a123cwl/15774901.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/a123cwl/15774901.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/a13579/15776164.java b/codes/a13579/15776164.java
deleted file mode 100644
index 1746baaf..00000000
--- a/codes/a13579/15776164.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素比较和交换，使较大元素逐渐“浮”到数组的末尾
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序趟数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环，控制每趟排序多少次
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/a13919519903/15854734.java b/codes/a13919519903/15854734.java
deleted file mode 100644
index db00df43..00000000
--- a/codes/a13919519903/15854734.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组进行冒泡排序，使得数组中的元素按从小到大的顺序排列
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 外层循环控制排序趟数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环负责进行每趟排序，通过相邻元素的比较和交换来移动较大元素到数组的末尾
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
- // 经过 n-1 趟排序后，数组已经变为有序
-} // end
diff --git a/codes/a17537741744/15835967.java b/codes/a17537741744/15835967.java
deleted file mode 100644
index d0e7038d..00000000
--- a/codes/a17537741744/15835967.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。
- * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的次数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一轮比较的次数
- // 如果前一个元素比后一个元素大，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/a18342002424/15861602.java b/codes/a18342002424/15861602.java
deleted file mode 100644
index 54c5f386..00000000
--- a/codes/a18342002424/15861602.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
\ No newline at end of file
diff --git a/codes/a18352134184/15861238.java b/codes/a18352134184/15861238.java
deleted file mode 100644
index 54c5f386..00000000
--- a/codes/a18352134184/15861238.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
\ No newline at end of file
diff --git a/codes/a18370978367/15620229.java b/codes/a18370978367/15620229.java
deleted file mode 100644
index 462bdb84..00000000
--- a/codes/a18370978367/15620229.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/a18377237158/.keep b/codes/a18377237158/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/a18377237158/10978793.java b/codes/a18377237158/10978793.java
deleted file mode 100644
index 9eccfac5..00000000
--- a/codes/a18377237158/10978793.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/a18573769257/15857971.java b/codes/a18573769257/15857971.java
deleted file mode 100644
index 271d2f1d..00000000
--- a/codes/a18573769257/15857971.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 将数组a按照从小到大的顺序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- // 交换a[j]和a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/a19173568702/15849477.java b/codes/a19173568702/15849477.java
deleted file mode 100644
index 809e6c45..00000000
--- a/codes/a19173568702/15849477.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素两两比较和交换，使得每一轮循环后最大（或最小）的元素“冒泡”到数组的末尾。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮比较的次数
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- // 交换 a[j] 和 a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/a2159028620/.keep b/codes/a2159028620/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/a2159028620/10980184.java b/codes/a2159028620/10980184.java
deleted file mode 100644
index 9eccfac5..00000000
--- a/codes/a2159028620/10980184.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/a2313064922/15679065.java b/codes/a2313064922/15679065.java
deleted file mode 100644
index e67491fe..00000000
--- a/codes/a2313064922/15679065.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 这是一个简单的排序算法，通过重复遍历要排序的列表，比较每对相邻的项，如果它们的顺序错误就把它们交换过来。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制遍历次数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每次遍历需要比较的次数
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/a2505934241/15859458.java b/codes/a2505934241/15859458.java
deleted file mode 100644
index 271d2f1d..00000000
--- a/codes/a2505934241/15859458.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 将数组a按照从小到大的顺序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- // 交换a[j]和a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/a2523760784/9941105.java b/codes/a2523760784/9941105.java
deleted file mode 100644
index 5220eb8d..00000000
--- a/codes/a2523760784/9941105.java
+++ /dev/null
@@ -1,27 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- if(a == null || a.length == 0){
- return;
- }
- for(int i = 0; i< n; i++){
- boolean flag = true;
- for(int j = 0; j< n - i - 1 ; j++){
- if(a[j]> a[j+1]){
- int tmp = a[j];
- a[j] = a[j+1];
- a[j+1] = tmp;
- flag = false;
- }
- }
- if(flag){
- break;
- }
-
- }
-} //end
diff --git a/codes/a2554028123/.keep b/codes/a2554028123/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/a2554028123/10984030.java b/codes/a2554028123/10984030.java
deleted file mode 100644
index 9eccfac5..00000000
--- a/codes/a2554028123/10984030.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/a2565345148/15777154.java b/codes/a2565345148/15777154.java
deleted file mode 100644
index 9b5ae978..00000000
--- a/codes/a2565345148/15777154.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素比较和交换，将无序数组变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序趟数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环，进行相邻元素比较和交换
- if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们
- int temp = a[j]; // 临时变量，用于交换
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/a2565345148/15831524.java b/codes/a2565345148/15831524.java
deleted file mode 100644
index 9b5ae978..00000000
--- a/codes/a2565345148/15831524.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素比较和交换，将无序数组变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序趟数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环，进行相邻元素比较和交换
- if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们
- int temp = a[j]; // 临时变量，用于交换
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/a2667860490/15858891.java b/codes/a2667860490/15858891.java
deleted file mode 100644
index 271d2f1d..00000000
--- a/codes/a2667860490/15858891.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 将数组a按照从小到大的顺序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- // 交换a[j]和a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/a2942278197/15788264.java b/codes/a2942278197/15788264.java
deleted file mode 100644
index 4335f75e..00000000
--- a/codes/a2942278197/15788264.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素之间的比较和交换，使得每一轮循环后最大（或最小）的元素能够“冒泡”到数组的末尾。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序的轮数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环，负责每轮的比较和交换
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/a3681298224/15797237.java b/codes/a3681298224/15797237.java
deleted file mode 100644
index 166dea5d..00000000
--- a/codes/a3681298224/15797237.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数通过冒泡排序算法对数组进行排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮的比较次数
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/a6765357/15866940.java b/codes/a6765357/15866940.java
deleted file mode 100644
index 24f513b3..00000000
--- a/codes/a6765357/15866940.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/a857934324/15786660.java b/codes/a857934324/15786660.java
deleted file mode 100644
index 4aa42608..00000000
--- a/codes/a857934324/15786660.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数实现了冒泡排序算法，将数组中的元素按照从小到大的顺序排列
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序的趟数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每趟的比较次数
- if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/a940959221/15733763.java b/codes/a940959221/15733763.java
deleted file mode 100644
index ee68c90a..00000000
--- a/codes/a940959221/15733763.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组a进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- // 如果当前元素大于下一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换a[j]和a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/aAuely/15714122.java b/codes/aAuely/15714122.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/aAuely/15714122.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/a_0650/15775427.java b/codes/a_0650/15775427.java
deleted file mode 100644
index 7ce620c3..00000000
--- a/codes/a_0650/15775427.java
+++ /dev/null
@@ -1,28 +0,0 @@
-/**
- * 冒泡排序函数
- * 将无序数组通过冒泡排序算法变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- // 设置一个标志位，用于优化算法，减少不必要的比较
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素比后一个元素大，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 如果有元素交换，则标志位设为true
- swapped = true;
- }
- }
- // 如果没有元素交换，说明数组已经有序，可以提前结束排序
- if (!swapped) {
- break;
- }
- }
-} //end
-
-
diff --git a/codes/aa123456789/15808647.java b/codes/aa123456789/15808647.java
deleted file mode 100644
index 24f513b3..00000000
--- a/codes/aa123456789/15808647.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/aaa_zzz/15684144.java b/codes/aaa_zzz/15684144.java
deleted file mode 100644
index 269aafa3..00000000
--- a/codes/aaa_zzz/15684144.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数会对数组a进行排序，使其变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一趟排序多少次
- if (a[j] > a[j + 1]) { // 如果前一个数比后一个数大，则交换这两个数
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/aaajiancai/15816333.java b/codes/aaajiancai/15816333.java
deleted file mode 100644
index 2851642b..00000000
--- a/codes/aaajiancai/15816333.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * 使用冒泡排序算法对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 外层循环控制排序的轮数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环负责两两相邻元素的比较和交换
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/aamphiprioninae/18302197.java b/codes/aamphiprioninae/18302197.java
deleted file mode 100644
index b0e91711..00000000
--- a/codes/aamphiprioninae/18302197.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i=0;ia[j+1]){
- int t=a[j];
- a[j+1]=a[j];
- a[j]=t;
- }
- }
- }
-
-} //end
diff --git a/codes/aas123/15713924.java b/codes/aas123/15713924.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/aas123/15713924.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/aass123/15720115.java b/codes/aass123/15720115.java
deleted file mode 100644
index d29bb658..00000000
--- a/codes/aass123/15720115.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
\ No newline at end of file
diff --git a/codes/aassdd/15775537.java b/codes/aassdd/15775537.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/aassdd/15775537.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/abaoge/15684921.java b/codes/abaoge/15684921.java
deleted file mode 100644
index 634b7859..00000000
--- a/codes/abaoge/15684921.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过不断比较相邻元素的大小，将较大的元素逐步“浮”到数组的末尾，从而实现排序。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环，控制比较轮数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环，负责相邻元素间的比较和交换
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/abaper/.keep b/codes/abaper/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/abaper/10978249.java b/codes/abaper/10978249.java
deleted file mode 100644
index 862a031b..00000000
--- a/codes/abaper/10978249.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int m=0 ; ma[q+1]) {
- int temp=a[q];
- a[q]=a[q+1];
- a[q+1]=temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/acc8226/15757227.java b/codes/acc8226/15757227.java
deleted file mode 100644
index 1c380514..00000000
--- a/codes/acc8226/15757227.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- *
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n) {
- int temp;
- for (int i = 1; i < n; i++) {
- for (int j = 0; j < n - i; j++) {
- if (a[j] > a[j + 1]) {
- temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
- // 你的代码，使无序数组 a 变得有序
-}
diff --git a/codes/achun123/15779154.java b/codes/achun123/15779154.java
deleted file mode 100644
index 00b60edf..00000000
--- a/codes/achun123/15779154.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数会对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素比后一个元素大，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/acloudio/11274672.java b/codes/acloudio/11274672.java
deleted file mode 100644
index 9e7534d4..00000000
--- a/codes/acloudio/11274672.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡 排序 函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-}//end
\ No newline at end of file
diff --git a/codes/activemy/14206633.java b/codes/activemy/14206633.java
deleted file mode 100644
index 002e3d16..00000000
--- a/codes/activemy/14206633.java
+++ /dev/null
@@ -1,28 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有
- if (0 >= n)
- {
- return;
- }
- int tmp,i,j;
- for (j=n-1; j>0; j--)
- {
- for (i=0; i a[i+1])
- {
- tmp = a[i+1];
- a[i+1] = a[i];
- a[i] = tmp;
- }
- }
- }
- return;
-
-} //end
diff --git a/codes/activity-school b/codes/activity-school
deleted file mode 160000
index bd6d5bad..00000000
--- a/codes/activity-school
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit bd6d5bad67914025676cec7abba5ef5da497f249
diff --git a/codes/adasdas34/.keep b/codes/adasdas34/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/adasdas34/15827500.java b/codes/adasdas34/15827500.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/adasdas34/15827500.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/addqian/14612723.java b/codes/addqian/14612723.java
deleted file mode 100644
index 3daf885d..00000000
--- a/codes/addqian/14612723.java
+++ /dev/null
@@ -1,24 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- int changeFlag;
- for (int i = 0; i < n - 1; i++) {
- changeFlag = 0;
- for (int j = 0; j < n - i - 1; ++j) {
- if (a[j] > a[j + 1]) {
- a[j] ^= a[j + 1];
- a[j + 1] ^= a[j];
- a[j] ^= a[j + 1];
- changeFlag = 1;
- }
- }
- if (changeFlag == 0) {
- break;
- }
- }
-} //end
-
diff --git a/codes/address/11226902.java b/codes/address/11226902.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/address/11226902.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/admin228855/10967397.java b/codes/admin228855/10967397.java
deleted file mode 100644
index deb24387..00000000
--- a/codes/admin228855/10967397.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i=0 ; ia[k+1]) {
- int temp=a[k];
- a[k]=a[k+1];
- a[k+1]=temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/adminuser/10040823.java b/codes/adminuser/10040823.java
deleted file mode 100644
index 272a12fc..00000000
--- a/codes/adminuser/10040823.java
+++ /dev/null
@@ -1,18 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- } //end
\ No newline at end of file
diff --git a/codes/adsf45362/.keep b/codes/adsf45362/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/adsf45362/15743460.java b/codes/adsf45362/15743460.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/adsf45362/15743460.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/af345sdga/.keep b/codes/af345sdga/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/af345sdga/15743439.java b/codes/af345sdga/15743439.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/af345sdga/15743439.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/afasfasf24214/.keep b/codes/afasfasf24214/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/afasfasf24214/15743480.java b/codes/afasfasf24214/15743480.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/afasfasf24214/15743480.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/afssaffc774/.keep b/codes/afssaffc774/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/afssaffc774/15831351.java b/codes/afssaffc774/15831351.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/afssaffc774/15831351.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/aikun66/15577937.java b/codes/aikun66/15577937.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/aikun66/15577937.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/airgege/.keep b/codes/airgege/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/airgege/15850162.java b/codes/airgege/15850162.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/airgege/15850162.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/aiyowei12366/.keep b/codes/aiyowei12366/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/aiyowei12366/15798748.java b/codes/aiyowei12366/15798748.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/aiyowei12366/15798748.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/alchemists/.keep b/codes/alchemists/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/alchemists/15772130.java b/codes/alchemists/15772130.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/alchemists/15772130.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/alleylyf666/.keep b/codes/alleylyf666/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/alleylyf666/15844554.java b/codes/alleylyf666/15844554.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/alleylyf666/15844554.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/amoxilin/15519580.java b/codes/amoxilin/15519580.java
deleted file mode 100644
index c2ba699c..00000000
--- a/codes/amoxilin/15519580.java
+++ /dev/null
@@ -1,12 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-}
diff --git a/codes/an629712562/.keep b/codes/an629712562/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/an629712562/15629207.java b/codes/an629712562/15629207.java
deleted file mode 100644
index 7a18dd82..00000000
--- a/codes/an629712562/15629207.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int an = 0; an < n - i - 1; an++) {
- if(a[an] > a[an + 1]) {
- int temp = a[an];
- a [an] = a[an + 1];
- a[an + 1] = temp;
- }
- }
- }
-
-
-} //end,an
\ No newline at end of file
diff --git a/codes/andng00/.keep b/codes/andng00/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/andng00/15836934.java b/codes/andng00/15836934.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/andng00/15836934.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/angel521/15721117.java b/codes/angel521/15721117.java
deleted file mode 100644
index 20575dc4..00000000
--- a/codes/angel521/15721117.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/anqi12301/15532075.java b/codes/anqi12301/15532075.java
deleted file mode 100644
index b9f3f205..00000000
--- a/codes/anqi12301/15532075.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/aqbodc/15816413.java b/codes/aqbodc/15816413.java
deleted file mode 100644
index 40ffda03..00000000
--- a/codes/aqbodc/15816413.java
+++ /dev/null
@@ -1,18 +0,0 @@
-public static void bubbleSort(int[] a,int n)
-{
- for(int i =0;i a[j])
- {
- int tmp = a[i];
- a[i] = a[j];
- a[j] = tmp;
- }
-
- }
-
- }
- return ;
-}
diff --git a/codes/argument/11235878.java b/codes/argument/11235878.java
deleted file mode 100644
index deb24387..00000000
--- a/codes/argument/11235878.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i=0 ; ia[k+1]) {
- int temp=a[k];
- a[k]=a[k+1];
- a[k+1]=temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/aria111/.keep b/codes/aria111/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/aria111/10043458.java b/codes/aria111/10043458.java
deleted file mode 100644
index 667eee0f..00000000
--- a/codes/aria111/10043458.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/arvinsblog/15525225.java b/codes/arvinsblog/15525225.java
deleted file mode 100644
index 20575dc4..00000000
--- a/codes/arvinsblog/15525225.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/as1234567890/.keep b/codes/as1234567890/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/as1234567890/10979740.java b/codes/as1234567890/10979740.java
deleted file mode 100644
index 9eccfac5..00000000
--- a/codes/as1234567890/10979740.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/asdafcv22/.keep b/codes/asdafcv22/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/asdafcv22/15742508.java b/codes/asdafcv22/15742508.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/asdafcv22/15742508.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/asen_1898/15541357.java b/codes/asen_1898/15541357.java
deleted file mode 100644
index ae82e695..00000000
--- a/codes/asen_1898/15541357.java
+++ /dev/null
@@ -1,35 +0,0 @@
-/**
-
- * 冒泡排序函数
-
- * aa bb cc
-
- * @param a 待排序的数组
-
- * @param n 待排序的数组长度
-
- */
-
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0; i < n-1 ; i++){
-
- for (int j = 0;j < n-1-i;j++){
-
- if(a[j] > a[j+1]){
-
- int temp = a[j];
-
- a[j] = a[j+1];
-
- a[j+1] = temp;
-
- }
-
- }
-
- }
-
-
-
-} //end
diff --git a/codes/asf1afasd4/.keep b/codes/asf1afasd4/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/asf1afasd4/15831471.java b/codes/asf1afasd4/15831471.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/asf1afasd4/15831471.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/asf424524sa/.keep b/codes/asf424524sa/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/asf424524sa/15830408.java b/codes/asf424524sa/15830408.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/asf424524sa/15830408.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/asf435adf/.keep b/codes/asf435adf/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/asf435adf/15743462.java b/codes/asf435adf/15743462.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/asf435adf/15743462.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/asfafas8931/.keep b/codes/asfafas8931/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/asfafas8931/15831378.java b/codes/asfafas8931/15831378.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/asfafas8931/15831378.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/asfasc228/.keep b/codes/asfasc228/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/asfasc228/15831133.java b/codes/asfasc228/15831133.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/asfasc228/15831133.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/asfasfa22/.keep b/codes/asfasfa22/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/asfasfa22/15742636.java b/codes/asfasfa22/15742636.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/asfasfa22/15742636.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/asfasfa22/15864908.java b/codes/asfasfa22/15864908.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/asfasfa22/15864908.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/asffasf67/.keep b/codes/asffasf67/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/asffasf67/15743465.java b/codes/asffasf67/15743465.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/asffasf67/15743465.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/asffsac224/.keep b/codes/asffsac224/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/asffsac224/15831080.java b/codes/asffsac224/15831080.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/asffsac224/15831080.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/asfsafaf223/.keep b/codes/asfsafaf223/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/asfsafaf223/15743410.java b/codes/asfsafaf223/15743410.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/asfsafaf223/15743410.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/asfsyw34124/.keep b/codes/asfsyw34124/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/asfsyw34124/15830756.java b/codes/asfsyw34124/15830756.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/asfsyw34124/15830756.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/aurorawhite/15775954.java b/codes/aurorawhite/15775954.java
deleted file mode 100644
index 059b69f4..00000000
--- a/codes/aurorawhite/15775954.java
+++ /dev/null
@@ -1,27 +0,0 @@
-/**
- * 冒泡排序函数
- * 将数组中的元素按照从小到大的顺序进行排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- // 标志位，表示这一趟是否有交换，优化冒泡排序性能
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素比后一个元素大，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换a[j]和a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 发生了交换，将标志位设为true
- swapped = true;
- }
- }
- // 如果在一趟排序中未发生交换，则说明数组已经有序，可以直接退出循环
- if (!swapped) {
- break;
- }
- }
-} //e
diff --git a/codes/aurorawhite03/15831384.java b/codes/aurorawhite03/15831384.java
deleted file mode 100644
index 84f1613b..00000000
--- a/codes/aurorawhite03/15831384.java
+++ /dev/null
@@ -1,27 +0,0 @@
-/**
- * 冒泡排序函数
- * 将数组中的元素按照从小到大的顺序进行排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- // 标志位，表示这一趟是否有交换，优化冒泡排序性能
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素比后一个元素大，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换a[j]和a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 发生了交换，将标志位设为true
- swapped = true;
- }
- }
- // 如果在一趟排序中未发生交换，则说明数组已经有序，可以直接退出循环
- if (!swapped) {
- break;
- }
- }
-} // end
diff --git a/codes/aurorawhite04/15837015.java b/codes/aurorawhite04/15837015.java
deleted file mode 100644
index 84f1613b..00000000
--- a/codes/aurorawhite04/15837015.java
+++ /dev/null
@@ -1,27 +0,0 @@
-/**
- * 冒泡排序函数
- * 将数组中的元素按照从小到大的顺序进行排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- // 标志位，表示这一趟是否有交换，优化冒泡排序性能
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素比后一个元素大，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换a[j]和a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 发生了交换，将标志位设为true
- swapped = true;
- }
- }
- // 如果在一趟排序中未发生交换，则说明数组已经有序，可以直接退出循环
- if (!swapped) {
- break;
- }
- }
-} // end
diff --git a/codes/avania/14344405.java b/codes/avania/14344405.java
deleted file mode 100644
index 6115f0ce..00000000
--- a/codes/avania/14344405.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n - 1; ++i) {
- for(int j = 0; j < n - i - 1; ++j){
- if(a[j] > a[j+1]){
- int k = a[j];
- a[j] = a[j+1];
- a[j+1] = k;
- }
- }
- }
-} //end
diff --git a/codes/aweige/.keep b/codes/aweige/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/aweige/15855036.java b/codes/aweige/15855036.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/aweige/15855036.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/azhen666/15569325.java b/codes/azhen666/15569325.java
deleted file mode 100644
index 8fa7ad57..00000000
--- a/codes/azhen666/15569325.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过重复地遍历要排序的数组，比较每对相邻的元素，并在必要时交换它们的位置，
- * 遍历数组的工作是重复地进行直到没有再需要交换，也就是说该数组已经排序完成。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制所有趟排序
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每一趟排序的比较和交换
- // 如果当前元素大于下一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/b1t333/12428176.java b/codes/b1t333/12428176.java
deleted file mode 100644
index 6a52fcd0..00000000
--- a/codes/b1t333/12428176.java
+++ /dev/null
@@ -1,36 +0,0 @@
-
-/*
- * SonarQube，开源软件质量管理工具。
- * 版权所有 (C) 2008-2013 SonarSource
- * mailto:contact AT sonarsource DOT com
- *
- * SonarQube 是免费软件；您可以重新分发它和/或
- * 根据 GNU Lesser General Public 的条款修改它
- * 由自由软件基金会发布的许可证；
- * 许可证的第 3 版，或（由您选择）任何更高版本。
- *
- * 分发 SonarQube 是为了希望它有用，
- * 但没有任何保证；甚至没有
- * 适销性或适用于特定目的的暗示保证。有关详细信息，请参阅 GNU
- * 宽松通用公共许可证。
- *
- * 您应该已经收到一份 GNU 宽松通用公共许可证的副本
- * 以及此程序；如果没有，请写信给自由软件基金会，
- * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA。
- */
- public static void bubbleSort(int [] a, int n)
- {
- for(int i = 0; i < n - 1; i ++)
- {
- for(int j = 0; j < n - 1 - i; j++)
- {
- if(a[j] > a[j+1])
- {
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
- }
-
diff --git a/codes/b2247960736/15520708.java b/codes/b2247960736/15520708.java
deleted file mode 100644
index 72e12e15..00000000
--- a/codes/b2247960736/15520708.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制需要遍历的轮数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮中相邻元素的比较
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/bIU999lve/.keep b/codes/bIU999lve/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/bIU999lve/11090549.java b/codes/bIU999lve/11090549.java
deleted file mode 100644
index 29d27043..00000000
--- a/codes/bIU999lve/11090549.java
+++ /dev/null
@@ -1,23 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n-1; i++) {
- for (int j = 0; j < n-1-i; j++) {
- if (a[j] >= a[j+1]) {
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
- System.out.print("冒泡排序的结果是： ");
- for (int i : a) {
- System.out.print(i + " ");
- }
-} //end
\ No newline at end of file
diff --git a/codes/babala/15779520.java b/codes/babala/15779520.java
deleted file mode 100644
index 7cda69ae..00000000
--- a/codes/babala/15779520.java
+++ /dev/null
@@ -1,27 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组a进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- // 标志位，表示这一趟排序是否有数据交换
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 发生了交换，标志位设为true
- swapped = true;
- }
- }
- // 如果这一趟排序没有发生交换，说明数组已经有序，直接退出循环
- if (!swapped) {
- break;
- }
- }
-} // end
diff --git a/codes/babale/15775745.java b/codes/babale/15775745.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/babale/15775745.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/baiwenyu/.15781013.java.swp b/codes/baiwenyu/.15781013.java.swp
deleted file mode 100644
index acd64f622bb827a02e69114f27e1f7a9b80b4984..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001
literal 12288
zcmeI1zi-n(6vwYfY!oUgF)>_%R3#)$;#7r5X(m`0n5r_g>foeydX8g9@i`F6kAd7I9he#T3y>hc%F>w$-nmW{>ZVBDD!r4w&v)z
zu3WlI6OkB!(ML%3N1y6DdWuxe5>hlxF5LecY}{7Q4VR{EDX!-9Yq7Y_q+(*+lXgoK
zjLI3#N{p8Wt<1D(>d}ljrC8Cl%&sa%*^WxX=Mz#)8j5IgN%oXL2NFO62O(f{buiI8
zHWZhfPyLMFNBd8X9i$TGAOR$R1dsp{Kmter2_OL^a7YR8LJzqOy&rM=@9ADnXs!!p8Z7wgh
zD(`A*uj>z=)$dnpYZY+T*5>Pv=C(u4m$Qw9C-n!<8%vd1yN%8p?sVb6bdgR>rkrJ@
zBnuYpE_1k)Og2UHGBX0B9L|%aaxptG>0)uVibmWV
fMZA5^&1T@hVK{CW4jU$JIHSv!MK6d4O=rkoX`3dX
diff --git a/codes/baiwenyu/15781013.java b/codes/baiwenyu/15781013.java
deleted file mode 100644
index cac0dcf1..00000000
--- a/codes/baiwenyu/15781013.java
+++ /dev/null
@@ -1,28 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- if (n <= 1) return; // 如果数组长度小于等于1，不需要排序
-
- boolean swapped;
- for (int i = 0; i < n - 1; i++) {
- swapped = false;
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换a[j]和a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- swapped = true;
- }
- }
- // 如果这一轮没有发生交换，说明数组已经有序，退出排序
- if (!swapped) {
- break;
- }
- }
-} //end
-
diff --git a/codes/baixiaobai/15198492.java b/codes/baixiaobai/15198492.java
deleted file mode 100644
index e9ed4eae..00000000
--- a/codes/baixiaobai/15198492.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n) {
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] < a[j + 1]) {
- continue;
- }
- // 如果前一个元素比后一个元素大，则交换两者
- int temp = a[j + 1];
- a[j + 1] = a[j];
- a[j] = temp;
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/baixiaobai/15198733.java b/codes/baixiaobai/15198733.java
deleted file mode 100644
index e9ed4eae..00000000
--- a/codes/baixiaobai/15198733.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n) {
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] < a[j + 1]) {
- continue;
- }
- // 如果前一个元素比后一个元素大，则交换两者
- int temp = a[j + 1];
- a[j + 1] = a[j];
- a[j] = temp;
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/baixiaobai/15198745.java b/codes/baixiaobai/15198745.java
deleted file mode 100644
index e9ed4eae..00000000
--- a/codes/baixiaobai/15198745.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n) {
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] < a[j + 1]) {
- continue;
- }
- // 如果前一个元素比后一个元素大，则交换两者
- int temp = a[j + 1];
- a[j + 1] = a[j];
- a[j] = temp;
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/baixiaobai/15199487.java b/codes/baixiaobai/15199487.java
deleted file mode 100644
index e9ed4eae..00000000
--- a/codes/baixiaobai/15199487.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n) {
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] < a[j + 1]) {
- continue;
- }
- // 如果前一个元素比后一个元素大，则交换两者
- int temp = a[j + 1];
- a[j + 1] = a[j];
- a[j] = temp;
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/banlala/15846317.java b/codes/banlala/15846317.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/banlala/15846317.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/baozhang/.keep b/codes/baozhang/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/baozhang/15860610.java b/codes/baozhang/15860610.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/baozhang/15860610.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/bbb222/.keep b/codes/bbb222/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/bbb222/15831163.java b/codes/bbb222/15831163.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/bbb222/15831163.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/bbswangzhs/.keep b/codes/bbswangzhs/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/bbswangzhs/15844812.java b/codes/bbswangzhs/15844812.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/bbswangzhs/15844812.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/bc521bc/9954342.java b/codes/bc521bc/9954342.java
deleted file mode 100644
index 82b73c8f..00000000
--- a/codes/bc521bc/9954342.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-} //end
-
diff --git a/codes/bc99991/11118867.java b/codes/bc99991/11118867.java
deleted file mode 100644
index 9e7534d4..00000000
--- a/codes/bc99991/11118867.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡 排序 函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-}//end
\ No newline at end of file
diff --git a/codes/beaker123/15831015.java b/codes/beaker123/15831015.java
deleted file mode 100644
index ab692454..00000000
--- a/codes/beaker123/15831015.java
+++ /dev/null
@@ -1,29 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过重复地遍历待排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。
- * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。
- * 这个算法的名字由来是因为越小的元素会经由交换慢慢“浮”到数列的顶端。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- // 标志位，表示这一趟是否有交换，优化冒泡排序性能
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 表示有数据交换，即这一趟排序有意义
- swapped = true;
- }
- }
- // 如果没有数据交换，说明已经有序，可以提前退出循环
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/beaker1234/15831394.java b/codes/beaker1234/15831394.java
deleted file mode 100644
index ab692454..00000000
--- a/codes/beaker1234/15831394.java
+++ /dev/null
@@ -1,29 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过重复地遍历待排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。
- * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。
- * 这个算法的名字由来是因为越小的元素会经由交换慢慢“浮”到数列的顶端。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- // 标志位，表示这一趟是否有交换，优化冒泡排序性能
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 表示有数据交换，即这一趟排序有意义
- swapped = true;
- }
- }
- // 如果没有数据交换，说明已经有序，可以提前退出循环
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/bei123/15714125.java b/codes/bei123/15714125.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/bei123/15714125.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/beibeiya/15775215.java b/codes/beibeiya/15775215.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/beibeiya/15775215.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/beiyang/.keep b/codes/beiyang/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/beiyang/15851229.java b/codes/beiyang/15851229.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/beiyang/15851229.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/benben/15721436.java b/codes/benben/15721436.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/benben/15721436.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/bertao/11204465.java b/codes/bertao/11204465.java
deleted file mode 100644
index 25d28ba4..00000000
--- a/codes/bertao/11204465.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/bic-omg/.keep b/codes/bic-omg/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/bic-omg/10972075.java b/codes/bic-omg/10972075.java
deleted file mode 100644
index c93923d8..00000000
--- a/codes/bic-omg/10972075.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/biechigege/18629854.java b/codes/biechigege/18629854.java
deleted file mode 100644
index a11ecc45..00000000
--- a/codes/biechigege/18629854.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
-
- }
-
- }
- } //end
diff --git a/codes/biechigege/18653461.java b/codes/biechigege/18653461.java
deleted file mode 100644
index 2b6ee3e9..00000000
--- a/codes/biechigege/18653461.java
+++ /dev/null
@@ -1,19 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] a, int n) {
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
-
- } //end
- }
- }
diff --git a/codes/bigDog/11298506.java b/codes/bigDog/11298506.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/bigDog/11298506.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/bitexplorers/.keep b/codes/bitexplorers/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/bitexplorers/15774316.java b/codes/bitexplorers/15774316.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/bitexplorers/15774316.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/bjfuhyk26/15775960.java b/codes/bjfuhyk26/15775960.java
deleted file mode 100644
index 46da388e..00000000
--- a/codes/bjfuhyk26/15775960.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过对相邻元素的比较和交换，将较大的元素逐渐“浮”到数组的末尾，从而完成排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每趟排序多少次
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/blackgaryc/14345942.java b/codes/blackgaryc/14345942.java
deleted file mode 100644
index 3db39fd1..00000000
--- a/codes/blackgaryc/14345942.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果前面的元素大于后面的元素，交换它们
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/bless_qian/15628082.java b/codes/bless_qian/15628082.java
deleted file mode 100644
index f1b0ff61..00000000
--- a/codes/bless_qian/15628082.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 将数组a从小到大进行排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < n - i -1; j++) {
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
-
diff --git a/codes/blingpotato/15623762.java b/codes/blingpotato/15623762.java
deleted file mode 100644
index 6bdd05fc..00000000
--- a/codes/blingpotato/15623762.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素之间的比较和交换，将数组排序为升序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序的趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一趟排序多少次
- if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们的位置
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/blockup/15585762.java b/codes/blockup/15585762.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/blockup/15585762.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/bmyy111/15635777.java b/codes/bmyy111/15635777.java
deleted file mode 100644
index 04625a49..00000000
--- a/codes/bmyy111/15635777.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-} //end
-
diff --git a/codes/book123/15699999.java b/codes/book123/15699999.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/book123/15699999.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/bopiox/11219150.java b/codes/bopiox/11219150.java
deleted file mode 100644
index cacd12f1..00000000
--- a/codes/bopiox/11219150.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- a[j] = a[j]+a[j+1];
- a[j+1] = a[j]-a[j+1];
- a[j] = a[j]-a[j+1];
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/bowen123456/.keep b/codes/bowen123456/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/bowen123456/15815214.java b/codes/bowen123456/15815214.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/bowen123456/15815214.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/buaa562/15843584.java b/codes/buaa562/15843584.java
deleted file mode 100644
index 9b1c6dfe..00000000
--- a/codes/buaa562/15843584.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过重复地遍历待排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。
- * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/budasan/11121691.java b/codes/budasan/11121691.java
deleted file mode 100644
index 24b49b4b..00000000
--- a/codes/budasan/11121691.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/buffoZipper/.keep b/codes/buffoZipper/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/buffoZipper/15842330.java b/codes/buffoZipper/15842330.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/buffoZipper/15842330.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/buhuiruner/.keep b/codes/buhuiruner/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/buhuiruner/15842260.java b/codes/buhuiruner/15842260.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/buhuiruner/15842260.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/buhuizhiyuqianduan/11245496.java b/codes/buhuizhiyuqianduan/11245496.java
deleted file mode 100644
index 6da7a74f..00000000
--- a/codes/buhuizhiyuqianduan/11245496.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (arr[j] > arr[j + 1]) {
- int temp = arr[j];
- arr[j] = arr[j+1];
- arr[j+1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/bujin521/11301842.java b/codes/bujin521/11301842.java
deleted file mode 100644
index 24b49b4b..00000000
--- a/codes/bujin521/11301842.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/bundle/11196164.java b/codes/bundle/11196164.java
deleted file mode 100644
index 661499fc..00000000
--- a/codes/bundle/11196164.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
diff --git a/codes/bupiovm0101/11122657.java b/codes/bupiovm0101/11122657.java
deleted file mode 100644
index 4d7083fe..00000000
--- a/codes/bupiovm0101/11122657.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int i, j;
-
- for(i=0; ia[j]){
- int temp;
- temp = a[j-1];
- a[j-1] = a[j];
- a[j] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/bushioo/11276443.java b/codes/bushioo/11276443.java
deleted file mode 100644
index 4d7083fe..00000000
--- a/codes/bushioo/11276443.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int i, j;
-
- for(i=0; ia[j]){
- int temp;
- temp = a[j-1];
- a[j-1] = a[j];
- a[j] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/buzhidao/11118686.java b/codes/buzhidao/11118686.java
deleted file mode 100644
index 8d589d7e..00000000
--- a/codes/buzhidao/11118686.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a,int n){
- int temp =0;
- for(int i = 0;ia[j+1]){
- temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-
-
-}
\ No newline at end of file
diff --git a/codes/bzy-080408/18668050.java b/codes/bzy-080408/18668050.java
deleted file mode 100644
index ca63d27d..00000000
--- a/codes/bzy-080408/18668050.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] a, int n) {
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
-
- } //end
- }
- }
-
diff --git a/codes/c1444444444/15811953.java b/codes/c1444444444/15811953.java
deleted file mode 100644
index 166dea5d..00000000
--- a/codes/c1444444444/15811953.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数通过冒泡排序算法对数组进行排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮的比较次数
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/c1484941716/15859323.java b/codes/c1484941716/15859323.java
deleted file mode 100644
index 271d2f1d..00000000
--- a/codes/c1484941716/15859323.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 将数组a按照从小到大的顺序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- // 交换a[j]和a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/ca3130049622/15790269.java b/codes/ca3130049622/15790269.java
deleted file mode 100644
index 74623af6..00000000
--- a/codes/ca3130049622/15790269.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过比较相邻的元素，如果顺序错误则交换它们的位置，遍历数组的工作是重复地进行直到没有再需要交换，也就是说该数组已经排序完成。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环，控制比较次数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环，实际比较和交换
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/cai0002/15520914.java b/codes/cai0002/15520914.java
deleted file mode 100644
index 808f5412..00000000
--- a/codes/cai0002/15520914.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 遍历数组，比较相邻元素，将较大的元素交换到数组的末尾，重复直到整个数组有序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/cai001/15520883.java b/codes/cai001/15520883.java
deleted file mode 100644
index 808f5412..00000000
--- a/codes/cai001/15520883.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 遍历数组，比较相邻元素，将较大的元素交换到数组的末尾，重复直到整个数组有序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/caishen/.keep b/codes/caishen/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/caishen/15856729.java b/codes/caishen/15856729.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/caishen/15856729.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/caiyanghong/15835895.java b/codes/caiyanghong/15835895.java
deleted file mode 100644
index ae82e695..00000000
--- a/codes/caiyanghong/15835895.java
+++ /dev/null
@@ -1,35 +0,0 @@
-/**
-
- * 冒泡排序函数
-
- * aa bb cc
-
- * @param a 待排序的数组
-
- * @param n 待排序的数组长度
-
- */
-
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0; i < n-1 ; i++){
-
- for (int j = 0;j < n-1-i;j++){
-
- if(a[j] > a[j+1]){
-
- int temp = a[j];
-
- a[j] = a[j+1];
-
- a[j+1] = temp;
-
- }
-
- }
-
- }
-
-
-
-} //end
diff --git a/codes/caizengming/15396209.java b/codes/caizengming/15396209.java
deleted file mode 100644
index c583260d..00000000
--- a/codes/caizengming/15396209.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
-
- for(int i = 0 ; i < n; i ++) {
- for (int j = 0 ; j < n - i -1 ; j ++ ){
-
- if(a[j] > a[j +1]){
- int temp = a[j];
- a[j] = a[j +1];
- a[j + 1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/caozhou/10869186.java b/codes/caozhou/10869186.java
deleted file mode 100644
index 0551a31e..00000000
--- a/codes/caozhou/10869186.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-}
diff --git a/codes/captaining/15614511.java b/codes/captaining/15614511.java
deleted file mode 100644
index 86d776a4..00000000
--- a/codes/captaining/15614511.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素两两比较并交换，使得每一轮循环后最大（或最小）的元素“冒泡”到数组的末尾
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序的轮数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮需要比较的次数
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/carino5555/15527193.java b/codes/carino5555/15527193.java
deleted file mode 100644
index fe1a0c28..00000000
--- a/codes/carino5555/15527193.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组a进行冒泡排序，使其变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/caroline/15374117.java b/codes/caroline/15374117.java
deleted file mode 100644
index 9c77b43d..00000000
--- a/codes/caroline/15374117.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i=0;ia[j+1])
- {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/cccqqq/.keep b/codes/cccqqq/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/cccqqq/10039861.java b/codes/cccqqq/10039861.java
deleted file mode 100644
index b1803765..00000000
--- a/codes/cccqqq/10039861.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/* 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/ccone123/15713748.java b/codes/ccone123/15713748.java
deleted file mode 100644
index 854beb62..00000000
--- a/codes/ccone123/15713748.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
-
diff --git a/codes/ccout0/12264632.java b/codes/ccout0/12264632.java
deleted file mode 100644
index 998bc63e..00000000
--- a/codes/ccout0/12264632.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = n; i > 0; i--) {
- boolean isOrderly = true;
- for (int j = 0; j < i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int t = a[j];
- a[j] = a[j + 1];
- a[j + 1] = t;
- isOrderly = false;
- }
- }
- if (isOrderly) {
- break;
- }
- }
-}
diff --git a/codes/cenm00/15829376.java b/codes/cenm00/15829376.java
deleted file mode 100644
index b962b73e..00000000
--- a/codes/cenm00/15829376.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组a进行冒泡排序，将其变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环，控制比较的轮数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环，控制每轮比较的次数
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/ceshi001/.keep b/codes/ceshi001/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/ceshi001/9637800.java b/codes/ceshi001/9637800.java
deleted file mode 100644
index 4dbc2659..00000000
--- a/codes/ceshi001/9637800.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- *
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 你的代码，使无序数组 a 变得有序
- int i, j;
- for (i = 0; i < n; i++) {//表示n次排序过程。
- for (j = 1; j < n - i; j++) {
- if (a[j - 1] > a[j]) {//前面的数字大于后面的数字就交换
- //交换a[j-1]和a[j]
- int temp;
- temp = a[j - 1];
- a[j - 1] = a[j];
- a[j] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/cghg547546/.keep b/codes/cghg547546/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/cghg547546/15743428.java b/codes/cghg547546/15743428.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/cghg547546/15743428.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/changgeng/16563760.java b/codes/changgeng/16563760.java
deleted file mode 100644
index 8527e1c6..00000000
--- a/codes/changgeng/16563760.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
-
diff --git a/codes/chanziruu/.keep b/codes/chanziruu/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/chanziruu/10042211.java b/codes/chanziruu/10042211.java
deleted file mode 100644
index 667eee0f..00000000
--- a/codes/chanziruu/10042211.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/chase11/15577508.java b/codes/chase11/15577508.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/chase11/15577508.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/chenabing/15724269.java b/codes/chenabing/15724269.java
deleted file mode 100644
index c8f31c95..00000000
--- a/codes/chenabing/15724269.java
+++ /dev/null
@@ -1,13 +0,0 @@
-public static void bubbleSort(int []a,int n){
- int length = n;
- for(int i=0;ia[j+1]){
- int temp = a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
-
- }
- }
-}
diff --git a/codes/chenchen1234/15630722.java b/codes/chenchen1234/15630722.java
deleted file mode 100644
index 0028b5a0..00000000
--- a/codes/chenchen1234/15630722.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。
- * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换他们的位置
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/chency/15542287.java b/codes/chency/15542287.java
deleted file mode 100644
index f1865716..00000000
--- a/codes/chency/15542287.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素之间的比较和交换，使得每一轮比较后最大（或最小）的元素能够“冒泡”到数组的末尾。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制需要比较的次数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮比较的次数
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/chengchen/10039151.java b/codes/chengchen/10039151.java
deleted file mode 100644
index fce1e8fc..00000000
--- a/codes/chengchen/10039151.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-} //end
diff --git a/codes/chengqi/.keep b/codes/chengqi/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/chengqi/15845978.java b/codes/chengqi/15845978.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/chengqi/15845978.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/chengzhi/11005917.java b/codes/chengzhi/11005917.java
deleted file mode 100644
index 661499fc..00000000
--- a/codes/chengzhi/11005917.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
diff --git a/codes/chenhan1129/15542140.java b/codes/chenhan1129/15542140.java
deleted file mode 100644
index 2c70a5f0..00000000
--- a/codes/chenhan1129/15542140.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数使用冒泡排序算法对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 外层循环，控制排序趟数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环，控制每趟排序多少次
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果当前元素大于下一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/chenqiuyun/15860178.java b/codes/chenqiuyun/15860178.java
deleted file mode 100644
index ae82e695..00000000
--- a/codes/chenqiuyun/15860178.java
+++ /dev/null
@@ -1,35 +0,0 @@
-/**
-
- * 冒泡排序函数
-
- * aa bb cc
-
- * @param a 待排序的数组
-
- * @param n 待排序的数组长度
-
- */
-
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0; i < n-1 ; i++){
-
- for (int j = 0;j < n-1-i;j++){
-
- if(a[j] > a[j+1]){
-
- int temp = a[j];
-
- a[j] = a[j+1];
-
- a[j+1] = temp;
-
- }
-
- }
-
- }
-
-
-
-} //end
diff --git a/codes/chenwy/15816299.java b/codes/chenwy/15816299.java
deleted file mode 100644
index 0f8ae249..00000000
--- a/codes/chenwy/15816299.java
+++ /dev/null
@@ -1,19 +0,0 @@
-
-/**
- * 冒泡排序函数
- * 使用冒泡排序算法对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/chenyongru/.keep b/codes/chenyongru/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/chenyongru/15764377.java b/codes/chenyongru/15764377.java
deleted file mode 100644
index d40803fb..00000000
--- a/codes/chenyongru/15764377.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/chenyunhao/15874841.java b/codes/chenyunhao/15874841.java
deleted file mode 100644
index ae82e695..00000000
--- a/codes/chenyunhao/15874841.java
+++ /dev/null
@@ -1,35 +0,0 @@
-/**
-
- * 冒泡排序函数
-
- * aa bb cc
-
- * @param a 待排序的数组
-
- * @param n 待排序的数组长度
-
- */
-
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0; i < n-1 ; i++){
-
- for (int j = 0;j < n-1-i;j++){
-
- if(a[j] > a[j+1]){
-
- int temp = a[j];
-
- a[j] = a[j+1];
-
- a[j+1] = temp;
-
- }
-
- }
-
- }
-
-
-
-} //end
diff --git a/codes/chenzhongyao/15851007.java b/codes/chenzhongyao/15851007.java
deleted file mode 100644
index ae82e695..00000000
--- a/codes/chenzhongyao/15851007.java
+++ /dev/null
@@ -1,35 +0,0 @@
-/**
-
- * 冒泡排序函数
-
- * aa bb cc
-
- * @param a 待排序的数组
-
- * @param n 待排序的数组长度
-
- */
-
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0; i < n-1 ; i++){
-
- for (int j = 0;j < n-1-i;j++){
-
- if(a[j] > a[j+1]){
-
- int temp = a[j];
-
- a[j] = a[j+1];
-
- a[j+1] = temp;
-
- }
-
- }
-
- }
-
-
-
-} //end
diff --git a/codes/cherryaini/.keep b/codes/cherryaini/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/cherryaini/15838357.java b/codes/cherryaini/15838357.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/cherryaini/15838357.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/cherrypocky/15837631.java b/codes/cherrypocky/15837631.java
deleted file mode 100644
index 24f513b3..00000000
--- a/codes/cherrypocky/15837631.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/chnechenya/15815769.java b/codes/chnechenya/15815769.java
deleted file mode 100644
index 54c5f386..00000000
--- a/codes/chnechenya/15815769.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
\ No newline at end of file
diff --git a/codes/chris2024/15600397.java b/codes/chris2024/15600397.java
deleted file mode 100644
index 2252b818..00000000
--- a/codes/chris2024/15600397.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/chuyuxuan/15685256.java b/codes/chuyuxuan/15685256.java
deleted file mode 100644
index 137560e5..00000000
--- a/codes/chuyuxuan/15685256.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过多次遍历数组，比较相邻元素的大小，并交换它们的位置，
- * 直到没有需要交换的元素为止，从而使得数组有序。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制遍历次数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每次遍历比较的次数
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/cieasefires/.keep b/codes/cieasefires/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/cieasefires/15844532.java b/codes/cieasefires/15844532.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/cieasefires/15844532.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/ckx1234/15830693.java b/codes/ckx1234/15830693.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/ckx1234/15830693.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/ckx17837725358/15859776.java b/codes/ckx17837725358/15859776.java
deleted file mode 100644
index 271d2f1d..00000000
--- a/codes/ckx17837725358/15859776.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 将数组a按照从小到大的顺序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- // 交换a[j]和a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/clausliang/11466217.java b/codes/clausliang/11466217.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/clausliang/11466217.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/cloudchasers/.keep b/codes/cloudchasers/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/cloudchasers/15772624.java b/codes/cloudchasers/15772624.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/cloudchasers/15772624.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/cly2589/15577808.java b/codes/cly2589/15577808.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/cly2589/15577808.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/cmosinverter/15780363.java b/codes/cmosinverter/15780363.java
deleted file mode 100644
index c8198005..00000000
--- a/codes/cmosinverter/15780363.java
+++ /dev/null
@@ -1,28 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- if (n <= 1) return; // 如果数组长度小于等于1，不需要排序
-
- boolean swapped;
- for (int i = 0; i < n - 1; i++) {
- swapped = false;
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换a[j]和a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- swapped = true;
- }
- }
- // 如果这一轮没有发生交换，说明数组已经有序，退出排序
- if (!swapped) {
- break;
- }
- }
-} //end
-
diff --git a/codes/coco08/11244510.java b/codes/coco08/11244510.java
deleted file mode 100644
index 4d7083fe..00000000
--- a/codes/coco08/11244510.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int i, j;
-
- for(i=0; ia[j]){
- int temp;
- temp = a[j-1];
- a[j-1] = a[j];
- a[j] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/codeelite/.keep b/codes/codeelite/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/codeelite/15774516.java b/codes/codeelite/15774516.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/codeelite/15774516.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/codemovers/.keep b/codes/codemovers/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/codemovers/15776343.java b/codes/codemovers/15776343.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/codemovers/15776343.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/codeshallow/.java b/codes/codeshallow/.java
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/codeshallow/9947400.java b/codes/codeshallow/9947400.java
deleted file mode 100644
index 10dbc652..00000000
--- a/codes/codeshallow/9947400.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-} //end
diff --git a/codes/comTom/10859102.java b/codes/comTom/10859102.java
deleted file mode 100644
index ab3d8f39..00000000
--- a/codes/comTom/10859102.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/comefly/16334983.java b/codes/comefly/16334983.java
deleted file mode 100644
index 94c35a66..00000000
--- a/codes/comefly/16334983.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/conanz/.keep b/codes/conanz/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/conanz/10041693.java b/codes/conanz/10041693.java
deleted file mode 100644
index 667eee0f..00000000
--- a/codes/conanz/10041693.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/coo6666/11212756.java b/codes/coo6666/11212756.java
deleted file mode 100644
index b9bf7818..00000000
--- a/codes/coo6666/11212756.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/coolbob/11342463.java b/codes/coolbob/11342463.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/coolbob/11342463.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/coreliu/9889405.java b/codes/coreliu/9889405.java
deleted file mode 100644
index 661499fc..00000000
--- a/codes/coreliu/9889405.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
diff --git a/codes/coshpr/18429589.java b/codes/coshpr/18429589.java
deleted file mode 100644
index 2ff38650..00000000
--- a/codes/coshpr/18429589.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- a[j] = a[j]+a[j+1];
- a[j+1] = a[j]-a[j+1];
- a[j] = a[j]-a[j+1];
- }
- }
- }
-} //end
diff --git a/codes/course/15530455.java b/codes/course/15530455.java
deleted file mode 100644
index 61c422b6..00000000
--- a/codes/course/15530455.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/cppdkuo/11329887.java b/codes/cppdkuo/11329887.java
deleted file mode 100644
index 8c505501..00000000
--- a/codes/cppdkuo/11329887.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;i a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/cr12345/.keep b/codes/cr12345/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/cr12345/10985032.java b/codes/cr12345/10985032.java
deleted file mode 100644
index ecc6b910..00000000
--- a/codes/cr12345/10985032.java
+++ /dev/null
@@ -1,12 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
-
diff --git a/codes/craftsmen/.keep b/codes/craftsmen/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/craftsmen/15775673.java b/codes/craftsmen/15775673.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/craftsmen/15775673.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/credit/15777503.java b/codes/credit/15777503.java
deleted file mode 100644
index a73834e9..00000000
--- a/codes/credit/15777503.java
+++ /dev/null
@@ -1,26 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素之间的比较和交换，将无序数组变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- // 标记变量，用于优化，如果在一趟排序中没有交换，则数组已经有序
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 发生了交换，将标记设为true
- swapped = true;
- }
- }
- // 如果在内层循环中没有发生交换，则数组已经有序，提前退出
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/crh111/15562582.java b/codes/crh111/15562582.java
deleted file mode 100644
index 25b3bbe4..00000000
--- a/codes/crh111/15562582.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/cslearn/10428388.java b/codes/cslearn/10428388.java
deleted file mode 100644
index 5ba81a6b..00000000
--- a/codes/cslearn/10428388.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n - 1; i++) {
-
- for(int j = 0; j < n - 1 - i; j++) {
-
- if(a[j] > a[j+1]) {
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/cstzt6/15454369.java b/codes/cstzt6/15454369.java
deleted file mode 100644
index 4005b9a5..00000000
--- a/codes/cstzt6/15454369.java
+++ /dev/null
@@ -1,13 +0,0 @@
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-}
diff --git a/codes/cstzt6/16340693.java b/codes/cstzt6/16340693.java
deleted file mode 100644
index 4005b9a5..00000000
--- a/codes/cstzt6/16340693.java
+++ /dev/null
@@ -1,13 +0,0 @@
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-}
diff --git a/codes/cumtsgw/.15377867.java.swp b/codes/cumtsgw/.15377867.java.swp
deleted file mode 100644
index 50eed755d8becbd73a565f065816f9970304c3ea..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001
literal 12288
zcmeI1PiqrF7{;ewOSRZuyuI2>o0v{wH7TTu;K_q0sfU&vW;Yu%F`JFaCL&TqsEVK#
z0<|K75y7+QtugKA&~tW!C%=FP-`)JNG^K~$BG16H@6P0zXI_4g!>~sD&dpo2ycice
zrh`Xs7>|XhIF37*A6NBSEtia&m-9KhlFucx<)peFzqdBBMdlsblFD>-UAqrsRWt86
zMQJ)&t18W!?N;wTkclfxsnl{ZwOCMfHIje@5CDOb6PQ|Ex|9h2>T?&))6Ch`lSg4E
z2!H?xfB*=900@8p2!O!Y5pc^Bg0K4GRKN4tew{c}`%@GU009sH0T2KI5C8!X009sH
z0T2LzF(ja}LVTDKV)8UM&)@$C_y0d~@dzKm%f|3+bawPg
zu&UMz6s1Ilu99on<+KPE4-Ym4hJp8JlP=-(A)vn)E-1l+MEB@-O*VxYKBp?ZaWn>>}owj>LLaGl@_@1
zh-A_AvZ^SX+w}IH`mY a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/current/11226352.java b/codes/current/11226352.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/current/11226352.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/cursor/.java b/codes/cursor/.java
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/cursor/13859449.java b/codes/cursor/13859449.java
deleted file mode 100644
index 6fbfba63..00000000
--- a/codes/cursor/13859449.java
+++ /dev/null
@@ -1,33 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- if (n <= 1) {
- return;
- }
-
- for (int i = 0; i < n; i++) {
- // 提前退出冒泡循环的标志位
- boolean flag = false;
-
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) { // 将相邻元素进行比较
- // 交换相邻元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 设置标志位为true
- flag = true;
- }
- }
-
- if (!flag) { // 如果一次冒泡循环中没有发生交换，则说明数组已经有序，直接退出循环
- break;
- }
- }
-
-} //end
diff --git a/codes/cwt1216/15777958.java b/codes/cwt1216/15777958.java
deleted file mode 100644
index 81aa6d0a..00000000
--- a/codes/cwt1216/15777958.java
+++ /dev/null
@@ -1,28 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过重复地遍历待排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。
- * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。
- * 这个算法的名字由来是因为越小的元素会经由交换慢慢“浮”到数列的顶端。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- // 标记是否有交换发生，用于提前结束循环
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果当前元素大于下一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 发生了交换，标记为true
- swapped = true;
- }
- }
- // 如果在内层循环中没有发生交换，则数组已经有序，可以提前结束
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/cxy11/15898495.java b/codes/cxy11/15898495.java
deleted file mode 100644
index 3738ab94..00000000
--- a/codes/cxy11/15898495.java
+++ /dev/null
@@ -1,12 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/cxy2801439718/15898495.java b/codes/cxy2801439718/15898495.java
deleted file mode 100644
index 90127cbc..00000000
--- a/codes/cxy2801439718/15898495.java
+++ /dev/null
@@ -1,12 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-}
diff --git a/codes/cyanide/15311596.java b/codes/cyanide/15311596.java
deleted file mode 100644
index 2b9ca2cf..00000000
--- a/codes/cyanide/15311596.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] arr, int n){
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(arr[j] > arr[j + 1]) {
- int temp = arr[j];
- arr [j] = arr[j + 1];
- arr[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/cybernexuss/.keep b/codes/cybernexuss/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/cybernexuss/15776044.java b/codes/cybernexuss/15776044.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/cybernexuss/15776044.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/cyberwarriors/.keep b/codes/cyberwarriors/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/cyberwarriors/15771923.java b/codes/cyberwarriors/15771923.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/cyberwarriors/15771923.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/cyc991026/.keep b/codes/cyc991026/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/cyc991026/10042475.java b/codes/cyc991026/10042475.java
deleted file mode 100644
index 667eee0f..00000000
--- a/codes/cyc991026/10042475.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/cyqlxxy/15777955.java b/codes/cyqlxxy/15777955.java
deleted file mode 100644
index 2252b818..00000000
--- a/codes/cyqlxxy/15777955.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/cyrusyu/11179070.java b/codes/cyrusyu/11179070.java
deleted file mode 100644
index 183c2516..00000000
--- a/codes/cyrusyu/11179070.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
-
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-}//end
-
diff --git a/codes/dabing/.keep b/codes/dabing/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/dabing/15831131.java b/codes/dabing/15831131.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/dabing/15831131.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/daisyw0221/15531109.java b/codes/daisyw0221/15531109.java
deleted file mode 100644
index 09f809e4..00000000
--- a/codes/daisyw0221/15531109.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
-
diff --git a/codes/damingya/15777770.java b/codes/damingya/15777770.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/damingya/15777770.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/dappwwww/10999016.java b/codes/dappwwww/10999016.java
deleted file mode 100644
index d34027fa..00000000
--- a/codes/dappwwww/10999016.java
+++ /dev/null
@@ -1,27 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- if(a == null || a.length == 0){
- return;
- }
- for(int i = 0; i< n; i++){
- boolean flag = true;
- for(int j = 0; j< n - i - 1 ; j++){
- if(a[j]> a[j+1]){
- int tmp = a[j];
- a[j] = a[j+1];
- a[j+1] = tmp;
- flag = false;
- }
- }
- if(flag){
- break;
- }
-
- }
-} //end
\ No newline at end of file
diff --git a/codes/darkfu/15693973.java b/codes/darkfu/15693973.java
deleted file mode 100644
index 3ca2d28e..00000000
--- a/codes/darkfu/15693973.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 使用冒泡法对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制遍历次数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环用来比较相邻元素并可能交换它们
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/dasdasd2341/.keep b/codes/dasdasd2341/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/dasdasd2341/15743468.java b/codes/dasdasd2341/15743468.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/dasdasd2341/15743468.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/dasdasd2341/15799082.java b/codes/dasdasd2341/15799082.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/dasdasd2341/15799082.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/dashengfa/15837719.java b/codes/dashengfa/15837719.java
deleted file mode 100644
index 47e0d6ef..00000000
--- a/codes/dashengfa/15837719.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 功能：对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 遍历数组，从第一个元素到倒数第二个元素
- for (int j = 0; j < n - 1 - i; j++) { // 每次比较相邻的元素，最后一个元素已经是当前轮的最大值，无需再比较
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/datacubes/.keep b/codes/datacubes/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/datacubes/15775733.java b/codes/datacubes/15775733.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/datacubes/15775733.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/datudou/15775955.java b/codes/datudou/15775955.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/datudou/15775955.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/dawnli/15533387.java b/codes/dawnli/15533387.java
deleted file mode 100644
index bdd22e5b..00000000
--- a/codes/dawnli/15533387.java
+++ /dev/null
@@ -1,18 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n-1; i++) {
- for (int j = 0; j < n-i-1; j++) {
- if (a[j] > a[j+1]) {
- // 交换 arr[j+1] and arr[j]
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
- } //end
diff --git a/codes/daxiong/.keep b/codes/daxiong/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/daxiong/15846450.java b/codes/daxiong/15846450.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/daxiong/15846450.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/dayeee/12165634.java b/codes/dayeee/12165634.java
deleted file mode 100644
index 9a1b572d..00000000
--- a/codes/dayeee/12165634.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- *
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1] 的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/dayuya/10044865.java b/codes/dayuya/10044865.java
deleted file mode 100644
index 83bb3cd3..00000000
--- a/codes/dayuya/10044865.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;i a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/ddi123456/15775627.java b/codes/ddi123456/15775627.java
deleted file mode 100644
index 9805991e..00000000
--- a/codes/ddi123456/15775627.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数实现了冒泡排序算法，将数组a按照从小到大的顺序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- // 如果当前元素大于下一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/ddl667/.keep b/codes/ddl667/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/ddl667/15814859.java b/codes/ddl667/15814859.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/ddl667/15814859.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/deCoder2024/.keep b/codes/deCoder2024/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/deCoder2024/15847492.java b/codes/deCoder2024/15847492.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/deCoder2024/15847492.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/deaita/.keep b/codes/deaita/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/deaita/15845569.java b/codes/deaita/15845569.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/deaita/15845569.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/dedeya/15742795.java b/codes/dedeya/15742795.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/dedeya/15742795.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/deijia909/11468750.java b/codes/deijia909/11468750.java
deleted file mode 100644
index 8c505501..00000000
--- a/codes/deijia909/11468750.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;i a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/dekali/.keep b/codes/dekali/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/dekali/15845962.java b/codes/dekali/15845962.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/dekali/15845962.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/denghaodongmy123/.keep b/codes/denghaodongmy123/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/denghaodongmy123/15838830.java b/codes/denghaodongmy123/15838830.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/denghaodongmy123/15838830.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/devinroot/9687540.java b/codes/devinroot/9687540.java
deleted file mode 100644
index 7aa905f3..00000000
--- a/codes/devinroot/9687540.java
+++ /dev/null
@@ -1,24 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int j=0;ja[i+1])
- {
- temp=a[i];
- a[i]=a[i+1];
- a[i+1]=temp;
- }
- }
- }
- //System.out.println(a);
-
-} //end
diff --git a/codes/df452aff/.keep b/codes/df452aff/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/df452aff/15831296.java b/codes/df452aff/15831296.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/df452aff/15831296.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/dfg56tsdfas/.keep b/codes/dfg56tsdfas/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/dfg56tsdfas/15743482.java b/codes/dfg56tsdfas/15743482.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/dfg56tsdfas/15743482.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/dfghrtdfgge5/.keep b/codes/dfghrtdfgge5/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/dfghrtdfgge5/15828963.java b/codes/dfghrtdfgge5/15828963.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/dfghrtdfgge5/15828963.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/dgq420377903/.keep b/codes/dgq420377903/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/dgq420377903/15776080.java b/codes/dgq420377903/15776080.java
deleted file mode 100644
index 9f86eb58..00000000
--- a/codes/dgq420377903/15776080.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- a[j] = a[j]+a[j+1];
- a[j+1] = a[j]-a[j+1];
- a[j] = a[j]-a[j+1];
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/diantun00/13629189.java b/codes/diantun00/13629189.java
deleted file mode 100644
index 66bacf1a..00000000
--- a/codes/diantun00/13629189.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++){
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/dioopp/11292585.java b/codes/dioopp/11292585.java
deleted file mode 100644
index 1c888994..00000000
--- a/codes/dioopp/11292585.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/disaner/.keep b/codes/disaner/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/disaner/15798333.java b/codes/disaner/15798333.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/disaner/15798333.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/dishierge/.keep b/codes/dishierge/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/dishierge/15758829.java b/codes/dishierge/15758829.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/dishierge/15758829.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/dishige/.keep b/codes/dishige/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/dishige/15758406.java b/codes/dishige/15758406.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/dishige/15758406.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/dishijiuge/.keep b/codes/dishijiuge/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/dishijiuge/15759226.java b/codes/dishijiuge/15759226.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/dishijiuge/15759226.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/dishiliuge/.keep b/codes/dishiliuge/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/dishiliuge/15759149.java b/codes/dishiliuge/15759149.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/dishiliuge/15759149.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/dishiqige/.keep b/codes/dishiqige/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/dishiqige/15759140.java b/codes/dishiqige/15759140.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/dishiqige/15759140.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/dishisi/.keep b/codes/dishisi/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/dishisi/15758975.java b/codes/dishisi/15758975.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/dishisi/15758975.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/dishissange/.keep b/codes/dishissange/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/dishissange/15759022.java b/codes/dishissange/15759022.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/dishissange/15759022.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/dishiwuge/.keep b/codes/dishiwuge/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/dishiwuge/15759050.java b/codes/dishiwuge/15759050.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/dishiwuge/15759050.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/dist11/15779201.java b/codes/dist11/15779201.java
deleted file mode 100644
index 9b5ae978..00000000
--- a/codes/dist11/15779201.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素比较和交换，将无序数组变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序趟数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环，进行相邻元素比较和交换
- if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们
- int temp = a[j]; // 临时变量，用于交换
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/dist22/15779370.java b/codes/dist22/15779370.java
deleted file mode 100644
index 9b5ae978..00000000
--- a/codes/dist22/15779370.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素比较和交换，将无序数组变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序趟数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环，进行相邻元素比较和交换
- if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们
- int temp = a[j]; // 临时变量，用于交换
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/dist33/15779447.java b/codes/dist33/15779447.java
deleted file mode 100644
index 9b5ae978..00000000
--- a/codes/dist33/15779447.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素比较和交换，将无序数组变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序趟数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环，进行相邻元素比较和交换
- if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们
- int temp = a[j]; // 临时变量，用于交换
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/dist55/15779566.java b/codes/dist55/15779566.java
deleted file mode 100644
index 9b5ae978..00000000
--- a/codes/dist55/15779566.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素比较和交换，将无序数组变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序趟数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环，进行相邻元素比较和交换
- if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们
- int temp = a[j]; // 临时变量，用于交换
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/dist66/15782518.java b/codes/dist66/15782518.java
deleted file mode 100644
index 9b5ae978..00000000
--- a/codes/dist66/15782518.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素比较和交换，将无序数组变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序趟数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环，进行相邻元素比较和交换
- if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们
- int temp = a[j]; // 临时变量，用于交换
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/dist77/15782715.java b/codes/dist77/15782715.java
deleted file mode 100644
index 9b5ae978..00000000
--- a/codes/dist77/15782715.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素比较和交换，将无序数组变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序趟数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环，进行相邻元素比较和交换
- if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们
- int temp = a[j]; // 临时变量，用于交换
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/dist88/15782777.java b/codes/dist88/15782777.java
deleted file mode 100644
index 9b5ae978..00000000
--- a/codes/dist88/15782777.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素比较和交换，将无序数组变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序趟数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环，进行相邻元素比较和交换
- if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们
- int temp = a[j]; // 临时变量，用于交换
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/dist99/15782896.java b/codes/dist99/15782896.java
deleted file mode 100644
index 9b5ae978..00000000
--- a/codes/dist99/15782896.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素比较和交换，将无序数组变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序趟数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环，进行相邻元素比较和交换
- if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们
- int temp = a[j]; // 临时变量，用于交换
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/diudiuge12262792/15499955.java b/codes/diudiuge12262792/15499955.java
deleted file mode 100644
index 68edfbcc..00000000
--- a/codes/diudiuge12262792/15499955.java
+++ /dev/null
@@ -1,26 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n; i++) {
- boolean swapped = false;
-
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
-
- swapped = true;
- }
- }
-
- // 如果在整个内部循环中都没有交换，则数组已经是排序好的
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/dkptlv/15520718.java b/codes/dkptlv/15520718.java
deleted file mode 100644
index 854beb62..00000000
--- a/codes/dkptlv/15520718.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
-
diff --git a/codes/dmw681/16541740.java b/codes/dmw681/16541740.java
deleted file mode 100644
index 0eb45e47..00000000
--- a/codes/dmw681/16541740.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0; ia[j]) {
- int temp = a[i];
- a[i] = a[j];
- a[j] = temp;
- }
- }
- }
-
-
-} //end
diff --git a/codes/dogepalm/.keep b/codes/dogepalm/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/dogepalm/15845073.java b/codes/dogepalm/15845073.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/dogepalm/15845073.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/downsider/.keep b/codes/downsider/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/downsider/15814998.java b/codes/downsider/15814998.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/downsider/15814998.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/dragg123/15718958.java b/codes/dragg123/15718958.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/dragg123/15718958.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/dragonir/11357510.java b/codes/dragonir/11357510.java
deleted file mode 100644
index 4d7083fe..00000000
--- a/codes/dragonir/11357510.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int i, j;
-
- for(i=0; ia[j]){
- int temp;
- temp = a[j-1];
- a[j-1] = a[j];
- a[j] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/dsfggsd445/.keep b/codes/dsfggsd445/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/dsfggsd445/15828546.java b/codes/dsfggsd445/15828546.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/dsfggsd445/15828546.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/dsfsqerada33/.keep b/codes/dsfsqerada33/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/dsfsqerada33/15743351.java b/codes/dsfsqerada33/15743351.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/dsfsqerada33/15743351.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/duanshusheng/15508667.java b/codes/duanshusheng/15508667.java
deleted file mode 100644
index cea168b5..00000000
--- a/codes/duanshusheng/15508667.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[i];
- a[i] = a[j];
- a[j] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/duanxintao/15684621.java b/codes/duanxintao/15684621.java
deleted file mode 100644
index be1beed5..00000000
--- a/codes/duanxintao/15684621.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素两两比较，将较大的元素交换到数组的末尾，
- * 重复这个过程直到整个数组变得有序。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 外层循环控制排序趟数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环控制每一趟排序多少次
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果前一个元素比后一个元素大，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/duixiang/.keep b/codes/duixiang/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/duixiang/15814647.java b/codes/duixiang/15814647.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/duixiang/15814647.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/dulong/11749087.java b/codes/dulong/11749087.java
deleted file mode 100644
index 1462d262..00000000
--- a/codes/dulong/11749087.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- if (n <= 1) return;
- for (int i = 0; i < n; ++i) {
- boolean flag = false;
- for (int j = 0; j < n - i - 1; ++j) {
- if (a[j] > a[j+1]) {
- int tmp = a[j];
- a[j] = a[j+1];
- a[j+1] = tmp;
- flag = true;
- }
- }
- if (!flag) break;
- }
-} //end
diff --git a/codes/dundun/15861800.java b/codes/dundun/15861800.java
deleted file mode 100644
index 54c5f386..00000000
--- a/codes/dundun/15861800.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
\ No newline at end of file
diff --git a/codes/duoduo172/15759065.java b/codes/duoduo172/15759065.java
deleted file mode 100644
index 76cbddd8..00000000
--- a/codes/duoduo172/15759065.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int b = 0; b < n - i - 1; b++) {
- if(a[b] > a[b + 1]) {
- int temp = a[b];
- a [b] = a[b + 1];
- a[b + 1] = temp;
- }
- }
- }
-
-
-} //end
diff --git a/codes/duzidundun/15860749.java b/codes/duzidundun/15860749.java
deleted file mode 100644
index 54c5f386..00000000
--- a/codes/duzidundun/15860749.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
\ No newline at end of file
diff --git a/codes/duziteng/10968772.java b/codes/duziteng/10968772.java
deleted file mode 100644
index ab3d8f39..00000000
--- a/codes/duziteng/10968772.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/dxr13146640122/15867024.java b/codes/dxr13146640122/15867024.java
deleted file mode 100644
index 24f513b3..00000000
--- a/codes/dxr13146640122/15867024.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/dxy18882636878/15829939.java b/codes/dxy18882636878/15829939.java
deleted file mode 100644
index ce045dc0..00000000
--- a/codes/dxy18882636878/15829939.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int []a,int n){
- for(int i=0;ia[j+1]){
- int temp = a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/ebb29bbe/9945255.java b/codes/ebb29bbe/9945255.java
deleted file mode 100644
index f5658b7b..00000000
--- a/codes/ebb29bbe/9945255.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/educ157441/.keep b/codes/educ157441/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/educ157441/15842827.java b/codes/educ157441/15842827.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/educ157441/15842827.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/ee858882845/15848149.java b/codes/ee858882845/15848149.java
deleted file mode 100644
index 809e6c45..00000000
--- a/codes/ee858882845/15848149.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素两两比较和交换，使得每一轮循环后最大（或最小）的元素“冒泡”到数组的末尾。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮比较的次数
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- // 交换 a[j] 和 a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/eedd22/15875744.java b/codes/eedd22/15875744.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/eedd22/15875744.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/ekdher/11188020.java b/codes/ekdher/11188020.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/ekdher/11188020.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/ekwwu1/11122460.java b/codes/ekwwu1/11122460.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/ekwwu1/11122460.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/enRENE1/11005023.java b/codes/enRENE1/11005023.java
deleted file mode 100644
index b9bf7818..00000000
--- a/codes/enRENE1/11005023.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/enkilee/15372338.java b/codes/enkilee/15372338.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/enkilee/15372338.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/enoughisenough/11364587.java b/codes/enoughisenough/11364587.java
deleted file mode 100644
index 272a12fc..00000000
--- a/codes/enoughisenough/11364587.java
+++ /dev/null
@@ -1,18 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- } //end
\ No newline at end of file
diff --git a/codes/ergeren/.keep b/codes/ergeren/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/ergeren/15799133.java b/codes/ergeren/15799133.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/ergeren/15799133.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/ericxu/16282084.java b/codes/ericxu/16282084.java
deleted file mode 100644
index c30cb33d..00000000
--- a/codes/ericxu/16282084.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- //将前一个比后一个大的两元素进行交换
- if (a[j] > a[j + 1]) {
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-
-} //end
diff --git a/codes/ewrt3425sdfs/.keep b/codes/ewrt3425sdfs/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/ewrt3425sdfs/15831329.java b/codes/ewrt3425sdfs/15831329.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/ewrt3425sdfs/15831329.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/express77/15513152.java b/codes/express77/15513152.java
deleted file mode 100644
index 20575dc4..00000000
--- a/codes/express77/15513152.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/ezh3wx95/11002373.java b/codes/ezh3wx95/11002373.java
deleted file mode 100644
index 82335424..00000000
--- a/codes/ezh3wx95/11002373.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/f13306939842/.keep b/codes/f13306939842/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/f13306939842/10968297.java b/codes/f13306939842/10968297.java
deleted file mode 100644
index c5585035..00000000
--- a/codes/f13306939842/10968297.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
-for (int i=0 ; ia[j+1]) {
-int temp=a[j];
-a[j]=a[j+1];
-a[j+1]=temp;
-}
-}
-}
-}
\ No newline at end of file
diff --git a/codes/f18967940562/.keep b/codes/f18967940562/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/f18967940562/10972030.java b/codes/f18967940562/10972030.java
deleted file mode 100644
index 9eccfac5..00000000
--- a/codes/f18967940562/10972030.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/f19555076671/15837167.java b/codes/f19555076671/15837167.java
deleted file mode 100644
index 47e0d6ef..00000000
--- a/codes/f19555076671/15837167.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 功能：对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 遍历数组，从第一个元素到倒数第二个元素
- for (int j = 0; j < n - 1 - i; j++) { // 每次比较相邻的元素，最后一个元素已经是当前轮的最大值，无需再比较
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/f370857894/.keep b/codes/f370857894/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/f370857894/10970517.java b/codes/f370857894/10970517.java
deleted file mode 100644
index d5f586ad..00000000
--- a/codes/f370857894/10970517.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] b, int n) {
- for (int i=0 ; ib[j+1]) {
- int temp=b[j];
- b[j]=b[j+1];
- b[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/f435wedt/.keep b/codes/f435wedt/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/f435wedt/15743453.java b/codes/f435wedt/15743453.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/f435wedt/15743453.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/f456af67654/.keep b/codes/f456af67654/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/f456af67654/15743470.java b/codes/f456af67654/15743470.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/f456af67654/15743470.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/f734tasaf/.keep b/codes/f734tasaf/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/f734tasaf/15743456.java b/codes/f734tasaf/15743456.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/f734tasaf/15743456.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/fangfangha/15775625.java b/codes/fangfangha/15775625.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/fangfangha/15775625.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/fanghua/.keep b/codes/fanghua/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/fanghua/10971642.java b/codes/fanghua/10971642.java
deleted file mode 100644
index 9eccfac5..00000000
--- a/codes/fanghua/10971642.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/fangqb/.keep b/codes/fangqb/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/fangqb/10043498.java b/codes/fangqb/10043498.java
deleted file mode 100644
index 667eee0f..00000000
--- a/codes/fangqb/10043498.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/fangying1/.keep b/codes/fangying1/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/fangying1/10968297.java b/codes/fangying1/10968297.java
deleted file mode 100644
index 1752b8cb..00000000
--- a/codes/fangying1/10968297.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void sortFunc(int [] a, int n) {
-for (int i=0 ; ia[j+1]) {
-int temp=a[j];
-a[j]=a[j+1];
-a[j+1]=temp;
-}
-}
-}
-}
\ No newline at end of file
diff --git a/codes/fasfaf227/.keep b/codes/fasfaf227/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/fasfaf227/15820189.java b/codes/fasfaf227/15820189.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/fasfaf227/15820189.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/fasfasfas234/.keep b/codes/fasfasfas234/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/fasfasfas234/15743358/15743358.java b/codes/fasfasfas234/15743358/15743358.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/fasfasfas234/15743358/15743358.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/fasfasfas234/15830971.java b/codes/fasfasfas234/15830971.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/fasfasfas234/15830971.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/fasfsa2412/.keep b/codes/fasfsa2412/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/fasfsa2412/15743474.java b/codes/fasfsa2412/15743474.java
deleted file mode 100644
index 96508c13..00000000
--- a/codes/fasfsa2412/15743474.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/fasfsaf292/.keep b/codes/fasfsaf292/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/fasfsaf292/15743418.java b/codes/fasfsaf292/15743418.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/fasfsaf292/15743418.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/fasfsf2442/.keep b/codes/fasfsf2442/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/fasfsf2442/15831391.java b/codes/fasfsf2442/15831391.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/fasfsf2442/15831391.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/fasioc924/.keep b/codes/fasioc924/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/fasioc924/15743426.java b/codes/fasioc924/15743426.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/fasioc924/15743426.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/fasttiger/10143432.java b/codes/fasttiger/10143432.java
deleted file mode 100644
index 93912216..00000000
--- a/codes/fasttiger/10143432.java
+++ /dev/null
@@ -1,23 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- if(a != null && a.length > 0){
- int l = a.length;
- if(l > n){
- l = n;
- }
- for (int i = 0; i< l; i++){
- for (int j=0; j a[j+1]){
- int t = a[j];
- a[j] = a[j+1];
- a[j+1] = t;
- }
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/fcc321/15630159.java b/codes/fcc321/15630159.java
deleted file mode 100644
index d7fbec1b..00000000
--- a/codes/fcc321/15630159.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组进行冒泡排序，将无序数组变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环，控制需要排序的趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环，从前往后依次比较相邻的两个元素
- if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们的位置
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/feifeixi/15846547.java b/codes/feifeixi/15846547.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/feifeixi/15846547.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/feihudui/.keep b/codes/feihudui/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/feihudui/15846656.java b/codes/feihudui/15846656.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/feihudui/15846656.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/feipao/11252573.java b/codes/feipao/11252573.java
deleted file mode 100644
index 24b49b4b..00000000
--- a/codes/feipao/11252573.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/feiya123/15719128.java b/codes/feiya123/15719128.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/feiya123/15719128.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/fendou/15635967.java b/codes/fendou/15635967.java
deleted file mode 100644
index fa7b3ff5..00000000
--- a/codes/fendou/15635967.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 将无序数组 a 按照从小到大的顺序进行排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每一趟排序多少次
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/feng666/15777226.java b/codes/feng666/15777226.java
deleted file mode 100644
index fd29ee97..00000000
--- a/codes/feng666/15777226.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 将无序数组通过冒泡排序变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环，控制比较轮数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环，进行相邻元素比较
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/fengling/15838545.java b/codes/fengling/15838545.java
deleted file mode 100644
index 47e0d6ef..00000000
--- a/codes/fengling/15838545.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 功能：对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 遍历数组，从第一个元素到倒数第二个元素
- for (int j = 0; j < n - 1 - i; j++) { // 每次比较相邻的元素，最后一个元素已经是当前轮的最大值，无需再比较
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/fengshang/15510907.java b/codes/fengshang/15510907.java
deleted file mode 100644
index c1da3005..00000000
--- a/codes/fengshang/15510907.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过不断比较相邻元素，将较大的元素交换到数组的末尾，经过n-1轮比较后，数组变得有序。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制需要比较的轮数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮比较的次数
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/fengshang/fengshang/15510907.java b/codes/fengshang/fengshang/15510907.java
deleted file mode 100644
index 01fb1639..00000000
--- a/codes/fengshang/fengshang/15510907.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过不断比较相邻元素，将较大的元素交换到数组的末尾，经过n-1轮比较后，数组变得有序。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制需要比较的轮数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮比较的次数
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/fengyeorz/15629835.java b/codes/fengyeorz/15629835.java
deleted file mode 100644
index fdf32e5c..00000000
--- a/codes/fengyeorz/15629835.java
+++ /dev/null
@@ -1,26 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数实现了冒泡排序算法，将数组a中的元素按升序排列
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 遍历所有数组元素
- for (int i = 0; i < n - 1; i++) {
- // 标记变量，用于检查是否发生了交换
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果当前元素大于下一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- swapped = true;
- }
- }
- // 如果内层循环没有发生交换，说明数组已经有序，可以提前退出
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/fengyu176/15759028.java b/codes/fengyu176/15759028.java
deleted file mode 100644
index f2b711a4..00000000
--- a/codes/fengyu176/15759028.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int huat = 0; huat < n - i - 1; huat++) {
- if(a[huat] > a[huat + 1]) {
- int temp = a[huat];
- a [huat] = a[huat + 1];
- a[huat + 1] = temp;
- }
- }
- }
-
-
-} //end,huat
diff --git a/codes/fhbb111/15605446.java b/codes/fhbb111/15605446.java
deleted file mode 100644
index 04625a49..00000000
--- a/codes/fhbb111/15605446.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-} //end
-
diff --git a/codes/fhkjhkl876/.keep b/codes/fhkjhkl876/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/fhkjhkl876/15743332.java b/codes/fhkjhkl876/15743332.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/fhkjhkl876/15743332.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/fhl3yue/15692389.java b/codes/fhl3yue/15692389.java
deleted file mode 100644
index 854beb62..00000000
--- a/codes/fhl3yue/15692389.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
-
diff --git a/codes/fhvz199/15759040.java b/codes/fhvz199/15759040.java
deleted file mode 100644
index 76cbddd8..00000000
--- a/codes/fhvz199/15759040.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int b = 0; b < n - i - 1; b++) {
- if(a[b] > a[b + 1]) {
- int temp = a[b];
- a [b] = a[b + 1];
- a[b + 1] = temp;
- }
- }
- }
-
-
-} //end
diff --git a/codes/fitzge/.keep b/codes/fitzge/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/fitzge/15867203.java b/codes/fitzge/15867203.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/fitzge/15867203.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/flutter/11187840.java b/codes/flutter/11187840.java
deleted file mode 100644
index 9e7534d4..00000000
--- a/codes/flutter/11187840.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡 排序 函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-}//end
\ No newline at end of file
diff --git a/codes/fofone/15772455.java b/codes/fofone/15772455.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/fofone/15772455.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/forz4ever/18245446.java b/codes/forz4ever/18245446.java
deleted file mode 100644
index c6572040..00000000
--- a/codes/forz4ever/18245446.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡函数排序
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- //你的代码，，使无序数组 a 变得有序
- for(int i = 0;i < n - 1;i++){
- for(int j = 0;j < n - 1 - i;j++){
- if(a[j] > a[j + 1]){
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
-
- }
- }
- }
-
-
-}//end
diff --git a/codes/fosmos/10385999.java b/codes/fosmos/10385999.java
deleted file mode 100644
index dcb3be95..00000000
--- a/codes/fosmos/10385999.java
+++ /dev/null
@@ -1,12 +0,0 @@
-public static void bubbleSort( int[] a, int n ) {
- for (int i = 0;i < a.length ;i++) {
- for(int j = (i+1); j < a.length ;j++) {
- int tep = 0;
- if (a[i] > a[j]) {
- tep = a[i];
- a[i] = a[j];
- a[j] = tep;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/fq18552765314/.keep b/codes/fq18552765314/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/fq18552765314/10972612.java b/codes/fq18552765314/10972612.java
deleted file mode 100644
index 9eccfac5..00000000
--- a/codes/fq18552765314/10972612.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/franki_lxsq/9958657.java b/codes/franki_lxsq/9958657.java
deleted file mode 100644
index e13c76bc..00000000
--- a/codes/franki_lxsq/9958657.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
-for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-} //end
diff --git a/codes/freeliujian/11351490.java b/codes/freeliujian/11351490.java
deleted file mode 100644
index 9e7534d4..00000000
--- a/codes/freeliujian/11351490.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡 排序 函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-}//end
\ No newline at end of file
diff --git a/codes/friklogff/15528029.java b/codes/friklogff/15528029.java
deleted file mode 100644
index 854beb62..00000000
--- a/codes/friklogff/15528029.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
-
diff --git a/codes/fsa722/.keep b/codes/fsa722/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/fsa722/15742665.java b/codes/fsa722/15742665.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/fsa722/15742665.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/fsafacc232/.keep b/codes/fsafacc232/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/fsafacc232/15743001.java b/codes/fsafacc232/15743001.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/fsafacc232/15743001.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/fsafas8979812/.keep b/codes/fsafas8979812/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/fsafas8979812/15831387.java b/codes/fsafas8979812/15831387.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/fsafas8979812/15831387.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/fsafsa234/.keep b/codes/fsafsa234/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/fsafsa234/15831509.java b/codes/fsafsa234/15831509.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/fsafsa234/15831509.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/fsafsc2132/.keep b/codes/fsafsc2132/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/fsafsc2132/15831373.java b/codes/fsafsc2132/15831373.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/fsafsc2132/15831373.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/fsdf435sdf/.keep b/codes/fsdf435sdf/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/fsdf435sdf/15743405.java b/codes/fsdf435sdf/15743405.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/fsdf435sdf/15743405.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/fsdfsdfh32/.keep b/codes/fsdfsdfh32/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/fsdfsdfh32/15827710.java b/codes/fsdfsdfh32/15827710.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/fsdfsdfh32/15827710.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/fsk1234/15790091.java b/codes/fsk1234/15790091.java
deleted file mode 100644
index b6780441..00000000
--- a/codes/fsk1234/15790091.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过多次遍历数组，比较相邻元素并交换位置，将最大的元素逐渐“冒泡”到数组的末尾，
- * 从而实现数组的升序排序。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环，控制遍历次数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环，控制每次遍历的比较次数
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
-
diff --git a/codes/fubing3/.keep b/codes/fubing3/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/fubing3/9619048.java b/codes/fubing3/9619048.java
deleted file mode 100644
index 1752b8cb..00000000
--- a/codes/fubing3/9619048.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void sortFunc(int [] a, int n) {
-for (int i=0 ; ia[j+1]) {
-int temp=a[j];
-a[j]=a[j+1];
-a[j+1]=temp;
-}
-}
-}
-}
\ No newline at end of file
diff --git a/codes/fuzhong/10967384.java b/codes/fuzhong/10967384.java
deleted file mode 100644
index c7db0a12..00000000
--- a/codes/fuzhong/10967384.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * @param arr 待排序的数组
- * @param size 待排序的数组长度
- */
-public static void bubbleSort(int [] arr, int size){
- // 你的代码，使无序数组 arr 变得有序
- for(int i = 0 ; i < size - 1 ; i++){
- for(int j = 0 ; j < size - 1 - i ; j++){
- if(arr[j] > arr[j + 1]){
- int tmp = arr[j];
- arr[j] = arr[j + 1];
- arr[j + 1] = tmp;
- }
- }
- }
-
-} //end
-
diff --git a/codes/fuzio35/16199622.java b/codes/fuzio35/16199622.java
deleted file mode 100644
index 7b622876..00000000
--- a/codes/fuzio35/16199622.java
+++ /dev/null
@@ -1,12 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- int temp =0;
- for(int i = 0;ii;j--){
- if(a[j]a[y+1]) {
- int temp=a[y];
- a[y]=a[y+1];
- a[y+1]=temp;
- }
- }
- }
-}
diff --git a/codes/fy13073414213/.keep b/codes/fy13073414213/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/fy13073414213/10972162.java b/codes/fy13073414213/10972162.java
deleted file mode 100644
index 9eccfac5..00000000
--- a/codes/fy13073414213/10972162.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/fyt345sdfgsd/.keep b/codes/fyt345sdfgsd/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/fyt345sdfgsd/15743397.java b/codes/fyt345sdfgsd/15743397.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/fyt345sdfgsd/15743397.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/gaoxinjmj/.keep b/codes/gaoxinjmj/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/gaoxinjmj/15759215.java b/codes/gaoxinjmj/15759215.java
deleted file mode 100644
index d40803fb..00000000
--- a/codes/gaoxinjmj/15759215.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/gddclct/15959388.java b/codes/gddclct/15959388.java
deleted file mode 100644
index 5cc1c636..00000000
--- a/codes/gddclct/15959388.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * 功能：将无序数组 a 按照从小到大的顺序进行排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 外层循环控制所有轮数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环控制每一轮的比较次数
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/gedeshidai/15539757.java b/codes/gedeshidai/15539757.java
deleted file mode 100644
index c7d4bd3a..00000000
--- a/codes/gedeshidai/15539757.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数通过冒泡排序算法对待排序的数组进行排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++){
- for(int j = 0; j < n - i - 1; j++){
- // 如果前一个元素大于后一个元素，则交换他们的位置
- if(a[j] > a[j + 1]){
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
-//end
diff --git a/codes/genghai/.keep b/codes/genghai/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/genghai/15831364.java b/codes/genghai/15831364.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/genghai/15831364.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/gflu777/15508845.java b/codes/gflu777/15508845.java
deleted file mode 100644
index 7cd30ca2..00000000
--- a/codes/gflu777/15508845.java
+++ /dev/null
@@ -1,19 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n-1; i++) {
- for (int j = 0; j < n-i-1; j++) {
- if (a[j] > a[j+1]) {
- int tmp = a[j];
- a[j] = a[j+1];
- a[j+1] = tmp;
- }
- }
- }
-
- } //end
diff --git a/codes/ghdfg3452/.keep b/codes/ghdfg3452/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/ghdfg3452/15743429.java b/codes/ghdfg3452/15743429.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/ghdfg3452/15743429.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/gin-lsl/11448781.java b/codes/gin-lsl/11448781.java
deleted file mode 100644
index cacd12f1..00000000
--- a/codes/gin-lsl/11448781.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- a[j] = a[j]+a[j+1];
- a[j+1] = a[j]-a[j+1];
- a[j] = a[j]-a[j+1];
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/giooter/.keep b/codes/giooter/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/giooter/15773918.java b/codes/giooter/15773918.java
deleted file mode 100644
index 9f86eb58..00000000
--- a/codes/giooter/15773918.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- a[j] = a[j]+a[j+1];
- a[j+1] = a[j]-a[j+1];
- a[j] = a[j]-a[j+1];
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/gobuster/15555259.java b/codes/gobuster/15555259.java
deleted file mode 100644
index 854beb62..00000000
--- a/codes/gobuster/15555259.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
-
diff --git a/codes/godawang/.keep b/codes/godawang/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/godawang/15764594.java b/codes/godawang/15764594.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/godawang/15764594.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/godgod/15775680.java b/codes/godgod/15775680.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/godgod/15775680.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/godofkingsdonw6/.keep b/codes/godofkingsdonw6/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/godofkingsdonw6/15815850.java b/codes/godofkingsdonw6/15815850.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/godofkingsdonw6/15815850.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/gogomo/.keep b/codes/gogomo/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/gogomo/15865953.java b/codes/gogomo/15865953.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/gogomo/15865953.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/goodstudymyx/.keep b/codes/goodstudymyx/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/goodstudymyx/15846322.java b/codes/goodstudymyx/15846322.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/goodstudymyx/15846322.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/gotchar/15775671.java b/codes/gotchar/15775671.java
deleted file mode 100644
index a5c2a320..00000000
--- a/codes/gotchar/15775671.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素两两比较并交换，使得每一轮比较后最大（或最小）的元素能够移动到数组的末尾
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一趟排序多少次
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- // 交换 a[j] 和 a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/gqhomegitee/.keep b/codes/gqhomegitee/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/gqhomegitee/15846699.java b/codes/gqhomegitee/15846699.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/gqhomegitee/15846699.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/grfewryhh55/.keep b/codes/grfewryhh55/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/grfewryhh55/15828725.java b/codes/grfewryhh55/15828725.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/grfewryhh55/15828725.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/gsdrt657/.keep b/codes/gsdrt657/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/gsdrt657/15831411.java b/codes/gsdrt657/15831411.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/gsdrt657/15831411.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/gtuwer64/.keep b/codes/gtuwer64/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/gtuwer64/15828885.java b/codes/gtuwer64/15828885.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/gtuwer64/15828885.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/guagua123/15620667.java b/codes/guagua123/15620667.java
deleted file mode 100644
index cee67cf6..00000000
--- a/codes/guagua123/15620667.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组a进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮比较的次数
- // 如果前一个元素比后一个元素大，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/guanghua/.keep b/codes/guanghua/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/guanghua/15756054.java b/codes/guanghua/15756054.java
deleted file mode 100644
index c04ad968..00000000
--- a/codes/guanghua/15756054.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
-* 冒泡排序函数
-* aa bb cc
-* @param a 待排序的数组
-* @param n 待排序的数组长度
-*/
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/guanghua/15772570.java b/codes/guanghua/15772570.java
deleted file mode 100644
index 450685ab..00000000
--- a/codes/guanghua/15772570.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
-* 冒泡排序函数
-* aa bb cc
-* @param a 待排序的数组
-* @param n 待排序的数组长度
-*/
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n-1; i++) {
- for (int j = 0; j < n-i-1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j] ;
- a[j] = a[j + 1] ;
- a[j + 1] = temp ;
- }
- }
- }
-} //end 二次提交
\ No newline at end of file
diff --git a/codes/guanghua/15819545.java b/codes/guanghua/15819545.java
deleted file mode 100644
index c04ad968..00000000
--- a/codes/guanghua/15819545.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
-* 冒泡排序函数
-* aa bb cc
-* @param a 待排序的数组
-* @param n 待排序的数组长度
-*/
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/guanghua/15820837.java b/codes/guanghua/15820837.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/guanghua/15820837.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/guanj123/15699820.java b/codes/guanj123/15699820.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/guanj123/15699820.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/gufengxiao/15851937.java b/codes/gufengxiao/15851937.java
deleted file mode 100644
index ae82e695..00000000
--- a/codes/gufengxiao/15851937.java
+++ /dev/null
@@ -1,35 +0,0 @@
-/**
-
- * 冒泡排序函数
-
- * aa bb cc
-
- * @param a 待排序的数组
-
- * @param n 待排序的数组长度
-
- */
-
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0; i < n-1 ; i++){
-
- for (int j = 0;j < n-1-i;j++){
-
- if(a[j] > a[j+1]){
-
- int temp = a[j];
-
- a[j] = a[j+1];
-
- a[j+1] = temp;
-
- }
-
- }
-
- }
-
-
-
-} //end
diff --git a/codes/gugulogs/15521175.java b/codes/gugulogs/15521175.java
deleted file mode 100644
index f9340dcc..00000000
--- a/codes/gugulogs/15521175.java
+++ /dev/null
@@ -1,13 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
-
diff --git a/codes/guhhzz/15835674.java b/codes/guhhzz/15835674.java
deleted file mode 100644
index d0e7038d..00000000
--- a/codes/guhhzz/15835674.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。
- * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的次数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一轮比较的次数
- // 如果前一个元素比后一个元素大，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/gui8989/11228793.java b/codes/gui8989/11228793.java
deleted file mode 100644
index 24b49b4b..00000000
--- a/codes/gui8989/11228793.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/gujian3724/15541800.java b/codes/gujian3724/15541800.java
deleted file mode 100644
index c2157ca5..00000000
--- a/codes/gujian3724/15541800.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 将无序数组通过冒泡排序变得有序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每一趟排序多少次
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/gunange/.keep b/codes/gunange/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/gunange/15846499.java b/codes/gunange/15846499.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/gunange/15846499.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/guoguoya/15742850.java b/codes/guoguoya/15742850.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/guoguoya/15742850.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/gwya123/15699461.java b/codes/gwya123/15699461.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/gwya123/15699461.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/h178414/.keep b/codes/h178414/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/h178414/15842656.java b/codes/h178414/15842656.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/h178414/15842656.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/h295276/15685251.java b/codes/h295276/15685251.java
deleted file mode 100644
index 584706c9..00000000
--- a/codes/h295276/15685251.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 使用冒泡排序算法对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环，表示所有轮数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环，表示每轮比较的次数
- // 如果前一个元素大于后一个元素，则交换位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/h4ppyguys/.keep b/codes/h4ppyguys/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/h4ppyguys/15843449.java b/codes/h4ppyguys/15843449.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/h4ppyguys/15843449.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/h891539721/15718815.java b/codes/h891539721/15718815.java
deleted file mode 100644
index f2b4bb4b..00000000
--- a/codes/h891539721/15718815.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 将无序数组通过冒泡排序算法变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/h915754289/15853542.java b/codes/h915754289/15853542.java
deleted file mode 100644
index db00df43..00000000
--- a/codes/h915754289/15853542.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组进行冒泡排序，使得数组中的元素按从小到大的顺序排列
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 外层循环控制排序趟数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环负责进行每趟排序，通过相邻元素的比较和交换来移动较大元素到数组的末尾
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
- // 经过 n-1 趟排序后，数组已经变为有序
-} // end
diff --git a/codes/haha176/15759089.java b/codes/haha176/15759089.java
deleted file mode 100644
index 76cbddd8..00000000
--- a/codes/haha176/15759089.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int b = 0; b < n - i - 1; b++) {
- if(a[b] > a[b + 1]) {
- int temp = a[b];
- a [b] = a[b + 1];
- a[b + 1] = temp;
- }
- }
- }
-
-
-} //end
diff --git a/codes/hahalin/15846388.java b/codes/hahalin/15846388.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/hahalin/15846388.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/hahane/15772179.java b/codes/hahane/15772179.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/hahane/15772179.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/haihai/.keep b/codes/haihai/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/haihai/15860309.java b/codes/haihai/15860309.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/haihai/15860309.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/handleRich/11471812.java b/codes/handleRich/11471812.java
deleted file mode 100644
index 8c505501..00000000
--- a/codes/handleRich/11471812.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;i a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/handsonboards/.keep b/codes/handsonboards/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/handsonboards/15841143.java b/codes/handsonboards/15841143.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/handsonboards/15841143.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/haohua/.keep b/codes/haohua/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/haohua/15830974.java b/codes/haohua/15830974.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/haohua/15830974.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/haoranx98/.keep b/codes/haoranx98/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/haoranx98/10039365.java b/codes/haoranx98/10039365.java
deleted file mode 100644
index bd946e56..00000000
--- a/codes/haoranx98/10039365.java
+++ /dev/null
@@ -1,17 +0,0 @@
- /* 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/happymo/11212155.java b/codes/happymo/11212155.java
deleted file mode 100644
index 272a12fc..00000000
--- a/codes/happymo/11212155.java
+++ /dev/null
@@ -1,18 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- } //end
\ No newline at end of file
diff --git a/codes/hatjs880328/.keep b/codes/hatjs880328/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/hatjs880328/15779413.java b/codes/hatjs880328/15779413.java
deleted file mode 100644
index 9f86eb58..00000000
--- a/codes/hatjs880328/15779413.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- a[j] = a[j]+a[j+1];
- a[j+1] = a[j]-a[j+1];
- a[j] = a[j]-a[j+1];
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/hclw_123/15865557.java b/codes/hclw_123/15865557.java
deleted file mode 100644
index 3563ad5b..00000000
--- a/codes/hclw_123/15865557.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素两两比较和交换，使得每一轮迭代后最大（或最小）的元素能够移动到数组的末尾。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的轮数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮比较的次数
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/hdhd13726801083/15811090.java b/codes/hdhd13726801083/15811090.java
deleted file mode 100644
index 166dea5d..00000000
--- a/codes/hdhd13726801083/15811090.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数通过冒泡排序算法对数组进行排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮的比较次数
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/heheer/9674738.java b/codes/heheer/9674738.java
deleted file mode 100644
index 3923f707..00000000
--- a/codes/heheer/9674738.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int i, j;
-
- for(i=0; ia[j]){
- int temp;
- temp = a[j-1];
- a[j-1] = a[j];
- a[j] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/heiheiya/15775428.java b/codes/heiheiya/15775428.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/heiheiya/15775428.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/heiopx/11121859.java b/codes/heiopx/11121859.java
deleted file mode 100644
index 1c888994..00000000
--- a/codes/heiopx/11121859.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/helens0813/15861403.java b/codes/helens0813/15861403.java
deleted file mode 100644
index 54c5f386..00000000
--- a/codes/helens0813/15861403.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
\ No newline at end of file
diff --git a/codes/helloAnhusts/.keep b/codes/helloAnhusts/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/helloAnhusts/15846366.java b/codes/helloAnhusts/15846366.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/helloAnhusts/15846366.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/helloY_Y/15644488.java b/codes/helloY_Y/15644488.java
deleted file mode 100644
index a644c1f6..00000000
--- a/codes/helloY_Y/15644488.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
-
diff --git a/codes/heshu1/15640537.java b/codes/heshu1/15640537.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/heshu1/15640537.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/hfghst45645d/.keep b/codes/hfghst45645d/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/hfghst45645d/15831264.java b/codes/hfghst45645d/15831264.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/hfghst45645d/15831264.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/hh456123/15721443.java b/codes/hh456123/15721443.java
deleted file mode 100644
index 824031d9..00000000
--- a/codes/hh456123/15721443.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。
- * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每趟排序多少次
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
-
diff --git a/codes/hhhh2160350883/15855109.java b/codes/hhhh2160350883/15855109.java
deleted file mode 100644
index db00df43..00000000
--- a/codes/hhhh2160350883/15855109.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组进行冒泡排序，使得数组中的元素按从小到大的顺序排列
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 外层循环控制排序趟数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环负责进行每趟排序，通过相邻元素的比较和交换来移动较大元素到数组的末尾
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
- // 经过 n-1 趟排序后，数组已经变为有序
-} // end
diff --git a/codes/hhj123/15639946.java b/codes/hhj123/15639946.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/hhj123/15639946.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/hhmdsb/15837956.java b/codes/hhmdsb/15837956.java
deleted file mode 100644
index 47e0d6ef..00000000
--- a/codes/hhmdsb/15837956.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 功能：对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 遍历数组，从第一个元素到倒数第二个元素
- for (int j = 0; j < n - 1 - i; j++) { // 每次比较相邻的元素，最后一个元素已经是当前轮的最大值，无需再比较
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/hjh13525117665/15856794.java b/codes/hjh13525117665/15856794.java
deleted file mode 100644
index 271d2f1d..00000000
--- a/codes/hjh13525117665/15856794.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 将数组a按照从小到大的顺序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- // 交换a[j]和a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/hlsscoder/15606370.java b/codes/hlsscoder/15606370.java
deleted file mode 100644
index 9de98c3f..00000000
--- a/codes/hlsscoder/15606370.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组进行冒泡排序，使其变得有序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 外层循环，控制需要排序的轮数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环，控制每轮需要比较的次数
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果当前元素大于下一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/hly123/.keep b/codes/hly123/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/hly123/10984210.java b/codes/hly123/10984210.java
deleted file mode 100644
index 9eccfac5..00000000
--- a/codes/hly123/10984210.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/hly252984658/.keep b/codes/hly252984658/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/hly252984658/10979977.java b/codes/hly252984658/10979977.java
deleted file mode 100644
index 9eccfac5..00000000
--- a/codes/hly252984658/10979977.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/hnn111/15577556.java b/codes/hnn111/15577556.java
deleted file mode 100644
index 25b3bbe4..00000000
--- a/codes/hnn111/15577556.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/honghongwa/15846459.java b/codes/honghongwa/15846459.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/honghongwa/15846459.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/hongshen/.keep b/codes/hongshen/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/hongshen/10039145.java b/codes/hongshen/10039145.java
deleted file mode 100644
index 64e1f423..00000000
--- a/codes/hongshen/10039145.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++)
- {
- for (int j = 0; j < n - 1 - i; j++)
- {
- if (a[j] > a[j+1])
- {
- int temp = a[j+1];
- a[j+1] = a[j];
- a[j] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/hongxia/15876230.java b/codes/hongxia/15876230.java
deleted file mode 100644
index 14984b85..00000000
--- a/codes/hongxia/15876230.java
+++ /dev/null
@@ -1,26 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过多次遍历数组，每次比较相邻元素并交换位置，使得较大的元素逐渐“浮”到数组的末尾。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- // 每一轮排序的标记，用于判断是否有交换发生
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果当前元素大于下一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 标记有交换发生
- swapped = true;
- }
- }
- // 如果这一轮没有发生交换，说明数组已经有序，直接退出循环
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/hongyaya/15683533.java b/codes/hongyaya/15683533.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/hongyaya/15683533.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/hongyu551600/15868757.java b/codes/hongyu551600/15868757.java
deleted file mode 100644
index 24f513b3..00000000
--- a/codes/hongyu551600/15868757.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/hopekai/15586507.java b/codes/hopekai/15586507.java
deleted file mode 100644
index ae82e695..00000000
--- a/codes/hopekai/15586507.java
+++ /dev/null
@@ -1,35 +0,0 @@
-/**
-
- * 冒泡排序函数
-
- * aa bb cc
-
- * @param a 待排序的数组
-
- * @param n 待排序的数组长度
-
- */
-
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0; i < n-1 ; i++){
-
- for (int j = 0;j < n-1-i;j++){
-
- if(a[j] > a[j+1]){
-
- int temp = a[j];
-
- a[j] = a[j+1];
-
- a[j+1] = temp;
-
- }
-
- }
-
- }
-
-
-
-} //end
diff --git a/codes/houhouya/15778311.java b/codes/houhouya/15778311.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/houhouya/15778311.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/hua0x522/10375834.java b/codes/hua0x522/10375834.java
deleted file mode 100644
index f04a8c13..00000000
--- a/codes/hua0x522/10375834.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < n; j++) {
- if (j < n-1 && a[j] > a[j+1]) {
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
-
diff --git a/codes/huaano/15772611.java b/codes/huaano/15772611.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/huaano/15772611.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/hualine/15772389.java b/codes/hualine/15772389.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/hualine/15772389.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/huang856/.keep b/codes/huang856/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/huang856/10982875.java b/codes/huang856/10982875.java
deleted file mode 100644
index 9eccfac5..00000000
--- a/codes/huang856/10982875.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/huangduoyan2024/.I94UY3.java.swp b/codes/huangduoyan2024/.I94UY3.java.swp
deleted file mode 100644
index 95d65cb9d367ae30eaa2cf42eaa8960a6eedfe9e..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001
literal 12288
zcmeI%%}T>S5C`zB2f>3V`U0a~T56i~6Q$OB51yogEj?_K)@}&dl5PT8(1Rx*#&;2)
z$Vp5+Sn$w;Q1~xQCYwwqn;+y5;yQQz8@i}Dg2!RD`5xU@A!4n~YW`PN!(`fN%TD4?
z(qJ)v@^m|lXT!Bip0kFw^o&ZCd9)VZOzY5|B{F*O6a6TohSO--{ma(izF7-oD%U#T
z00bbgxxoIQ*{J8Q`q}9T9Ul!gZ-px%009U<00Izz00bZafvpoT^OAVsRqqrl-z{?K
zS1zVV5P$##AOHafKmY;|fB*y_009VWp@8&-un&arII{o$tMC6$o_}z>bG&hAj=W|I
zpAk!j00bZa0SG_<0uX=z1Rwwb2>gS<9uE~6GSm~ i; j--) {
- if (a[j] < a[j - 1]) {
- int t = a[j];
- a[j] = a[j - 1];
- a[j - 1] = t;
- }
- }
- }
-}
diff --git a/codes/huangwenli666/15867725.java b/codes/huangwenli666/15867725.java
deleted file mode 100644
index 24f513b3..00000000
--- a/codes/huangwenli666/15867725.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/huangxiaoyan/10971566.java b/codes/huangxiaoyan/10971566.java
deleted file mode 100644
index deb24387..00000000
--- a/codes/huangxiaoyan/10971566.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i=0 ; ia[k+1]) {
- int temp=a[k];
- a[k]=a[k+1];
- a[k+1]=temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/huangzi/.keep b/codes/huangzi/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/huangzi/15867961.java b/codes/huangzi/15867961.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/huangzi/15867961.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/huanji1212/.keep b/codes/huanji1212/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/huanji1212/15860624.java b/codes/huanji1212/15860624.java
deleted file mode 100644
index 54c5f386..00000000
--- a/codes/huanji1212/15860624.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
\ No newline at end of file
diff --git a/codes/huanjiyan/15607160.java b/codes/huanjiyan/15607160.java
deleted file mode 100644
index ae82e695..00000000
--- a/codes/huanjiyan/15607160.java
+++ /dev/null
@@ -1,35 +0,0 @@
-/**
-
- * 冒泡排序函数
-
- * aa bb cc
-
- * @param a 待排序的数组
-
- * @param n 待排序的数组长度
-
- */
-
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0; i < n-1 ; i++){
-
- for (int j = 0;j < n-1-i;j++){
-
- if(a[j] > a[j+1]){
-
- int temp = a[j];
-
- a[j] = a[j+1];
-
- a[j+1] = temp;
-
- }
-
- }
-
- }
-
-
-
-} //end
diff --git a/codes/huankuai/.java b/codes/huankuai/.java
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/huankuai/9962039.java b/codes/huankuai/9962039.java
deleted file mode 100644
index 82b73c8f..00000000
--- a/codes/huankuai/9962039.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-} //end
-
diff --git a/codes/huliangsheng/.keep b/codes/huliangsheng/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/huliangsheng/15759181.java b/codes/huliangsheng/15759181.java
deleted file mode 100644
index d40803fb..00000000
--- a/codes/huliangsheng/15759181.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/hunking/.keep b/codes/hunking/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/hunking/15845445.java b/codes/hunking/15845445.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/hunking/15845445.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/hunzita/.keep b/codes/hunzita/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/hunzita/15850843.java b/codes/hunzita/15850843.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/hunzita/15850843.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/huoyin/15864042.java b/codes/huoyin/15864042.java
deleted file mode 100644
index ae82e695..00000000
--- a/codes/huoyin/15864042.java
+++ /dev/null
@@ -1,35 +0,0 @@
-/**
-
- * 冒泡排序函数
-
- * aa bb cc
-
- * @param a 待排序的数组
-
- * @param n 待排序的数组长度
-
- */
-
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0; i < n-1 ; i++){
-
- for (int j = 0;j < n-1-i;j++){
-
- if(a[j] > a[j+1]){
-
- int temp = a[j];
-
- a[j] = a[j+1];
-
- a[j+1] = temp;
-
- }
-
- }
-
- }
-
-
-
-} //end
diff --git a/codes/huqi88/15222808.java b/codes/huqi88/15222808.java
deleted file mode 100644
index ce2dfba6..00000000
--- a/codes/huqi88/15222808.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int[] a, int n) {
- if (n <= 1) {
- return; // 如果数组长度为0或1，则不需要排序
- }
-
- for (int i = 0; i < n - 1; i++) { // 外层循环控制遍历次数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每次比较的元素
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
- }
diff --git a/codes/hyk111/15779480.java b/codes/hyk111/15779480.java
deleted file mode 100644
index 46da388e..00000000
--- a/codes/hyk111/15779480.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过对相邻元素的比较和交换，将较大的元素逐渐“浮”到数组的末尾，从而完成排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每趟排序多少次
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/hyk222/15829718.java b/codes/hyk222/15829718.java
deleted file mode 100644
index 46da388e..00000000
--- a/codes/hyk222/15829718.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过对相邻元素的比较和交换，将较大的元素逐渐“浮”到数组的末尾，从而完成排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每趟排序多少次
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/hzhong/15527208.java b/codes/hzhong/15527208.java
deleted file mode 100644
index a8d0ec5a..00000000
--- a/codes/hzhong/15527208.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/** * 冒泡排序函数
- * * aa bb cc *
- * @param a 待排序的数组 *
- * @param n 待排序的数组长度 */
-
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换a[j]和a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}// end
-
diff --git a/codes/iHento/15964827.java b/codes/iHento/15964827.java
deleted file mode 100644
index a3c6f5d5..00000000
--- a/codes/iHento/15964827.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int T = a[j];
- a[j] = a[j + 1];
- a[j + 1] = T;
- }
- }
- }
-} //end
diff --git a/codes/iHento/15965308.java b/codes/iHento/15965308.java
deleted file mode 100644
index c11e92d2..00000000
--- a/codes/iHento/15965308.java
+++ /dev/null
@@ -1,19 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- *
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int[] a, int n) {
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int T = a[j];
- a[j] = a[j + 1];
- a[j + 1] = T;
- }
- }
- }
- } // end
diff --git a/codes/idealismer/15406184.java b/codes/idealismer/15406184.java
deleted file mode 100644
index eb3d65ef..00000000
--- a/codes/idealismer/15406184.java
+++ /dev/null
@@ -1,26 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过比较相邻元素并交换它们（如果需要），将数组a排序为升序。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- // 创建一个标志位，用于检测数组是否已排序
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果当前元素大于下一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 交换后，标志位设为true
- swapped = true;
- }
- }
- // 如果内层循环没有交换任何元素，说明数组已排序完成
- if (!swapped) {
- break;
- }
- }
-} // end bubbleSort
diff --git a/codes/ignoreme/11207270.java b/codes/ignoreme/11207270.java
deleted file mode 100644
index 191de91d..00000000
--- a/codes/ignoreme/11207270.java
+++ /dev/null
@@ -1,11 +0,0 @@
- public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < a.length - 1; i++) {
- for (int j = 0; j < a.length - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j + 1];
- a[j + 1] = a[j];
- a[j] = temp;
- }
- }
- }
- }
\ No newline at end of file
diff --git a/codes/ikzsm77/15613401.java b/codes/ikzsm77/15613401.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/ikzsm77/15613401.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/ilove360/9937750.java b/codes/ilove360/9937750.java
deleted file mode 100644
index 9061f1f3..00000000
--- a/codes/ilove360/9937750.java
+++ /dev/null
@@ -1,27 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int temp = 0 ;
- for(int i = 0 ;i< n -1; i++){
- for(int j = 0; ja[j+1]){
- temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
-
- }
- System.out.println("a排序后：");
-
- for(int i = 0; i a[j+1]) {
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/includebits/.15775863.java.swp b/codes/includebits/.15775863.java.swp
deleted file mode 100644
index 1b729bb199aa7ed72e9539f3008f978b1a8d2d63..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001
literal 12288
zcmeI1J#W)c6ozk^DIn4jp+i~Pq^%RGrXK;s%D{xm&?v*Tm#@IwRGQ&A
z;XlH2`Y2Dxi!DC(Mf(Q_S!x0!>oIaNczUpU3&p_hj;^Ep*
z6%il;M1Tko0U|&IhyW2F0s~1vT0`tUZhoY@eWDwO{)pX_0udkrM1Tko0U|&IhyW2F
z0z`la5CI}EfCPAvu@A$HC63|p`2T>Y5%?bntbn5EMv(!YmEigNr+DVy
z@O&9kkSV|gkb2e1G5@mvpuv9``Qip)$e=Vd72*a(fp+tayZ+i)d*FR})o!hOtzFhX
zLzG}Fm~*i=XB_VIEG5&1F@H=MXQXo&&VvDykUn<^bBfR@B4-Xn=(6f+MQBiy
zTw-XLq6lhTRV(^c)0V-Id;$0b_~VRm+##u;;F85{Ud5@-w>5WT(`i2OwpZP)kKX?3
zkF5iz`L55z|6=lAclO>ok6M1wv-j=hhO_t8+kfutZij6;2QNB1kDZ5`?&qCwf?w00
Khs8`uCfP4yzS=$j
diff --git a/codes/includebits/15775863.java b/codes/includebits/15775863.java
deleted file mode 100644
index efd680da..00000000
--- a/codes/includebits/15775863.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数用于对给定数组进行冒泡排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/interceptors/11148333.java b/codes/interceptors/11148333.java
deleted file mode 100644
index 1c888994..00000000
--- a/codes/interceptors/11148333.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/ivan886/15517024.java b/codes/ivan886/15517024.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/ivan886/15517024.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/jack250/15895412.java b/codes/jack250/15895412.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/jack250/15895412.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/jacksoftware/15864608.java b/codes/jacksoftware/15864608.java
deleted file mode 100644
index 8f89cc01..00000000
--- a/codes/jacksoftware/15864608.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
-
- }
-
-}
diff --git a/codes/jackson0007/.keep b/codes/jackson0007/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/jackson0007/15846232.java b/codes/jackson0007/15846232.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/jackson0007/15846232.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/jacksonstack/15157304.java b/codes/jacksonstack/15157304.java
deleted file mode 100644
index fd232d56..00000000
--- a/codes/jacksonstack/15157304.java
+++ /dev/null
@@ -1,32 +0,0 @@
- /**
- * 冒泡排序函数
- * more：
- * 1. 从上一次交换索引位置开始；部分有序
- * 2. 后续已经有序，退出比较
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] a, int n){
- int last = 0; // 最后一次交换的索引
- int outIndex = n - 1;
- int innerIndex = n - 1;
- for (int i = 0; i < outIndex; i++) {
- // 是否发生交换， 发生 仍未有序； 未发生 已有序
- boolean flag = false;
- if (last != 0) {
- innerIndex = last;
- }
- for (int j = 0; j < innerIndex; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- flag = true;
- last = j;
- }
- }
- if (!flag) {
- break;
- }
- }
- }
diff --git a/codes/jakobz/18423069.java b/codes/jakobz/18423069.java
deleted file mode 100644
index b9fa2036..00000000
--- a/codes/jakobz/18423069.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 1; j < n - i; j++) {
- if(a[j - 1] > a[j]) {
- int tmp = a[j - 1];
- a[j - 1] = a[j];
- a[j] = tmp;
- }
- }
- }
-} //end
diff --git a/codes/java0111/15636073.java b/codes/java0111/15636073.java
deleted file mode 100644
index 855496ea..00000000
--- a/codes/java0111/15636073.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = n - 1; i > 0; i--){
- for(int j = 0; j < i; j++){
- if(a[j] > a[j + 1]){
- int tem = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tem;
- }
- }
- }
-
-} //end
diff --git a/codes/jayjay/9955470.java b/codes/jayjay/9955470.java
deleted file mode 100644
index 82b73c8f..00000000
--- a/codes/jayjay/9955470.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-} //end
-
diff --git a/codes/jbace2/.keep b/codes/jbace2/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/jbace2/10041152.java b/codes/jbace2/10041152.java
deleted file mode 100644
index 29d27043..00000000
--- a/codes/jbace2/10041152.java
+++ /dev/null
@@ -1,23 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n-1; i++) {
- for (int j = 0; j < n-1-i; j++) {
- if (a[j] >= a[j+1]) {
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
- System.out.print("冒泡排序的结果是： ");
- for (int i : a) {
- System.out.print(i + " ");
- }
-} //end
\ No newline at end of file
diff --git a/codes/jerrywang/.keep b/codes/jerrywang/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/jerrywang/10972482.java b/codes/jerrywang/10972482.java
deleted file mode 100644
index 862a031b..00000000
--- a/codes/jerrywang/10972482.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int m=0 ; ma[q+1]) {
- int temp=a[q];
- a[q]=a[q+1];
- a[q+1]=temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/jerrywang/10972482.java] b/codes/jerrywang/10972482.java]
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/jerrywang1982/15623035.java b/codes/jerrywang1982/15623035.java
deleted file mode 100644
index c4ea1137..00000000
--- a/codes/jerrywang1982/15623035.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * 使用冒泡排序算法对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n){
- // 外层循环，控制排序的轮数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环，负责每轮的比较和交换
- for (int j = 0; j < n - i - 1; j++) {
- // 如果当前元素大于下一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/jggttcd55/.keep b/codes/jggttcd55/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/jggttcd55/15828240.java b/codes/jggttcd55/15828240.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/jggttcd55/15828240.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/jgjfvj767/.keep b/codes/jgjfvj767/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/jgjfvj767/15743251.java b/codes/jgjfvj767/15743251.java
deleted file mode 100644
index 96508c13..00000000
--- a/codes/jgjfvj767/15743251.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/jiacheng/.keep b/codes/jiacheng/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/jiacheng/15830646.java b/codes/jiacheng/15830646.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/jiacheng/15830646.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/jiacheng02/.keep b/codes/jiacheng02/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/jiacheng02/15830816.java b/codes/jiacheng02/15830816.java
deleted file mode 100644
index c3018cab..00000000
--- a/codes/jiacheng02/15830816.java
+++ /dev/null
@@ -1,20 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
- } //end
\ No newline at end of file
diff --git a/codes/jianghao/15366705.java b/codes/jianghao/15366705.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/jianghao/15366705.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/jiasrt/15781311.java b/codes/jiasrt/15781311.java
deleted file mode 100644
index cac0dcf1..00000000
--- a/codes/jiasrt/15781311.java
+++ /dev/null
@@ -1,28 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- if (n <= 1) return; // 如果数组长度小于等于1，不需要排序
-
- boolean swapped;
- for (int i = 0; i < n - 1; i++) {
- swapped = false;
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换a[j]和a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- swapped = true;
- }
- }
- // 如果这一轮没有发生交换，说明数组已经有序，退出排序
- if (!swapped) {
- break;
- }
- }
-} //end
-
diff --git a/codes/jiayinzinc/.keep b/codes/jiayinzinc/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/jiayinzinc/15845797.java b/codes/jiayinzinc/15845797.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/jiayinzinc/15845797.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/jichen/12429463.java b/codes/jichen/12429463.java
deleted file mode 100644
index d2207f85..00000000
--- a/codes/jichen/12429463.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; ++j) {
- if(a[j] > a[j + 1]) {
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-} //end
diff --git a/codes/jideliy89mxp/10942446.java b/codes/jideliy89mxp/10942446.java
deleted file mode 100644
index c05a772d..00000000
--- a/codes/jideliy89mxp/10942446.java
+++ /dev/null
@@ -1,24 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int temp;
- for (int i = 0; i < n - 1; i++) {
- int count = 0;
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- count++;
- }
- }
- if (count == 0) {
- break;
- }
- }
-} //end
diff --git a/codes/jieming/.keep b/codes/jieming/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/jieming/15831124.java b/codes/jieming/15831124.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/jieming/15831124.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/jijing/.keep b/codes/jijing/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/jijing/15866624.java b/codes/jijing/15866624.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/jijing/15866624.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/jingge15116238811/10969429.java b/codes/jingge15116238811/10969429.java
deleted file mode 100644
index deb24387..00000000
--- a/codes/jingge15116238811/10969429.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i=0 ; ia[k+1]) {
- int temp=a[k];
- a[k]=a[k+1];
- a[k+1]=temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/jingqing3948/15533535.java b/codes/jingqing3948/15533535.java
deleted file mode 100644
index 441eb896..00000000
--- a/codes/jingqing3948/15533535.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int i,j;
- for(i=0;ia[j+1]){
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-
-
-} //end
diff --git a/codes/jinguo/15825503.java b/codes/jinguo/15825503.java
deleted file mode 100644
index e6de3002..00000000
--- a/codes/jinguo/15825503.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。
- * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/jinjin1234567/15628228.java b/codes/jinjin1234567/15628228.java
deleted file mode 100644
index eb29d98e..00000000
--- a/codes/jinjin1234567/15628228.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 依次比较相邻的元素，如果顺序错误就交换它们，遍历数组的工作是重复地进行直到没有再需要交换，也就是说该数组已经排序完成。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制需要比较的趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每趟比较的次数
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/jinpeng/.keep b/codes/jinpeng/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/jinpeng/15794435.java b/codes/jinpeng/15794435.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/jinpeng/15794435.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/jinshi/.keep b/codes/jinshi/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/jinshi/15846626.java b/codes/jinshi/15846626.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/jinshi/15846626.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/jinxin177/15759096.java b/codes/jinxin177/15759096.java
deleted file mode 100644
index 76cbddd8..00000000
--- a/codes/jinxin177/15759096.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int b = 0; b < n - i - 1; b++) {
- if(a[b] > a[b + 1]) {
- int temp = a[b];
- a [b] = a[b + 1];
- a[b + 1] = temp;
- }
- }
- }
-
-
-} //end
diff --git a/codes/jinya123/15684545.java b/codes/jinya123/15684545.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/jinya123/15684545.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/jinyuan/.keep b/codes/jinyuan/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/jinyuan/15867508.java b/codes/jinyuan/15867508.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/jinyuan/15867508.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/jiucai131/11476990.java b/codes/jiucai131/11476990.java
deleted file mode 100644
index 1c888994..00000000
--- a/codes/jiucai131/11476990.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/jiujiu/15555981.java b/codes/jiujiu/15555981.java
deleted file mode 100644
index ccf5e94f..00000000
--- a/codes/jiujiu/15555981.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * 将无序数组通过冒泡排序算法变得有序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 外层循环控制排序趟数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环负责每次趟的比较和交换
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素比后一个元素大，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
- // 数组a现在已经变得有序
-} //end
diff --git a/codes/jiujiuhaizi/.keep b/codes/jiujiuhaizi/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/jiujiuhaizi/10972159.java b/codes/jiujiuhaizi/10972159.java
deleted file mode 100644
index 4879af62..00000000
--- a/codes/jiujiuhaizi/10972159.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- n=a[j];
- a[j]=a[j+1];
- a[j+1]=n;
- }
- }
- }
- for(int i=0;i a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/jkgao007/10515263.java b/codes/jkgao007/10515263.java
deleted file mode 100644
index e712e076..00000000
--- a/codes/jkgao007/10515263.java
+++ /dev/null
@@ -1,23 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n-1; i++) {
- for (int j = 0; j < n-1-i; j++) {
- if (a[j] >= a[j+1]) {
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
- System.out.print("冒泡排序的结果是： ");
- for (int i : a) {
- System.out.print(i + " ");
- }
-} //end
diff --git a/codes/jkxllj/15631418.java b/codes/jkxllj/15631418.java
deleted file mode 100644
index d24a24b8..00000000
--- a/codes/jkxllj/15631418.java
+++ /dev/null
@@ -1,19 +0,0 @@
-
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i=0;ia[j+1]){
- int temp=a[j+1];
- a[j+1]=a[j];
- a[j]=temp;
- }
- }
- }
-} //end
diff --git a/codes/jmdajiang/.keep b/codes/jmdajiang/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/jmdajiang/15764743.java b/codes/jmdajiang/15764743.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/jmdajiang/15764743.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/jokemanfire/11650604.java b/codes/jokemanfire/11650604.java
deleted file mode 100644
index 62d1c299..00000000
--- a/codes/jokemanfire/11650604.java
+++ /dev/null
@@ -1,13 +0,0 @@
-public static void bubbleSort(int []a,int n)
-{
- for(int i = 0 ;i< a.length -1; i++){
- for(int j = 0; ja[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
-
- }
-}
diff --git a/codes/jony2258/15804822.java b/codes/jony2258/15804822.java
deleted file mode 100644
index ce4123f3..00000000
--- a/codes/jony2258/15804822.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素两两比较和交换，使得每一轮过后最大（或最小）的元素被交换到序列末尾
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序的轮数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮的比较次数
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/joohwan/16200342.java b/codes/joohwan/16200342.java
deleted file mode 100644
index 044bc48a..00000000
--- a/codes/joohwan/16200342.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
-
diff --git a/codes/jpq110/.java b/codes/jpq110/.java
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/jpq110/15848383.java b/codes/jpq110/15848383.java
deleted file mode 100644
index ab3d8f39..00000000
--- a/codes/jpq110/15848383.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/juanmaola/15776278.java b/codes/juanmaola/15776278.java
deleted file mode 100644
index a73834e9..00000000
--- a/codes/juanmaola/15776278.java
+++ /dev/null
@@ -1,26 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素之间的比较和交换，将无序数组变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- // 标记变量，用于优化，如果在一趟排序中没有交换，则数组已经有序
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 发生了交换，将标记设为true
- swapped = true;
- }
- }
- // 如果在内层循环中没有发生交换，则数组已经有序，提前退出
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/juking/10340196.java b/codes/juking/10340196.java
deleted file mode 100644
index 2427354d..00000000
--- a/codes/juking/10340196.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] array, int n){
- // 你的代码，使无序数组 array 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < n - 1; j++) {
- if (array[j] > array[j + 1]) {
- // Swap the elements
- int temp = array[j];
- array[j] = array[j + 1];
- array[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/jyz1092752421/15867277.java b/codes/jyz1092752421/15867277.java
deleted file mode 100644
index 24f513b3..00000000
--- a/codes/jyz1092752421/15867277.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/k8scat/11864664.java b/codes/k8scat/11864664.java
deleted file mode 100644
index 43bde320..00000000
--- a/codes/k8scat/11864664.java
+++ /dev/null
@@ -1,12 +0,0 @@
-public static void bubbleSort(int[] arr, int n) {
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (arr[j] > arr[j + 1]) {
- // 交换arr[j]和arr[j+1]
- int temp = arr[j];
- arr[j] = arr[j + 1];
- arr[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/kaiSYJ/15488956.java b/codes/kaiSYJ/15488956.java
deleted file mode 100644
index cc79a009..00000000
--- a/codes/kaiSYJ/15488956.java
+++ /dev/null
@@ -1,28 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过比较相邻的元素来工作，如果它们的顺序错误就把它们交换过来。
- * 遍历数组的工作是重复地进行直到没有再需要交换，也就是说该数组已经排序完成。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- // 标记变量，用于检测在一次遍历中是否发生了交换
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果当前元素大于下一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 标记发生了交换
- swapped = true;
- }
- }
- // 如果在一次遍历中没有发生交换，说明数组已经有序，可以提前结束
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/kaiSYJ/15589878.java b/codes/kaiSYJ/15589878.java
deleted file mode 100644
index 1e66d7f4..00000000
--- a/codes/kaiSYJ/15589878.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 功能：对数组进行冒泡排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/kakki1003/18431839.java b/codes/kakki1003/18431839.java
deleted file mode 100644
index 6062f3d5..00000000
--- a/codes/kakki1003/18431839.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++){
- for(int j = 0; j < n - i - 1; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-}
-//end
diff --git a/codes/kangwang/11615067.java b/codes/kangwang/11615067.java
deleted file mode 100644
index 7dd5e476..00000000
--- a/codes/kangwang/11615067.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int temp = a[i];
- a[i] = a[j];
- a[j] = temp;
- }
- }
- }
-
-
-} //end
diff --git a/codes/kankanha/15775398.java b/codes/kankanha/15775398.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/kankanha/15775398.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/kankanya/15772087.java b/codes/kankanya/15772087.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/kankanya/15772087.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/katooo/11209021.java b/codes/katooo/11209021.java
deleted file mode 100644
index c1ef133d..00000000
--- a/codes/katooo/11209021.java
+++ /dev/null
@@ -1,19 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- } //end
-
diff --git a/codes/kekene/15777867.java b/codes/kekene/15777867.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/kekene/15777867.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/kikiya/15846231.java b/codes/kikiya/15846231.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/kikiya/15846231.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/kingzhuo666/.keep b/codes/kingzhuo666/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/kingzhuo666/15846704.java b/codes/kingzhuo666/15846704.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/kingzhuo666/15846704.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/kira11535/15774608.java b/codes/kira11535/15774608.java
deleted file mode 100644
index c10daff1..00000000
--- a/codes/kira11535/15774608.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * 这是一个简单的排序算法，通过重复地遍历要排序的数列，一次比较两个元素，
- * 如果他们的顺序错误就把他们交换过来。遍历数列的工作是重复地进行直到没有再需要交换，
- * 也就是说该数列已经排序完成。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/kkya123/15722815.java b/codes/kkya123/15722815.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/kkya123/15722815.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/knight9dog/.keep b/codes/knight9dog/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/knight9dog/15845028.java b/codes/knight9dog/15845028.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/knight9dog/15845028.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/kongbaige/.keep b/codes/kongbaige/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/kongbaige/15845868.java b/codes/kongbaige/15845868.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/kongbaige/15845868.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/konglingdi/9696377.java b/codes/konglingdi/9696377.java
deleted file mode 100644
index fbe4c4fc..00000000
--- a/codes/konglingdi/9696377.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int temp;//定义一个临时变量
- for(int i=0;i a[j + 1]) {
- // 如果前一个元素比后一个元素大，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 标记发生了交换
- swapped = true;
- }
- }
- // 如果在这次遍历中没有发生交换，说明数组已经有序，可以提前结束排序
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/kongshang/15699673.java b/codes/kongshang/15699673.java
deleted file mode 100644
index b33a11ac..00000000
--- a/codes/kongshang/15699673.java
+++ /dev/null
@@ -1,32 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- // 标记变量，用于优化冒泡排序，如果一趟排序中没有发生交换，则说明数组已经有序，可以提前结束排序
- boolean swapped;
- // 外层循环控制遍历次数
- for (int i = 0; i < n - 1; i++) {
- swapped = false;
- // 内层循环负责进行相邻元素的比较和可能的交换
- for (int j = 0; j < n - 1 - i; j++) {
- // 比较相邻的两个元素
- if (a[j] > a[j + 1]) {
- // 如果前一个元素比后一个元素大，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 标记发生了交换
- swapped = true;
- }
- }
- // 如果在这次遍历中没有发生交换，说明数组已经有序，可以提前结束排序
- if (!swapped) {
- break;
- }
- }
-} //end
-
diff --git a/codes/kongshang/15700235.java b/codes/kongshang/15700235.java
deleted file mode 100644
index 94a5caab..00000000
--- a/codes/kongshang/15700235.java
+++ /dev/null
@@ -1,31 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- // 标记变量，用于优化冒泡排序，如果一趟排序中没有发生交换，则说明数组已经有序，可以提前结束排序
- boolean swapped;
- // 外层循环控制遍历次数
- for (int i = 0; i < n - 1; i++) {
- swapped = false;
- // 内层循环负责进行相邻元素的比较和可能的交换
- for (int j = 0; j < n - 1 - i; j++) {
- // 比较相邻的两个元素
- if (a[j] > a[j + 1]) {
- // 如果前一个元素比后一个元素大，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 标记发生了交换
- swapped = true;
- }
- }
- // 如果在这次遍历中没有发生交换，说明数组已经有序，可以提前结束排序
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/kristira/15804034.java b/codes/kristira/15804034.java
deleted file mode 100644
index ce4123f3..00000000
--- a/codes/kristira/15804034.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素两两比较和交换，使得每一轮过后最大（或最小）的元素被交换到序列末尾
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序的轮数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮的比较次数
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/kukuku123/.15650271.java.swp b/codes/kukuku123/.15650271.java.swp
deleted file mode 100644
index e4f0cdf5fb22bc307950f49b04a5fe256ad20642..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001
literal 12288
zcmeI1%TE(g6vi*EMTxr9(=!fw9e@w
z(8{cv-M&{4qN%E0=>ID!Ey31WS?;Xu(Zu@tww^k7y?)=@a$w6tE1@8HbfsI-dmLS!
zHdXZt9@XpX67B}AOLSKYVohz0%Y9XJwoBd8fgCu11dzaC36wThyT#n6e(}P2diqrJ
zVH4p#B!C2v01`j~NB{{S0VIF~jvxWOql7#H-^cRakLP2_UoqdsfCP{L5MGNBhAm_^=lkyYrc)bsnB%W7|Bs&bHIJT18ii
z?Mf-QYM{z*N0yuA*`gaBUS(rD*?|xXkMfO0KC=w~a`oo3(f-WJfISs(h+v51>hu-g
zO!MhMEzm&vs37QI{%1Z#Yn|0yvf&QYyb)y
zsXaayV~Gg(Fq6YnqAc=^rRR8b90o~8Q1&Yx+NDc6gl<*wQaLEge&0=1({l%M`wo?^
zQ0r&{6>tKT0*GGgkTmHYxMArLi&`QAHSG%7nLUhW05Y;=;p
QU$ir^$0^7}gvv_t3mHFI*8l(j
diff --git a/codes/kukuku123/15650271.java b/codes/kukuku123/15650271.java
deleted file mode 100644
index 607b6ee3..00000000
--- a/codes/kukuku123/15650271.java
+++ /dev/null
@@ -1,24 +0,0 @@
-/**
- * 冒泡排序函数
- * 对输入的整数数组a进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- if (a == null || n <= 0) {
- return;
- }
-
- // 外层循环控制遍历次数，最多需要遍历n-1轮
- for (int i = 0; i < n - 1; i++) {
- // 内层循环用来比较并交换相邻元素，每轮结束后最大的元素会被排到末尾
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果当前元素大于下一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/kunleya/15775724.java b/codes/kunleya/15775724.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/kunleya/15775724.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/kunzhi/.keep b/codes/kunzhi/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/kunzhi/15606505.java b/codes/kunzhi/15606505.java
deleted file mode 100644
index 20575dc4..00000000
--- a/codes/kunzhi/15606505.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/kuqiu123/15585804.java b/codes/kuqiu123/15585804.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/kuqiu123/15585804.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/kyi667gfhg/.keep b/codes/kyi667gfhg/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/kyi667gfhg/15831315.java b/codes/kyi667gfhg/15831315.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/kyi667gfhg/15831315.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/l1017026323/15630469.java b/codes/l1017026323/15630469.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/l1017026323/15630469.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/l15872381947/15962935.java b/codes/l15872381947/15962935.java
deleted file mode 100644
index ac3b4d24..00000000
--- a/codes/l15872381947/15962935.java
+++ /dev/null
@@ -1,13 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1])
- {
- int temp=a[j+1];
- a[j+1]=a[j];
- a[j]=temp;
- }
- }
-} //end
diff --git a/codes/l18877577615/15776334.java b/codes/l18877577615/15776334.java
deleted file mode 100644
index 5565f3e2..00000000
--- a/codes/l18877577615/15776334.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数用于对给定数组进行冒泡排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
-
diff --git a/codes/l2746415679/15850006.java b/codes/l2746415679/15850006.java
deleted file mode 100644
index 809e6c45..00000000
--- a/codes/l2746415679/15850006.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素两两比较和交换，使得每一轮循环后最大（或最小）的元素“冒泡”到数组的末尾。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮比较的次数
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- // 交换 a[j] 和 a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/l3112624513/15836906.java b/codes/l3112624513/15836906.java
deleted file mode 100644
index 47e0d6ef..00000000
--- a/codes/l3112624513/15836906.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 功能：对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 遍历数组，从第一个元素到倒数第二个元素
- for (int j = 0; j < n - 1 - i; j++) { // 每次比较相邻的元素，最后一个元素已经是当前轮的最大值，无需再比较
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/l5211314/15854497.java b/codes/l5211314/15854497.java
deleted file mode 100644
index db00df43..00000000
--- a/codes/l5211314/15854497.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组进行冒泡排序，使得数组中的元素按从小到大的顺序排列
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 外层循环控制排序趟数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环负责进行每趟排序，通过相邻元素的比较和交换来移动较大元素到数组的末尾
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
- // 经过 n-1 趟排序后，数组已经变为有序
-} // end
diff --git a/codes/lailailai/11211174.java b/codes/lailailai/11211174.java
deleted file mode 100644
index 272a12fc..00000000
--- a/codes/lailailai/11211174.java
+++ /dev/null
@@ -1,18 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- } //end
\ No newline at end of file
diff --git a/codes/lala12/15700256.java b/codes/lala12/15700256.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/lala12/15700256.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/lambdang/11472883.java b/codes/lambdang/11472883.java
deleted file mode 100644
index 8c505501..00000000
--- a/codes/lambdang/11472883.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;i a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/lan0bo/11297643.java b/codes/lan0bo/11297643.java
deleted file mode 100644
index 4d7083fe..00000000
--- a/codes/lan0bo/11297643.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int i, j;
-
- for(i=0; ia[j]){
- int temp;
- temp = a[j-1];
- a[j-1] = a[j];
- a[j] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/lanlan/11115524.java b/codes/lanlan/11115524.java
deleted file mode 100644
index ba8c52af..00000000
--- a/codes/lanlan/11115524.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 1; j < n - i; j++) {
- if(a[j - 1] > a[j]) {
- int temp = a[j - 1];
- a[j - 1] = a[j];
- a[j] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/lanlanya/15684957.java b/codes/lanlanya/15684957.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/lanlanya/15684957.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/laomocy/.keep b/codes/laomocy/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/laomocy/15768870.java b/codes/laomocy/15768870.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/laomocy/15768870.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/laoshifu/15520696.java b/codes/laoshifu/15520696.java
deleted file mode 100644
index c82f33f1..00000000
--- a/codes/laoshifu/15520696.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过不断比较相邻元素，将较大的元素交换到数组的末尾，经过n-1轮比较后，数组变得有序。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制需要比较的轮数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮比较的次数
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
\ No newline at end of file
diff --git a/codes/last123/15721253.java b/codes/last123/15721253.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/last123/15721253.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/lbhusvkfj/15582699.java b/codes/lbhusvkfj/15582699.java
deleted file mode 100644
index 23d208a4..00000000
--- a/codes/lbhusvkfj/15582699.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换a[j]和a[j+1]的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/lc12345678/15853848.java b/codes/lc12345678/15853848.java
deleted file mode 100644
index db00df43..00000000
--- a/codes/lc12345678/15853848.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组进行冒泡排序，使得数组中的元素按从小到大的顺序排列
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 外层循环控制排序趟数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环负责进行每趟排序，通过相邻元素的比较和交换来移动较大元素到数组的末尾
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
- // 经过 n-1 趟排序后，数组已经变为有序
-} // end
diff --git a/codes/lee001/15817464.java b/codes/lee001/15817464.java
deleted file mode 100644
index 2851642b..00000000
--- a/codes/lee001/15817464.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * 使用冒泡排序算法对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 外层循环控制排序的轮数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环负责两两相邻元素的比较和交换
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/legary/18735642.java b/codes/legary/18735642.java
deleted file mode 100644
index 335d2e15..00000000
--- a/codes/legary/18735642.java
+++ /dev/null
@@ -1,18 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n - 1; i++){
- for(int j = 0; j < n - i - 1; j++){
- if(a[j] > a[j + 1]){
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
- } //end
diff --git a/codes/leikaiya/15772650.java b/codes/leikaiya/15772650.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/leikaiya/15772650.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/leikaya/15772650.java b/codes/leikaya/15772650.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/leikaya/15772650.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/leitongjiang2/.keep b/codes/leitongjiang2/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/leitongjiang2/15757898 b/codes/leitongjiang2/15757898
deleted file mode 100644
index 6426772f..00000000
--- a/codes/leitongjiang2/15757898
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/leitongjiang2/15757898.java b/codes/leitongjiang2/15757898.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/leitongjiang2/15757898.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/lelewa/15846345.java b/codes/lelewa/15846345.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/lelewa/15846345.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/leoaeon/15620248.java b/codes/leoaeon/15620248.java
deleted file mode 100644
index 796a4e92..00000000
--- a/codes/leoaeon/15620248.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
-
diff --git a/codes/leshan/.keep b/codes/leshan/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/leshan/15799241.java b/codes/leshan/15799241.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/leshan/15799241.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/levi123/15859682.java b/codes/levi123/15859682.java
deleted file mode 100644
index 271d2f1d..00000000
--- a/codes/levi123/15859682.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 将数组a按照从小到大的顺序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- // 交换a[j]和a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/lgy1584899472/15607389.java b/codes/lgy1584899472/15607389.java
deleted file mode 100644
index ae82e695..00000000
--- a/codes/lgy1584899472/15607389.java
+++ /dev/null
@@ -1,35 +0,0 @@
-/**
-
- * 冒泡排序函数
-
- * aa bb cc
-
- * @param a 待排序的数组
-
- * @param n 待排序的数组长度
-
- */
-
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0; i < n-1 ; i++){
-
- for (int j = 0;j < n-1-i;j++){
-
- if(a[j] > a[j+1]){
-
- int temp = a[j];
-
- a[j] = a[j+1];
-
- a[j+1] = temp;
-
- }
-
- }
-
- }
-
-
-
-} //end
diff --git a/codes/lh775123/.keep b/codes/lh775123/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/lh775123/15815281.java b/codes/lh775123/15815281.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/lh775123/15815281.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/lhcoder/15630391.java b/codes/lhcoder/15630391.java
deleted file mode 100644
index 9de98c3f..00000000
--- a/codes/lhcoder/15630391.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组进行冒泡排序，使其变得有序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 外层循环，控制需要排序的轮数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环，控制每轮需要比较的次数
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果当前元素大于下一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/lhtcn/.keep b/codes/lhtcn/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/lhtscavc/.keep b/codes/lhtscavc/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/lhtscavc/15710834.java b/codes/lhtscavc/15710834.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/lhtscavc/15710834.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/lhzs123/15684690.java b/codes/lhzs123/15684690.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/lhzs123/15684690.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/li781117/15518855.java b/codes/li781117/15518855.java
deleted file mode 100644
index 64e12936..00000000
--- a/codes/li781117/15518855.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组a进行冒泡排序，使其变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- // 如果当前元素大于下一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/liaojiji/15699956.java b/codes/liaojiji/15699956.java
deleted file mode 100644
index 854beb62..00000000
--- a/codes/liaojiji/15699956.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
-
diff --git a/codes/liaoxinghai/15778644.java b/codes/liaoxinghai/15778644.java
deleted file mode 100644
index ebd673ca..00000000
--- a/codes/liaoxinghai/15778644.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int[] a, int n) {
- for(int i = 0; i < n-1; i++) {
- for(int j = i+1; j < n; j++) {
- if(a[i]>a[j]) {
- int temp = a[i];
- a[i] = a[j];
- a[j] = temp;
- }
- }
- }
-}
diff --git a/codes/lideshengdsb/15545860.java b/codes/lideshengdsb/15545860.java
deleted file mode 100644
index 2252b818..00000000
--- a/codes/lideshengdsb/15545860.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/lidongshi/10229157.java b/codes/lidongshi/10229157.java
deleted file mode 100644
index 33f02428..00000000
--- a/codes/lidongshi/10229157.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n-1; i++) {
- for (int j = i+1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[i];
- a[i] = a[j];
- a[j] = temp;
- }
- }
- }
-} //end
diff --git a/codes/lienbj/18149367.java b/codes/lienbj/18149367.java
deleted file mode 100644
index 6bb9364b..00000000
--- a/codes/lienbj/18149367.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int temp;
- for(int i = 0; i < n; i++){
- for(int j = 0;j < n - 1 - i; j++){
- if(a[j] > a[j+1]){
- temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/lige123/.keep b/codes/lige123/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/lige123/15798937.java b/codes/lige123/15798937.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/lige123/15798937.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/lihai18898/15807887.java b/codes/lihai18898/15807887.java
deleted file mode 100644
index 166dea5d..00000000
--- a/codes/lihai18898/15807887.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数通过冒泡排序算法对数组进行排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮的比较次数
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/lihaoran887/.keep b/codes/lihaoran887/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/lihaoran887/15815869.java b/codes/lihaoran887/15815869.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/lihaoran887/15815869.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/lihuizhe666/15774599.java b/codes/lihuizhe666/15774599.java
deleted file mode 100644
index 50396104..00000000
--- a/codes/lihuizhe666/15774599.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 将数组a按照从小到大的顺序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制所有元素都参与比较
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环负责相邻元素两两比较
- if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/lili183/15775952.java b/codes/lili183/15775952.java
deleted file mode 100644
index 4b863ff8..00000000
--- a/codes/lili183/15775952.java
+++ /dev/null
@@ -1,26 +0,0 @@
-/**
- * 冒泡排序函数
- * 使用冒泡排序算法对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- // 标志位，用于检测是否发生过交换，如果没有交换，说明数组已经有序
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 发生了交换，标志位设为true
- swapped = true;
- }
- }
- // 如果在内层循环中没有发生过交换，说明数组已经有序，提前结束排序
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/linchong/9954468.java b/codes/linchong/9954468.java
deleted file mode 100644
index 10dbc652..00000000
--- a/codes/linchong/9954468.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-} //end
diff --git a/codes/linliangdong/.keep b/codes/linliangdong/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/linliangdong/15764880.java b/codes/linliangdong/15764880.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/linliangdong/15764880.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/linling0421/.keep b/codes/linling0421/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/linling0421/10979563.java b/codes/linling0421/10979563.java
deleted file mode 100644
index ecc6b910..00000000
--- a/codes/linling0421/10979563.java
+++ /dev/null
@@ -1,12 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
-
diff --git a/codes/linlingEdu/.keep b/codes/linlingEdu/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/linlingEdu/15815233.java b/codes/linlingEdu/15815233.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/linlingEdu/15815233.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/liquor/11292981.java b/codes/liquor/11292981.java
deleted file mode 100644
index 1c888994..00000000
--- a/codes/liquor/11292981.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/lishugood1/.keep b/codes/lishugood1/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/lishugood1/15846106.java b/codes/lishugood1/15846106.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/lishugood1/15846106.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/lisonghao/15710966.java b/codes/lisonghao/15710966.java
deleted file mode 100644
index 7ec373ae..00000000
--- a/codes/lisonghao/15710966.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过对相邻的元素进行两两比较，顺序相反则进行交换，每一轮比较会将当前未排序部分的最大值“冒泡”到未排序部分的末尾。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制所有轮数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮比较的次数
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/liuYanFen/15720723.java b/codes/liuYanFen/15720723.java
deleted file mode 100644
index 543adb54..00000000
--- a/codes/liuYanFen/15720723.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数使用冒泡排序算法对数组进行排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换数组元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
-
diff --git a/codes/liu_chen_yang/15629230.java b/codes/liu_chen_yang/15629230.java
deleted file mode 100644
index 4d7083fe..00000000
--- a/codes/liu_chen_yang/15629230.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int i, j;
-
- for(i=0; ia[j]){
- int temp;
- temp = a[j-1];
- a[j-1] = a[j];
- a[j] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/liugela/.keep b/codes/liugela/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/liugela/15756309.java b/codes/liugela/15756309.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/liugela/15756309.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/liuguanghui/15875503.java b/codes/liuguanghui/15875503.java
deleted file mode 100644
index ae82e695..00000000
--- a/codes/liuguanghui/15875503.java
+++ /dev/null
@@ -1,35 +0,0 @@
-/**
-
- * 冒泡排序函数
-
- * aa bb cc
-
- * @param a 待排序的数组
-
- * @param n 待排序的数组长度
-
- */
-
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0; i < n-1 ; i++){
-
- for (int j = 0;j < n-1-i;j++){
-
- if(a[j] > a[j+1]){
-
- int temp = a[j];
-
- a[j] = a[j+1];
-
- a[j+1] = temp;
-
- }
-
- }
-
- }
-
-
-
-} //end
diff --git a/codes/liuguangsen0409/15717549.java b/codes/liuguangsen0409/15717549.java
deleted file mode 100644
index 0b2f4392..00000000
--- a/codes/liuguangsen0409/15717549.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 功能：对数组a进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每一趟排序多少次
- if (a[j] > a[j + 1]) { // 如果前一个数比后一个数大，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/liujiayi/10517239.java b/codes/liujiayi/10517239.java
deleted file mode 100644
index a66b179e..00000000
--- a/codes/liujiayi/10517239.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 1; j < n - i; j++) {
- if(a[j - 1] > a[j]) {
- int temp = a[j - 1];
- a[j - 1] = a[j];
- a[j] = temp;
- }
- }
- }
-} //end
diff --git a/codes/liujin_long/15778303.java b/codes/liujin_long/15778303.java
deleted file mode 100644
index 2252b818..00000000
--- a/codes/liujin_long/15778303.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/liulink/15774650.java b/codes/liulink/15774650.java
deleted file mode 100644
index bd0ba763..00000000
--- a/codes/liulink/15774650.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 将一个整数数组按照从小到大的顺序进行排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果前一个元素比后一个元素大，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/liuyctt12/15630469.java b/codes/liuyctt12/15630469.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/liuyctt12/15630469.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/liuyiyi/15714289.java b/codes/liuyiyi/15714289.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/liuyiyi/15714289.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/liuyupeng999/.keep b/codes/liuyupeng999/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/liuyupeng999/15845114.java b/codes/liuyupeng999/15845114.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/liuyupeng999/15845114.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/liuyuxuan666/.keep b/codes/liuyuxuan666/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/liuyuxuan666/15815202.java b/codes/liuyuxuan666/15815202.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/liuyuxuan666/15815202.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/liwei2496/11466656.java b/codes/liwei2496/11466656.java
deleted file mode 100644
index 272a12fc..00000000
--- a/codes/liwei2496/11466656.java
+++ /dev/null
@@ -1,18 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- } //end
\ No newline at end of file
diff --git a/codes/lixiang1996/15516370.java b/codes/lixiang1996/15516370.java
deleted file mode 100644
index de06d4bd..00000000
--- a/codes/lixiang1996/15516370.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/liyanfen/15875628.java b/codes/liyanfen/15875628.java
deleted file mode 100644
index ae82e695..00000000
--- a/codes/liyanfen/15875628.java
+++ /dev/null
@@ -1,35 +0,0 @@
-/**
-
- * 冒泡排序函数
-
- * aa bb cc
-
- * @param a 待排序的数组
-
- * @param n 待排序的数组长度
-
- */
-
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0; i < n-1 ; i++){
-
- for (int j = 0;j < n-1-i;j++){
-
- if(a[j] > a[j+1]){
-
- int temp = a[j];
-
- a[j] = a[j+1];
-
- a[j+1] = temp;
-
- }
-
- }
-
- }
-
-
-
-} //end
diff --git a/codes/liyanfen1/15607550.java b/codes/liyanfen1/15607550.java
deleted file mode 100644
index ae82e695..00000000
--- a/codes/liyanfen1/15607550.java
+++ /dev/null
@@ -1,35 +0,0 @@
-/**
-
- * 冒泡排序函数
-
- * aa bb cc
-
- * @param a 待排序的数组
-
- * @param n 待排序的数组长度
-
- */
-
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0; i < n-1 ; i++){
-
- for (int j = 0;j < n-1-i;j++){
-
- if(a[j] > a[j+1]){
-
- int temp = a[j];
-
- a[j] = a[j+1];
-
- a[j+1] = temp;
-
- }
-
- }
-
- }
-
-
-
-} //end
diff --git a/codes/liyanyan/15864049.java b/codes/liyanyan/15864049.java
deleted file mode 100644
index ae82e695..00000000
--- a/codes/liyanyan/15864049.java
+++ /dev/null
@@ -1,35 +0,0 @@
-/**
-
- * 冒泡排序函数
-
- * aa bb cc
-
- * @param a 待排序的数组
-
- * @param n 待排序的数组长度
-
- */
-
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0; i < n-1 ; i++){
-
- for (int j = 0;j < n-1-i;j++){
-
- if(a[j] > a[j+1]){
-
- int temp = a[j];
-
- a[j] = a[j+1];
-
- a[j+1] = temp;
-
- }
-
- }
-
- }
-
-
-
-} //end
diff --git a/codes/liyou041/15836638.java b/codes/liyou041/15836638.java
deleted file mode 100644
index 46e1fc36..00000000
--- a/codes/liyou041/15836638.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过不断地交换相邻的两个元素（如果它们的顺序错误）来对数组进行排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git "a/codes/liyou041/\345\244\215\345\210\266\347\232\204" "b/codes/liyou041/\345\244\215\345\210\266\347\232\204"
deleted file mode 100644
index 46e1fc36..00000000
--- "a/codes/liyou041/\345\244\215\345\210\266\347\232\204"
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过不断地交换相邻的两个元素（如果它们的顺序错误）来对数组进行排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/lj18263537279/.keep b/codes/lj18263537279/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/lj18263537279/10972375.java b/codes/lj18263537279/10972375.java
deleted file mode 100644
index 9eccfac5..00000000
--- a/codes/lj18263537279/10972375.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/ljc13512881480/15775859.java b/codes/ljc13512881480/15775859.java
deleted file mode 100644
index fb4ccc5d..00000000
--- a/codes/ljc13512881480/15775859.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数通过冒泡排序算法对待排序的数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 外层循环控制排序的轮数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环控制每一轮的比较次数
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/ll13174074984/.keep b/codes/ll13174074984/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/ll13174074984/10972293.java b/codes/ll13174074984/10972293.java
deleted file mode 100644
index 9eccfac5..00000000
--- a/codes/ll13174074984/10972293.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/ll13808780223/15790801.java b/codes/ll13808780223/15790801.java
deleted file mode 100644
index 33be1b95..00000000
--- a/codes/ll13808780223/15790801.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
-* 冒泡排序函数
-* aa bb cc
-* @param a 待排序的数组
-* @param n 待排序的数组长度
-*/
-public static void bubbleSort(int [] a, int n){
-// 你的代码，使无序数组 a 变得有序
-for (int i = 0; i < n - 1; i++) {
-for (int j = 0; j < n - i - 1; j++) {
-if (a[j] > a[j + 1]) {
-// 交换元素
-int temp = a[j];
-a[j] = a[j + 1];
-a[j + 1] = temp;
-}
-}
-}
-} //end
diff --git a/codes/lmc666/15632201.java b/codes/lmc666/15632201.java
deleted file mode 100644
index 20575dc4..00000000
--- a/codes/lmc666/15632201.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/lodyn123/15488861.java b/codes/lodyn123/15488861.java
deleted file mode 100644
index f55efd31..00000000
--- a/codes/lodyn123/15488861.java
+++ /dev/null
@@ -1,14 +0,0 @@
- public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0;i < n -1;i++) {
- for(int j = 0;j < n - i -1;j++) {
- if(a[j] > a[j+1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
-
- }
-
- } //end
diff --git a/codes/logic111/.keep b/codes/logic111/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/logic111/15819546.java b/codes/logic111/15819546.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/logic111/15819546.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/lolitot/.keep b/codes/lolitot/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/lolitot/10040248.java b/codes/lolitot/10040248.java
deleted file mode 100644
index 29d27043..00000000
--- a/codes/lolitot/10040248.java
+++ /dev/null
@@ -1,23 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n-1; i++) {
- for (int j = 0; j < n-1-i; j++) {
- if (a[j] >= a[j+1]) {
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
- System.out.print("冒泡排序的结果是： ");
- for (int i : a) {
- System.out.print(i + " ");
- }
-} //end
\ No newline at end of file
diff --git a/codes/long22/11031968.java b/codes/long22/11031968.java
deleted file mode 100644
index 4d3191cf..00000000
--- a/codes/long22/11031968.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a,int n){
- int temp =0;
- for(int i = 0;ia[j+1]){
- temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-
-
-}
diff --git a/codes/long93/15676797.java b/codes/long93/15676797.java
deleted file mode 100644
index e19af71f..00000000
--- a/codes/long93/15676797.java
+++ /dev/null
@@ -1,23 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过重复遍历待排序的数组，比较相邻的元素并交换它们（如果它们在错误的顺序），
- * 直到没有更多的交换需要，即该数组已经排序。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序的趟数
- boolean swapped = false; // 用于标记某一趟是否发生了交换
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每一趟排序多少次
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- swapped = true; // 标记发生了交换
- }
- }
- if (!swapped) { // 如果某一趟没有发生交换，说明数组已经有序，可以提前退出
- break;
- }
- }
-} // end
diff --git a/codes/longquefeng/15835894.java b/codes/longquefeng/15835894.java
deleted file mode 100644
index ae82e695..00000000
--- a/codes/longquefeng/15835894.java
+++ /dev/null
@@ -1,35 +0,0 @@
-/**
-
- * 冒泡排序函数
-
- * aa bb cc
-
- * @param a 待排序的数组
-
- * @param n 待排序的数组长度
-
- */
-
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0; i < n-1 ; i++){
-
- for (int j = 0;j < n-1-i;j++){
-
- if(a[j] > a[j+1]){
-
- int temp = a[j];
-
- a[j] = a[j+1];
-
- a[j+1] = temp;
-
- }
-
- }
-
- }
-
-
-
-} //end
diff --git a/codes/longxiqwe1/.keep b/codes/longxiqwe1/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/longxiqwe1/15842971.java b/codes/longxiqwe1/15842971.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/longxiqwe1/15842971.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/longxixi/18735649.java b/codes/longxixi/18735649.java
deleted file mode 100644
index 7a195dcf..00000000
--- a/codes/longxixi/18735649.java
+++ /dev/null
@@ -1,30 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
-
- for( int i = 0; i < n-1; i++){
- for( int j = 0; j < n-i-1; j++){
- if(a[j]>a[j+1]){
- int b=a[j];
- a[j]=a[j+1];
- a[j+1]=b;
-
- }
-
-
-
-
- }
-
-
-
-
- }
-
-
-} //end
diff --git a/codes/loveer/15720497.java b/codes/loveer/15720497.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/loveer/15720497.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/lovemeatsss/.keep b/codes/lovemeatsss/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/lovemeatsss/15841023.java b/codes/lovemeatsss/15841023.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/lovemeatsss/15841023.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/loveta1/15852677.java b/codes/loveta1/15852677.java
deleted file mode 100644
index db00df43..00000000
--- a/codes/loveta1/15852677.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组进行冒泡排序，使得数组中的元素按从小到大的顺序排列
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 外层循环控制排序趟数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环负责进行每趟排序，通过相邻元素的比较和交换来移动较大元素到数组的末尾
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
- // 经过 n-1 趟排序后，数组已经变为有序
-} // end
diff --git a/codes/lovewang/11307245.java b/codes/lovewang/11307245.java
deleted file mode 100644
index 9e7534d4..00000000
--- a/codes/lovewang/11307245.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡 排序 函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-}//end
\ No newline at end of file
diff --git a/codes/lovingcode3/.keep b/codes/lovingcode3/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/lovingcode3/15844469.java b/codes/lovingcode3/15844469.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/lovingcode3/15844469.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/lovscene/11290992.java b/codes/lovscene/11290992.java
deleted file mode 100644
index cacd12f1..00000000
--- a/codes/lovscene/11290992.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- a[j] = a[j]+a[j+1];
- a[j+1] = a[j]-a[j+1];
- a[j] = a[j]-a[j+1];
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/lsl990410/15777331.java b/codes/lsl990410/15777331.java
deleted file mode 100644
index 4be0c016..00000000
--- a/codes/lsl990410/15777331.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素两两比较，如果顺序错误则交换，直到没有需要交换的元素为止
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/lsmir2/13427738.java b/codes/lsmir2/13427738.java
deleted file mode 100644
index 9038393a..00000000
--- a/codes/lsmir2/13427738.java
+++ /dev/null
@@ -1,41 +0,0 @@
-/**
- * 冒泡排序函数
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- if (n <= 1) {
- return;
- }
-
- /* 最后一次交换的位置 */
- int lastExchangeIndex = 0;
- /* 无序数列的边界，每次只需要比较到这里即可退出循环 */
- int sortedBorder = n - 1;
-
- for (int i = 0; i < n; i++) {
- /* 提前退出冒泡循环的标志位 */
- boolean swapped = false;
-
- for (int j = 0; j < sortedBorder; j++) {
- if (a[j] > a[j + 1]) {
- /* 交换元素 */
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
-
- /* 更新最后一次交换的位置 */
- lastExchangeIndex = j;
- swapped = true;
- }
- }
-
- /* 更新无序数列的边界 */
- sortedBorder = lastExchangeIndex;
-
- /* 如果一次循环中没有发生元素交换，说明已经排序完成，提前退出 */
- if (!swapped) {
- break;
- }
- }
-}
diff --git a/codes/lsnjxkw634/15836665.java b/codes/lsnjxkw634/15836665.java
deleted file mode 100644
index d0e7038d..00000000
--- a/codes/lsnjxkw634/15836665.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。
- * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的次数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一轮比较的次数
- // 如果前一个元素比后一个元素大，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/lsnjxkw635/15847008.java b/codes/lsnjxkw635/15847008.java
deleted file mode 100644
index 809e6c45..00000000
--- a/codes/lsnjxkw635/15847008.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素两两比较和交换，使得每一轮循环后最大（或最小）的元素“冒泡”到数组的末尾。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮比较的次数
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- // 交换 a[j] 和 a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/ltq0319/15757963.java b/codes/ltq0319/15757963.java
deleted file mode 100644
index 7ce620c3..00000000
--- a/codes/ltq0319/15757963.java
+++ /dev/null
@@ -1,28 +0,0 @@
-/**
- * 冒泡排序函数
- * 将无序数组通过冒泡排序算法变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- // 设置一个标志位，用于优化算法，减少不必要的比较
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素比后一个元素大，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 如果有元素交换，则标志位设为true
- swapped = true;
- }
- }
- // 如果没有元素交换，说明数组已经有序，可以提前结束排序
- if (!swapped) {
- break;
- }
- }
-} //end
-
-
diff --git a/codes/luo111/15754678.java b/codes/luo111/15754678.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/luo111/15754678.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/luogege/15634607.java b/codes/luogege/15634607.java
deleted file mode 100644
index d8a8b6b8..00000000
--- a/codes/luogege/15634607.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int luoluo = 0; luoluo < n - i - 1; luoluo++) {
- if(a[luoluo] > a[luoluo + 1]) {
- int temp = a[luoluo];
- a [luoluo] = a[luoluo + 1];
- a[luoluo + 1] = temp;
- }
- }
- }
-
-
-} //end,luoluo
\ No newline at end of file
diff --git a/codes/luoluo123/15634481.java b/codes/luoluo123/15634481.java
deleted file mode 100644
index 6d56cc24..00000000
--- a/codes/luoluo123/15634481.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int luoluo = 0; luoluo < n - i - 1; luoluo++) {
- if(a[luoluo] > a[luoluo + 1]) {
- int temp = a[luoluo];
- a [luoluo] = a[luoluo + 1];
- a[luoluo + 1] = temp;
- }
- }
- }
-
-
-} //end,luoluo
diff --git a/codes/luowei/15609646.java b/codes/luowei/15609646.java
deleted file mode 100644
index 43375d79..00000000
--- a/codes/luowei/15609646.java
+++ /dev/null
@@ -1,19 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
- } //end
diff --git a/codes/luox12/15700214.java b/codes/luox12/15700214.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/luox12/15700214.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/luv3704/15810371.java b/codes/luv3704/15810371.java
deleted file mode 100644
index 166dea5d..00000000
--- a/codes/luv3704/15810371.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数通过冒泡排序算法对数组进行排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮的比较次数
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/luzhanheng2023/12213445.java b/codes/luzhanheng2023/12213445.java
deleted file mode 100644
index 4ad17961..00000000
--- a/codes/luzhanheng2023/12213445.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < a.length; i++) {
- for (int j = i+1; j < a.length; j++) {
- if (a[i] > a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
- }
\ No newline at end of file
diff --git a/codes/lvbin2/.keep b/codes/lvbin2/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/lvbin2/15758178.java b/codes/lvbin2/15758178.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/lvbin2/15758178.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/lvlv123/15693242.java b/codes/lvlv123/15693242.java
deleted file mode 100644
index 515548ee..00000000
--- a/codes/lvlv123/15693242.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过多次遍历数组，每次比较相邻的元素，如果它们的顺序错误就把它们交换过来。
- * 遍历数组的工作是重复地进行直到没有再需要交换，也就是说该数组已经排序完成。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制遍历次数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环负责具体的元素比较和交换
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们
- // 使用临时变量进行交换
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/lvrui233/15855727.java b/codes/lvrui233/15855727.java
deleted file mode 100644
index ae82e695..00000000
--- a/codes/lvrui233/15855727.java
+++ /dev/null
@@ -1,35 +0,0 @@
-/**
-
- * 冒泡排序函数
-
- * aa bb cc
-
- * @param a 待排序的数组
-
- * @param n 待排序的数组长度
-
- */
-
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0; i < n-1 ; i++){
-
- for (int j = 0;j < n-1-i;j++){
-
- if(a[j] > a[j+1]){
-
- int temp = a[j];
-
- a[j] = a[j+1];
-
- a[j+1] = temp;
-
- }
-
- }
-
- }
-
-
-
-} //end
diff --git a/codes/lvxl111/15528312.java b/codes/lvxl111/15528312.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/lvxl111/15528312.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/lx1122334/12138905.java b/codes/lx1122334/12138905.java
deleted file mode 100644
index 8501963b..00000000
--- a/codes/lx1122334/12138905.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
-
diff --git a/codes/lx13579/15807637.java b/codes/lx13579/15807637.java
deleted file mode 100644
index 24f513b3..00000000
--- a/codes/lx13579/15807637.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/lxnb666/14201242.java b/codes/lxnb666/14201242.java
deleted file mode 100644
index 10dbc652..00000000
--- a/codes/lxnb666/14201242.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-} //end
diff --git a/codes/lxsq1905951174/15775065.java b/codes/lxsq1905951174/15775065.java
deleted file mode 100644
index 9ff97f57..00000000
--- a/codes/lxsq1905951174/15775065.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * 将数组a中的元素按照从小到大的顺序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 外层循环控制排序的趟数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环控制每趟排序的次数
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果当前元素大于下一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/ly614155/15775591.java b/codes/ly614155/15775591.java
deleted file mode 100644
index 4b863ff8..00000000
--- a/codes/ly614155/15775591.java
+++ /dev/null
@@ -1,26 +0,0 @@
-/**
- * 冒泡排序函数
- * 使用冒泡排序算法对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- // 标志位，用于检测是否发生过交换，如果没有交换，说明数组已经有序
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 发生了交换，标志位设为true
- swapped = true;
- }
- }
- // 如果在内层循环中没有发生过交换，说明数组已经有序，提前结束排序
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/lynlon/12376594.java b/codes/lynlon/12376594.java
deleted file mode 100644
index 4631f6cf..00000000
--- a/codes/lynlon/12376594.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int temp;
- for(int i=0;ia[j+1]){
- temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-} //end
diff --git a/codes/lyx123123/15775949.java b/codes/lyx123123/15775949.java
deleted file mode 100644
index fef69f9a..00000000
--- a/codes/lyx123123/15775949.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
-
- for(int i=0;ia[j+1])
- {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-
-}
diff --git a/codes/lyxgitee1/.keep b/codes/lyxgitee1/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/lyxgitee1/15815289.java b/codes/lyxgitee1/15815289.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/lyxgitee1/15815289.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/lzf1123/15542355.java b/codes/lzf1123/15542355.java
deleted file mode 100644
index ae82e695..00000000
--- a/codes/lzf1123/15542355.java
+++ /dev/null
@@ -1,35 +0,0 @@
-/**
-
- * 冒泡排序函数
-
- * aa bb cc
-
- * @param a 待排序的数组
-
- * @param n 待排序的数组长度
-
- */
-
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0; i < n-1 ; i++){
-
- for (int j = 0;j < n-1-i;j++){
-
- if(a[j] > a[j+1]){
-
- int temp = a[j];
-
- a[j] = a[j+1];
-
- a[j+1] = temp;
-
- }
-
- }
-
- }
-
-
-
-} //end
diff --git a/codes/lzr565520/15742467.java b/codes/lzr565520/15742467.java
deleted file mode 100644
index 2252b818..00000000
--- a/codes/lzr565520/15742467.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/m88888686/11201957.java b/codes/m88888686/11201957.java
deleted file mode 100644
index 4d7083fe..00000000
--- a/codes/m88888686/11201957.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int i, j;
-
- for(i=0; ia[j]){
- int temp;
- temp = a[j-1];
- a[j-1] = a[j];
- a[j] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/ma17533610893/15816305.java b/codes/ma17533610893/15816305.java
deleted file mode 100644
index 8a9fb777..00000000
--- a/codes/ma17533610893/15816305.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 使用冒泡排序算法对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/ma_yin/15529443.java b/codes/ma_yin/15529443.java
deleted file mode 100644
index 61c422b6..00000000
--- a/codes/ma_yin/15529443.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/mabofu/10606075.java b/codes/mabofu/10606075.java
deleted file mode 100644
index 2fd06128..00000000
--- a/codes/mabofu/10606075.java
+++ /dev/null
@@ -1,25 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 1; i < a.length; i++) {
- boolean flag = true;
- for (int j = 0; j < a.length - 1; j++) {
- if (a[j] > a[j + 1]) {
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- flag = false;
- }
- }
- if (flag) {
- break;
- }
- }
-
-} //end
-
diff --git a/codes/macw_379/15655907.java b/codes/macw_379/15655907.java
deleted file mode 100644
index 09d26b4c..00000000
--- a/codes/macw_379/15655907.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 依次比较相邻的元素，如果它们的顺序错误就把它们交换过来
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环，控制每一趟排序多少次
- // 如果前一个元素大于后一个元素，则交换位置
- if (a[j] > a[j + 1]) {
- int temp = a[j]; // 使用临时变量进行交换
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/mafuqiang/10166179.java b/codes/mafuqiang/10166179.java
deleted file mode 100644
index 4b18be75..00000000
--- a/codes/mafuqiang/10166179.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
-
- int temp;
- for(int i=0;ia[j+1]){
- temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-
-} //end
diff --git a/codes/mahaoliang/15538747.java b/codes/mahaoliang/15538747.java
deleted file mode 100644
index e125768f..00000000
--- a/codes/mahaoliang/15538747.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- *
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/mahaoliang/15540967.java b/codes/mahaoliang/15540967.java
deleted file mode 100644
index 4d6e2d6a..00000000
--- a/codes/mahaoliang/15540967.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- *
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/maisaki/15487137.java b/codes/maisaki/15487137.java
deleted file mode 100644
index 6a3fea37..00000000
--- a/codes/maisaki/15487137.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int i, j;
- for (i = 0; i < n-1; i++) {
- for (j = 0; j < n-1-i; j++) {
- if (a[j] > a[j+1]) {
- int t = a[j];
- a[j] = a[j+1];
- a[j+1] = t;
- }
- }
- }
-
-} //end
diff --git a/codes/maiswemlilo1/11241067.java b/codes/maiswemlilo1/11241067.java
deleted file mode 100644
index 272a12fc..00000000
--- a/codes/maiswemlilo1/11241067.java
+++ /dev/null
@@ -1,18 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- } //end
\ No newline at end of file
diff --git a/codes/manbaoutsi/.keep b/codes/manbaoutsi/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/manbaoutsi/15845869.java b/codes/manbaoutsi/15845869.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/manbaoutsi/15845869.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/manyuemei/15869904.java b/codes/manyuemei/15869904.java
deleted file mode 100644
index 24f513b3..00000000
--- a/codes/manyuemei/15869904.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/maqingshan123/15622329.java b/codes/maqingshan123/15622329.java
deleted file mode 100644
index 51a5e05b..00000000
--- a/codes/maqingshan123/15622329.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 将数组a从小到大进行排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制需要排序的趟数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每一趟排序多少次
- if (a[j] > a[j + 1]) { // 如果前面的数比后面的数大，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
-
diff --git a/codes/matrixHall/.keep b/codes/matrixHall/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/matrixHall/15815802.java b/codes/matrixHall/15815802.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/matrixHall/15815802.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/matrixsquad/.keep b/codes/matrixsquad/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/matrixsquad/15774031.java b/codes/matrixsquad/15774031.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/matrixsquad/15774031.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/maxsky010/15734024.java b/codes/maxsky010/15734024.java
deleted file mode 100644
index 7ec373ae..00000000
--- a/codes/maxsky010/15734024.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过对相邻的元素进行两两比较，顺序相反则进行交换，每一轮比较会将当前未排序部分的最大值“冒泡”到未排序部分的末尾。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制所有轮数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮比较的次数
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/mcfly001/11350844.java b/codes/mcfly001/11350844.java
deleted file mode 100644
index cacd12f1..00000000
--- a/codes/mcfly001/11350844.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- a[j] = a[j]+a[j+1];
- a[j+1] = a[j]-a[j+1];
- a[j] = a[j]-a[j+1];
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/meiyaya/15775357.java b/codes/meiyaya/15775357.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/meiyaya/15775357.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/memuqee/11238999.java b/codes/memuqee/11238999.java
deleted file mode 100644
index 24b49b4b..00000000
--- a/codes/memuqee/11238999.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/meng123/15699639.java b/codes/meng123/15699639.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/meng123/15699639.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/mengbo/.keep b/codes/mengbo/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/mengbo/15855465.java b/codes/mengbo/15855465.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/mengbo/15855465.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/mengjian/15775342.java b/codes/mengjian/15775342.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/mengjian/15775342.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/mengwenxu/15578436.java b/codes/mengwenxu/15578436.java
deleted file mode 100644
index ae82e695..00000000
--- a/codes/mengwenxu/15578436.java
+++ /dev/null
@@ -1,35 +0,0 @@
-/**
-
- * 冒泡排序函数
-
- * aa bb cc
-
- * @param a 待排序的数组
-
- * @param n 待排序的数组长度
-
- */
-
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0; i < n-1 ; i++){
-
- for (int j = 0;j < n-1-i;j++){
-
- if(a[j] > a[j+1]){
-
- int temp = a[j];
-
- a[j] = a[j+1];
-
- a[j+1] = temp;
-
- }
-
- }
-
- }
-
-
-
-} //end
diff --git a/codes/mengzhong/15775328.java b/codes/mengzhong/15775328.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/mengzhong/15775328.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/menmazqj/15277745.java b/codes/menmazqj/15277745.java
deleted file mode 100644
index 37b3920b..00000000
--- a/codes/menmazqj/15277745.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/mercurio/15782388.java b/codes/mercurio/15782388.java
deleted file mode 100644
index 09064e0d..00000000
--- a/codes/mercurio/15782388.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素两两比较和交换，将最大（或最小）的元素冒泡到数组末尾。
- * 重复执行，直到整个数组有序。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一趟排序多少次
- if (a[j] > a[j + 1]) { // 相邻元素两两比较，如果前一个元素比后一个元素大则交换它们
- // 交换 a[j] 和 a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end bubbleSort
diff --git a/codes/mewchen/.keep b/codes/mewchen/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/mewchen/10042032.java b/codes/mewchen/10042032.java
deleted file mode 100644
index 667eee0f..00000000
--- a/codes/mewchen/10042032.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/mi9688/15776507.java b/codes/mi9688/15776507.java
deleted file mode 100644
index ae82e695..00000000
--- a/codes/mi9688/15776507.java
+++ /dev/null
@@ -1,35 +0,0 @@
-/**
-
- * 冒泡排序函数
-
- * aa bb cc
-
- * @param a 待排序的数组
-
- * @param n 待排序的数组长度
-
- */
-
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0; i < n-1 ; i++){
-
- for (int j = 0;j < n-1-i;j++){
-
- if(a[j] > a[j+1]){
-
- int temp = a[j];
-
- a[j] = a[j+1];
-
- a[j+1] = temp;
-
- }
-
- }
-
- }
-
-
-
-} //end
diff --git a/codes/mianyang/.keep b/codes/mianyang/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/mianyang/15856153.java b/codes/mianyang/15856153.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/mianyang/15856153.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/milkyTea/11201805.java b/codes/milkyTea/11201805.java
deleted file mode 100644
index 47680171..00000000
--- a/codes/milkyTea/11201805.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- *
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 你的代码，使无序数组 a 变得有序
- int i, j;
- for (i = 0; i < n; i++) {//表示n次排序过程。
- for (j = 1; j < n - i; j++) {
- if (a[j - 1] > a[j]) {//前面的数字大于后面的数字就交换
- //交换a[j-1]和a[j]
- int temp;
- temp = a[j - 1];
- a[j - 1] = a[j];
- a[j] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/mimeik/14612577.java b/codes/mimeik/14612577.java
deleted file mode 100644
index f7235953..00000000
--- a/codes/mimeik/14612577.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组 1111
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
-
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-}//end
diff --git a/codes/ming18641275939/15838279.java b/codes/ming18641275939/15838279.java
deleted file mode 100644
index 47e0d6ef..00000000
--- a/codes/ming18641275939/15838279.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 功能：对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 遍历数组，从第一个元素到倒数第二个元素
- for (int j = 0; j < n - 1 - i; j++) { // 每次比较相邻的元素，最后一个元素已经是当前轮的最大值，无需再比较
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/mingt123/15699576.java b/codes/mingt123/15699576.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/mingt123/15699576.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/mingyaya/15775661.java b/codes/mingyaya/15775661.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/mingyaya/15775661.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/mingzhi/.keep b/codes/mingzhi/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/mingzhi/15846139.java b/codes/mingzhi/15846139.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/mingzhi/15846139.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/minixin/11115487.java b/codes/minixin/11115487.java
deleted file mode 100644
index 82335424..00000000
--- a/codes/minixin/11115487.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/mirabit/18384785.java b/codes/mirabit/18384785.java
deleted file mode 100644
index 83bb3cd3..00000000
--- a/codes/mirabit/18384785.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;i a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/miyuer/15846351.java b/codes/miyuer/15846351.java
deleted file mode 100644
index e26e88b2..00000000
--- a/codes/miyuer/15846351.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过不断比较相邻的元素，如果顺序错误则交换它们，直到整个数组有序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序的趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一趟排序多少次
- // 如果前一个元素比后一个元素大，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/mjzhutianxiu/15555031.java b/codes/mjzhutianxiu/15555031.java
deleted file mode 100644
index 49a64aea..00000000
--- a/codes/mjzhutianxiu/15555031.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int i, j, tmp_data;
-
- for(i = 0; i < n - 1; i ++) {
- for(j = 0; j < n - 1 - i; j ++) {
- if(a[j] > a[j + 1]) {
- tmp_data = a[j + 1];
- a[j + 1] = a[j];
- a[j] = tmp_data;
- }
- }
- }
-} //end
diff --git a/codes/mjzhutianxiu/15578951.java b/codes/mjzhutianxiu/15578951.java
deleted file mode 100644
index 49a64aea..00000000
--- a/codes/mjzhutianxiu/15578951.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int i, j, tmp_data;
-
- for(i = 0; i < n - 1; i ++) {
- for(j = 0; j < n - 1 - i; j ++) {
- if(a[j] > a[j + 1]) {
- tmp_data = a[j + 1];
- a[j + 1] = a[j];
- a[j] = tmp_data;
- }
- }
- }
-} //end
diff --git a/codes/mmkk26/15845961.java b/codes/mmkk26/15845961.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/mmkk26/15845961.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/mmm111/15648151.java b/codes/mmm111/15648151.java
deleted file mode 100644
index 04625a49..00000000
--- a/codes/mmm111/15648151.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-} //end
-
diff --git a/codes/mmm123456/15625950.java b/codes/mmm123456/15625950.java
deleted file mode 100644
index efccdd39..00000000
--- a/codes/mmm123456/15625950.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; ++j) {
- if(a[j] > a[j + 1]) {
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-} //end
diff --git a/codes/mmmmmm/11121934.java b/codes/mmmmmm/11121934.java
deleted file mode 100644
index cacd12f1..00000000
--- a/codes/mmmmmm/11121934.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- a[j] = a[j]+a[j+1];
- a[j+1] = a[j]-a[j+1];
- a[j] = a[j]-a[j+1];
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/mmnn123/15720368.java b/codes/mmnn123/15720368.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/mmnn123/15720368.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/mmx050623/15846455.java b/codes/mmx050623/15846455.java
deleted file mode 100644
index b1e1f8d5..00000000
--- a/codes/mmx050623/15846455.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 将数组a按照升序进行排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序的轮数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环进行相邻元素的比较和交换
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素
- // 交换两个元素的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/momo1234/15630942.java b/codes/momo1234/15630942.java
deleted file mode 100644
index 15c23e4b..00000000
--- a/codes/momo1234/15630942.java
+++ /dev/null
@@ -1,29 +0,0 @@
-/**
- * 冒泡排序函数
- * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，
- * 如果他们的顺序错误就把他们交换过来。遍历数列的工作是重复地进行直到没有再需要交换，
- * 也就是说该数列已经排序完成。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- // 标记变量，用于检测是否发生过交换，如果没有交换则数组已经有序
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换他们的位置
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 标记本轮发生过交换
- swapped = true;
- }
- }
- // 如果本轮没有发生过交换，说明数组已经有序，可以提前结束排序
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/momozi/15562400.java b/codes/momozi/15562400.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/momozi/15562400.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/moonmoon/15777672.java b/codes/moonmoon/15777672.java
deleted file mode 100644
index a73834e9..00000000
--- a/codes/moonmoon/15777672.java
+++ /dev/null
@@ -1,26 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素之间的比较和交换，将无序数组变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- // 标记变量，用于优化，如果在一趟排序中没有交换，则数组已经有序
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 发生了交换，将标记设为true
- swapped = true;
- }
- }
- // 如果在内层循环中没有发生交换，则数组已经有序，提前退出
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/morikawakaho/15830357.java b/codes/morikawakaho/15830357.java
deleted file mode 100644
index cc51cecc..00000000
--- a/codes/morikawakaho/15830357.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素之间的比较和交换，使得每一轮循环后，最大（或最小）的元素能够“浮”到数组的末尾
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/mouse123/.issueld.java.swp b/codes/mouse123/.issueld.java.swp
deleted file mode 100644
index f62c2cd4312fc0b6daf2f41e73e1aaaf2ed948ba..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001
literal 12288
zcmeI%J&M9W6u|M9ZLDM$1#4Y9L1UswJc5O#7IrZiF`8v|cP4_(?%_O$N6{F>Mntd+
z{0D~le!Tg?RI}{QC(~xo>q}lfL>#ZNT2>lz=!pDkZ7-v6X(
z9NER)vA;_|H;inuOYFXDqP5nk8|hdX_e*C+dH%pnjLB3Q_cq}!yo__m7<0tg_000IagfB*srAb a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/mouse123/issueld.java b/codes/mouse123/issueld.java
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/moyu9527/15633448.java b/codes/moyu9527/15633448.java
deleted file mode 100644
index 26233d16..00000000
--- a/codes/moyu9527/15633448.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * 将数组中的元素按照从小到大的顺序排列
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 外层循环控制排序趟数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环控制每一趟排序多少次
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果当前元素大于下一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/moyudaren/.keep b/codes/moyudaren/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/moyudaren/15860459.java b/codes/moyudaren/15860459.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/moyudaren/15860459.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/mozi123/15863565.java b/codes/mozi123/15863565.java
deleted file mode 100644
index ce045dc0..00000000
--- a/codes/mozi123/15863565.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int []a,int n){
- for(int i=0;ia[j+1]){
- int temp = a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/mr_lk123/.java b/codes/mr_lk123/.java
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/mr_lk123/9954396.java b/codes/mr_lk123/9954396.java
deleted file mode 100644
index 82b73c8f..00000000
--- a/codes/mr_lk123/9954396.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-} //end
-
diff --git a/codes/msc12345678/15659945.java b/codes/msc12345678/15659945.java
deleted file mode 100644
index 558a2b69..00000000
--- a/codes/msc12345678/15659945.java
+++ /dev/null
@@ -1,12 +0,0 @@
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制所有元素遍历的次数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制相邻元素两两比较
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/msk6527/15520710.java b/codes/msk6527/15520710.java
deleted file mode 100644
index d7fbec1b..00000000
--- a/codes/msk6527/15520710.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组进行冒泡排序，将无序数组变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环，控制需要排序的趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环，从前往后依次比较相邻的两个元素
- if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们的位置
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/mtfx0516/15585376.java b/codes/mtfx0516/15585376.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/mtfx0516/15585376.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/mujing/15841257.java b/codes/mujing/15841257.java
deleted file mode 100644
index ae51df28..00000000
--- a/codes/mujing/15841257.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * 将数组中的元素按照从小到大的顺序排列
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 外层循环控制排序趟数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环控制每一趟排序多少次
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/mupimage/11254168.java b/codes/mupimage/11254168.java
deleted file mode 100644
index 8d589d7e..00000000
--- a/codes/mupimage/11254168.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a,int n){
- int temp =0;
- for(int i = 0;ia[j+1]){
- temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-
-
-}
\ No newline at end of file
diff --git a/codes/musei123/15775718.java b/codes/musei123/15775718.java
deleted file mode 100644
index 4b863ff8..00000000
--- a/codes/musei123/15775718.java
+++ /dev/null
@@ -1,26 +0,0 @@
-/**
- * 冒泡排序函数
- * 使用冒泡排序算法对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- // 标志位，用于检测是否发生过交换，如果没有交换，说明数组已经有序
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 发生了交换，标志位设为true
- swapped = true;
- }
- }
- // 如果在内层循环中没有发生过交换，说明数组已经有序，提前结束排序
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/muyang/.keep b/codes/muyang/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/muyang/15799169.java b/codes/muyang/15799169.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/muyang/15799169.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/muzhuo0205/15809688.java b/codes/muzhuo0205/15809688.java
deleted file mode 100644
index 166dea5d..00000000
--- a/codes/muzhuo0205/15809688.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数通过冒泡排序算法对数组进行排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮的比较次数
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/mwy280429/15517713.java b/codes/mwy280429/15517713.java
deleted file mode 100644
index 4e7bebd7..00000000
--- a/codes/mwy280429/15517713.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j+1] 和 a[j]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
-
diff --git a/codes/myclubocr/11122342.java b/codes/myclubocr/11122342.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/myclubocr/11122342.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/myyaya/15774943.java b/codes/myyaya/15774943.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/myyaya/15774943.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/nannanya/15777923.java b/codes/nannanya/15777923.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/nannanya/15777923.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/nargnij7/15839361.java b/codes/nargnij7/15839361.java
deleted file mode 100644
index 24f513b3..00000000
--- a/codes/nargnij7/15839361.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/nbdopa/11116411.java b/codes/nbdopa/11116411.java
deleted file mode 100644
index d34027fa..00000000
--- a/codes/nbdopa/11116411.java
+++ /dev/null
@@ -1,27 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- if(a == null || a.length == 0){
- return;
- }
- for(int i = 0; i< n; i++){
- boolean flag = true;
- for(int j = 0; j< n - i - 1 ; j++){
- if(a[j]> a[j+1]){
- int tmp = a[j];
- a[j] = a[j+1];
- a[j+1] = tmp;
- flag = false;
- }
- }
- if(flag){
- break;
- }
-
- }
-} //end
\ No newline at end of file
diff --git a/codes/ndliang/15628397.java b/codes/ndliang/15628397.java
deleted file mode 100644
index 41479c77..00000000
--- a/codes/ndliang/15628397.java
+++ /dev/null
@@ -1,18 +0,0 @@
-
-/**
- * 冒泡排序函数
- * 这是一个经典的排序算法，通过不断比较相邻的元素，将较大的元素往后移动，实现数组的升序排序。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制所有元素是否都排好序
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环负责两两比较
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/ne8848/11116344.java b/codes/ne8848/11116344.java
deleted file mode 100644
index 82335424..00000000
--- a/codes/ne8848/11116344.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/neineiya/11260235.java b/codes/neineiya/11260235.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/neineiya/11260235.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/nekoko/.keep b/codes/nekoko/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/nekoko/15845688.java b/codes/nekoko/15845688.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/nekoko/15845688.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/nemolv/15195393.java b/codes/nemolv/15195393.java
deleted file mode 100644
index c85755c9..00000000
--- a/codes/nemolv/15195393.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- //外部循环控制排序的趟数。冒泡排序的每一趟会将最大的元素"冒泡"到数组的末尾，因此需要执行 n-1 趟，其中 n 是元素的总数
- for (int i = 0; i < n - 1; i++) {
- //内循环控制每趟比较的次数。由于每一趟都会将一个最大的元素沉到数组末尾，所以内循环次数逐渐减小。
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换arr[j]和arr[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/nfnxfr/.keep b/codes/nfnxfr/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/nfnxfr/15775676.java b/codes/nfnxfr/15775676.java
deleted file mode 100644
index 5edd6bf0..00000000
--- a/codes/nfnxfr/15775676.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/nigger/15601489.java b/codes/nigger/15601489.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/nigger/15601489.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/nightowl/9959740.java b/codes/nightowl/9959740.java
deleted file mode 100644
index 4f93d09f..00000000
--- a/codes/nightowl/9959740.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- *
- * @param arr 待排序的数组
- * @param len 待排序的数组长度
- */
- public static void bubbleSort(int[] arr, int len) {
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < len - 1; i++) {
- //对数组进行遍历，相邻的两个数字进行比较，每次比较之后数字总数就会减一防止索引越界，让长度减一
- for (int j = 0; j < len - 1 - i; j++) {
- //判断每两个相邻的数字，大的往前排
- if (arr[j] >= arr[j + 1]) {
- int temp = arr[j];
- arr[j] = arr[j + 1];
- arr[j + 1] = temp;
- }
- }
- }
- } //end
diff --git a/codes/nihao01/.keep b/codes/nihao01/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/nihao01/15867137.java b/codes/nihao01/15867137.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/nihao01/15867137.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/niumaa/15777757.java b/codes/niumaa/15777757.java
deleted file mode 100644
index 4afc6981..00000000
--- a/codes/niumaa/15777757.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过比较相邻的元素，如果前一个元素比后一个元素大，则交换它们的位置，
- * 经过多轮比较和交换，较大的元素会逐渐"浮"到数组的末尾，较小的元素则"沉"到数组的前端。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 外层循环控制排序的轮数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环控制每轮排序中相邻元素的比较和交换
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果前一个元素比后一个元素大，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换a[j]和a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/niyiyi/15684167.java b/codes/niyiyi/15684167.java
deleted file mode 100644
index 54c5f386..00000000
--- a/codes/niyiyi/15684167.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
\ No newline at end of file
diff --git a/codes/njjkxllj/15631418.java b/codes/njjkxllj/15631418.java
deleted file mode 100644
index ad6fb35f..00000000
--- a/codes/njjkxllj/15631418.java
+++ /dev/null
@@ -1,22 +0,0 @@
-
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i=0;ia[j+1]){
- int temp=a[j+1];
- a[j+1]=a[j];
- a[j]=temp;
- }
- }
- }
- return a;
-} //end
-
-
diff --git a/codes/nn314159/15826881.java b/codes/nn314159/15826881.java
deleted file mode 100644
index 24f513b3..00000000
--- a/codes/nn314159/15826881.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/no8gcoder/15578057.java b/codes/no8gcoder/15578057.java
deleted file mode 100644
index acec583f..00000000
--- a/codes/no8gcoder/15578057.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组进行冒泡排序，从小到大排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 外层循环控制排序趟数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环负责每一趟的排序过程
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果当前元素大于下一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/nofear123/.15830815.java.swo b/codes/nofear123/.15830815.java.swo
deleted file mode 100644
index 69d4361503fc5d9b3061f29fb91fe9efc8e6936b..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001
literal 12288
zcmeI%u};G<5C&kEg$aS+1q^JU)^Va%5r_w1U@SusgX_376^)z56m=*}JQf`o8F_#{
z0xK(*kSwjl&@Iw$>2kTqJ~^M1A#&fly}sdL%VRVS^2^`&Ib&>Ut*h$)a@>0wboBf|
zb#$8c{bX#0S*Uv(OJ4GZLTMMzVmEJQdT8yV&^9ueNbJCy
z<+4PA00bZa0SG_<0uX=z1Rwwb2tc5Q0xDwcZJ)7siv0Y)`v3o?dPVU?@k#MPv7{*G
z)$l#BWe7k30uX=z1Rwwb2tWV=5P(2^1umXbw%|gTBx0P#g7YG;-&ghBh@W$L&#$;M
J{snvbI7a{g
diff --git a/codes/nofear123/.15830815.java.swp b/codes/nofear123/.15830815.java.swp
deleted file mode 100644
index 121b34bcd439915fd547750dc23179e35995f4bc..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001
literal 12288
zcmeI1OHUI~6o4zNm=*#yBF3!?6BC0m5KN{o83LWs4mE_Jgz_i?#h_qB
zqGB3qkU$N_G%YQEz`ZUM73WUNMiwS6TzPJ%g;E+9EKEqwq#t)4=bpzm>4Ma1x_R{)
zwbYsj9Oe9ve*CH?#3Rc}?)qP=)Y|K8wDsK)8*M#3);d?Wqr+>lwI14Xk0%sFnyYIx!6w@sUcn_h9iqovS1*_wEcGUfxuLdG^ofUZ;0-i@299c=tfjurocXGs
zJ6lOlSF{{85$;0+XaEhM0W^RH&;S}h18CqF8c^IN+yWYa3ZNAD4S9b88o&S*_yKGK-+^zyS6~bH0(=HO0hxY|p-*fX
z4WI!ufCkV28bAYR01cpl|8L;p-JZOn15^+kE<2%c3{aX`3(t#P^Lt`jCpA)YJ8hpe1Rn%vGFN3;!nMM$wFZ@7F44XYIIPIF6%dUHzrx&sa~0_`qlVK
zYJONvOr;X5c{!c3hgR_+I$;7+6D*ggi`GyxAi<^4c(4ave{_Vs9b(DlRB%lThFRdf
zwl0>UboW}j
zBpdZAq5_Lgmh9BpYqfScZpa>mkJHvp#q*TU<;wPN5O^yFdc`ez#BP|8B}euar#Ht^&!Rg+ab36?4Z%kr9$vC;9^QhQ*ks8k;0WFhpCDt0
zJq&6KgYe>ZHv(Ez2%ncoKxeIStB&qknMrXA3
QMSTi3meAb@1_M0(3*91(LI3~&
diff --git a/codes/nofear123/15831083.java b/codes/nofear123/15831083.java
deleted file mode 100644
index ab864d7a..00000000
--- a/codes/nofear123/15831083.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过多次遍历数组，比较并交换相邻元素，使得较大的元素逐渐“浮”到数组的末尾，达到排序的目的。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 外层循环，控制遍历次数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环，控制每次遍历时的比较和交换
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果当前元素大于下一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换a[j]和a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/nonowa/15831088.java b/codes/nonowa/15831088.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/nonowa/15831088.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/ny960126/15626345.java b/codes/ny960126/15626345.java
deleted file mode 100644
index 354c65d8..00000000
--- a/codes/ny960126/15626345.java
+++ /dev/null
@@ -1,12 +0,0 @@
-public static void bubbleSort(int []a, int n){
- for(int i = 0; i < n - 1; i++){
- for(int j = 0; j < n - i - 1; j++){
- if(a[j] > a[j + 1]){
- //交换a[j]和a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/nzqq54667/.keep b/codes/nzqq54667/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/nzqq54667/15841667.java b/codes/nzqq54667/15841667.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/nzqq54667/15841667.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/o11ccm/.keep b/codes/o11ccm/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/o11ccm/10041751.java b/codes/o11ccm/10041751.java
deleted file mode 100644
index c031d21a..00000000
--- a/codes/o11ccm/10041751.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/o1982016781/11118518.java b/codes/o1982016781/11118518.java
deleted file mode 100644
index 37e8a08f..00000000
--- a/codes/o1982016781/11118518.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] b, int n) {
- for (int i=0 ; ib[j+1]) {
- int temp=b[j];
- b[j]=b[j+1];
- b[j+1]=temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/o389675/15718177.java b/codes/o389675/15718177.java
deleted file mode 100644
index ef30d22d..00000000
--- a/codes/o389675/15718177.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素之间的比较和交换，使得每一轮循环后最大（或最小）的元素能够“冒泡”到数组的末尾。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制需要排序的趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一趟排序的过程
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/obc147/11064483.java b/codes/obc147/11064483.java
deleted file mode 100644
index 82335424..00000000
--- a/codes/obc147/11064483.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/onenewcode/15333872.java b/codes/onenewcode/15333872.java
deleted file mode 100644
index 0124a74c..00000000
--- a/codes/onenewcode/15333872.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/ooooo_long/15253355.java b/codes/ooooo_long/15253355.java
deleted file mode 100644
index ecfb06f7..00000000
--- a/codes/ooooo_long/15253355.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/ooooo_long/15256718.java b/codes/ooooo_long/15256718.java
deleted file mode 100644
index ecfb06f7..00000000
--- a/codes/ooooo_long/15256718.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/ooopen/11302831.java b/codes/ooopen/11302831.java
deleted file mode 100644
index 029e9d84..00000000
--- a/codes/ooopen/11302831.java
+++ /dev/null
@@ -1,28 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
-*/
-public static void bubbleSort(int [] a, int n){
- int j , k;
- int flag = n ;//flag来记录最后交换的位置，也就是排序的尾边界
-
- while (flag > 0){//排序未结束标志
- k = flag; //k 来记录遍历的尾边界
- flag = 0;
-
- for(j=1; j a[j]){//前面的数字大于后面的数字就交换
- //交换a[j-1]和a[j]
- int temp;
- temp = a[j-1];
- a[j-1] = a[j];
- a[j]=temp;
-
- //表示交换过数据;
- flag = j;//记录最新的尾边界.
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/opaozhouzhou04/.keep b/codes/opaozhouzhou04/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/opaozhouzhou04/15846494.java b/codes/opaozhouzhou04/15846494.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/opaozhouzhou04/15846494.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/openAI12/11234314.java b/codes/openAI12/11234314.java
deleted file mode 100644
index 272a12fc..00000000
--- a/codes/openAI12/11234314.java
+++ /dev/null
@@ -1,18 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- } //end
\ No newline at end of file
diff --git a/codes/openAsg/11491517.java b/codes/openAsg/11491517.java
deleted file mode 100644
index e614b898..00000000
--- a/codes/openAsg/11491517.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; ++i) {
- for (int j = 0; j < n - i - 1; ++j) {
- if (a[j] > a[j+1]) {
- int tmp = a[j];
- a[j] = a[j+1];
- a[j+1] = tmp;
- }
- }
- }
-} //end
diff --git a/codes/openCI/11276263.java b/codes/openCI/11276263.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/openCI/11276263.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/openZnolis/18398006.java b/codes/openZnolis/18398006.java
deleted file mode 100644
index d78880e1..00000000
--- a/codes/openZnolis/18398006.java
+++ /dev/null
@@ -1,24 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- boolean swapped;
- for (int i = 0; i < n - 1; i++) {
- swapped = false;
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- swapped = true;
- }
- }
- // 如果在这一轮中没有发生任何交换，说明数组已经排好序了
- if (!swapped) break;
- }
-} //end
diff --git a/codes/openZnolis/18398008.java b/codes/openZnolis/18398008.java
deleted file mode 100644
index d78880e1..00000000
--- a/codes/openZnolis/18398008.java
+++ /dev/null
@@ -1,24 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- boolean swapped;
- for (int i = 0; i < n - 1; i++) {
- swapped = false;
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- swapped = true;
- }
- }
- // 如果在这一轮中没有发生任何交换，说明数组已经排好序了
- if (!swapped) break;
- }
-} //end
diff --git a/codes/openZnolis/18398010.java b/codes/openZnolis/18398010.java
deleted file mode 100644
index d78880e1..00000000
--- a/codes/openZnolis/18398010.java
+++ /dev/null
@@ -1,24 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- boolean swapped;
- for (int i = 0; i < n - 1; i++) {
- swapped = false;
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- swapped = true;
- }
- }
- // 如果在这一轮中没有发生任何交换，说明数组已经排好序了
- if (!swapped) break;
- }
-} //end
diff --git a/codes/openZnolis/18398011.java b/codes/openZnolis/18398011.java
deleted file mode 100644
index d78880e1..00000000
--- a/codes/openZnolis/18398011.java
+++ /dev/null
@@ -1,24 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- boolean swapped;
- for (int i = 0; i < n - 1; i++) {
- swapped = false;
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- swapped = true;
- }
- }
- // 如果在这一轮中没有发生任何交换，说明数组已经排好序了
- if (!swapped) break;
- }
-} //end
diff --git a/codes/openZnolis/18398012.java b/codes/openZnolis/18398012.java
deleted file mode 100644
index d78880e1..00000000
--- a/codes/openZnolis/18398012.java
+++ /dev/null
@@ -1,24 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- boolean swapped;
- for (int i = 0; i < n - 1; i++) {
- swapped = false;
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- swapped = true;
- }
- }
- // 如果在这一轮中没有发生任何交换，说明数组已经排好序了
- if (!swapped) break;
- }
-} //end
diff --git a/codes/openanolis_idear/.keep b/codes/openanolis_idear/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/openanolis_idear/15698658.java b/codes/openanolis_idear/15698658.java
deleted file mode 100644
index 8c7e1b66..00000000
--- a/codes/openanolis_idear/15698658.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/opsation/11293380.java b/codes/opsation/11293380.java
deleted file mode 100644
index 1c888994..00000000
--- a/codes/opsation/11293380.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/oroyade/11207786.java b/codes/oroyade/11207786.java
deleted file mode 100644
index b9bf7818..00000000
--- a/codes/oroyade/11207786.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/os1024/10038969.java b/codes/os1024/10038969.java
deleted file mode 100644
index ddf12697..00000000
--- a/codes/os1024/10038969.java
+++ /dev/null
@@ -1,23 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- int i, j;
-
- for (i = n - 1; i > 0; i--) {
- // 将a[0...i]中最大的数据放在末尾
- for (j = 0; j < i; j++) {
-
- if (a[j] > a[j + 1]) {
- // 交换a[j]和a[j+1]
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-}
diff --git a/codes/outclass2/.keep b/codes/outclass2/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/outclass2/15815855.java b/codes/outclass2/15815855.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/outclass2/15815855.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/owccqq/11122165.java b/codes/owccqq/11122165.java
deleted file mode 100644
index b9bf7818..00000000
--- a/codes/owccqq/11122165.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/oyeeyo/18379057.java b/codes/oyeeyo/18379057.java
deleted file mode 100644
index c1922950..00000000
--- a/codes/oyeeyo/18379057.java
+++ /dev/null
@@ -1,12 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; ++j) {
- if(a[j] > a[j + 1]) {
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-}
diff --git a/codes/oyoumq/11452053.java b/codes/oyoumq/11452053.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/oyoumq/11452053.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/p13285288040/.keep b/codes/p13285288040/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/p13285288040/10972084.java b/codes/p13285288040/10972084.java
deleted file mode 100644
index 9eccfac5..00000000
--- a/codes/p13285288040/10972084.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/p2948642664/15730688.java b/codes/p2948642664/15730688.java
deleted file mode 100644
index bb5a808a..00000000
--- a/codes/p2948642664/15730688.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 依次比较相邻的元素，如果它们的顺序错误就把它们交换过来
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一趟排序多少次
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/passass/11299378.java b/codes/passass/11299378.java
deleted file mode 100644
index 9e7534d4..00000000
--- a/codes/passass/11299378.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡 排序 函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-}//end
\ No newline at end of file
diff --git a/codes/patrol12/.keep b/codes/patrol12/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/patrol12/15845811.java b/codes/patrol12/15845811.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/patrol12/15845811.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/pcvvvc/11211727.java b/codes/pcvvvc/11211727.java
deleted file mode 100644
index 272a12fc..00000000
--- a/codes/pcvvvc/11211727.java
+++ /dev/null
@@ -1,18 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- } //end
\ No newline at end of file
diff --git a/codes/pddpxx/15781110.java b/codes/pddpxx/15781110.java
deleted file mode 100644
index 29a7b983..00000000
--- a/codes/pddpxx/15781110.java
+++ /dev/null
@@ -1,29 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组a进行冒泡排序，使其变为有序数组
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 遍历所有数组元素
- for (int i = 0; i < n - 1; i++) {
- // 假设数组已经有序，标志位
- boolean sorted = true;
- // 最后i个元素已经有序，无需比较
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- // 交换a[j]和a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 发现了需要交换的元素，所以数组并非有序
- sorted = false;
- }
- }
- // 如果在一次遍历中没有发生交换，则数组已经有序，可以提前结束
- if (sorted) {
- break;
- }
- }
-} //end
diff --git a/codes/pears123/15846338.java b/codes/pears123/15846338.java
deleted file mode 100644
index cac0dcf1..00000000
--- a/codes/pears123/15846338.java
+++ /dev/null
@@ -1,28 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- if (n <= 1) return; // 如果数组长度小于等于1，不需要排序
-
- boolean swapped;
- for (int i = 0; i < n - 1; i++) {
- swapped = false;
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换a[j]和a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- swapped = true;
- }
- }
- // 如果这一轮没有发生交换，说明数组已经有序，退出排序
- if (!swapped) {
- break;
- }
- }
-} //end
-
diff --git a/codes/penguin95/15774820.java b/codes/penguin95/15774820.java
deleted file mode 100644
index 520e00a4..00000000
--- a/codes/penguin95/15774820.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/perscc/15846268.java b/codes/perscc/15846268.java
deleted file mode 100644
index f31b91fc..00000000
--- a/codes/perscc/15846268.java
+++ /dev/null
@@ -1,27 +0,0 @@
-/**
- * 冒泡排序函数
- * 使用冒泡排序算法对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- // 标志位，表示这一趟排序是否有交换
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 表示这一趟排序有交换发生
- swapped = true;
- }
- }
- // 如果这一趟没有交换发生，说明数组已经有序，可以提前结束排序
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/philips/11302813.java b/codes/philips/11302813.java
deleted file mode 100644
index 4d7083fe..00000000
--- a/codes/philips/11302813.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int i, j;
-
- for(i=0; ia[j]){
- int temp;
- temp = a[j-1];
- a[j-1] = a[j];
- a[j] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/pictur/15653765.java b/codes/pictur/15653765.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/pictur/15653765.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/plugin/11199950.java b/codes/plugin/11199950.java
deleted file mode 100644
index 862a031b..00000000
--- a/codes/plugin/11199950.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int m=0 ; ma[q+1]) {
- int temp=a[q];
- a[q]=a[q+1];
- a[q+1]=temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/plustub/11244425.java b/codes/plustub/11244425.java
deleted file mode 100644
index 191de91d..00000000
--- a/codes/plustub/11244425.java
+++ /dev/null
@@ -1,11 +0,0 @@
- public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < a.length - 1; i++) {
- for (int j = 0; j < a.length - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j + 1];
- a[j + 1] = a[j];
- a[j] = temp;
- }
- }
- }
- }
\ No newline at end of file
diff --git a/codes/polodybala/.18365371.java.swp b/codes/polodybala/.18365371.java.swp
deleted file mode 100644
index bbdce5a9769257d7d34625f0bf524063e882d22f..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001
literal 12288
zcmeI2y>HV%7>BPgc_>9Nv0XueHlcOgC}~juAvOjkREAa=?rcXmb$qVv1f`*{lrmAI
zNCkFU=Pi
zT_^QN|N6eoSfo@keE#3+tu$-pg;G*-!_tOTEMHQM#r5{ep_2Q$p(*UdYk5g~F1GI|
z<(sy0+}I42ubj3NzA&w&V!2dYwC3xgB@Q*g1`NQ!5e-Z(7ZCKz@sW5<
zyds_vU1EoLOxzt(tp)m5%6DA
z)r23@SfgsMU+s;mJu2?7uql1d=5ZntT3X6;xNJ)4ySG%7WXG;nxwy#n00HImoJsI&
zp@>9-=1AW^?Co^Zy(b6Hw|cv84)(Xc?tV!3UjCLO{*t7_LU1X$ZR`7VyW4yFqTeZf
M^o}|)GnZpO0oGc&H2?qr
diff --git a/codes/polodybala/18365371.java b/codes/polodybala/18365371.java
deleted file mode 100644
index 8b770d97..00000000
--- a/codes/polodybala/18365371.java
+++ /dev/null
@@ -1,33 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组进行从小到大的排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 外层循环控制遍历的次数
- for (int i = 0; i < n - 1; i++) {
- // 提前退出标志位，如果本次没有交换，说明已经有序
- boolean swapped = false;
-
- // 内层循环进行两两比较
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果前一个数大于后一个数，则交换
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
-
- // 标记有交换
- swapped = true;
- }
- }
-
- // 如果没有发生交换，说明数组已经是有序的，提前结束循环
- if (!swapped) {
- break;
- }
- }
-} //end
-
diff --git a/codes/pondfish/15535613.java b/codes/pondfish/15535613.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/pondfish/15535613.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/ppdplius/11212528.java b/codes/ppdplius/11212528.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/ppdplius/11212528.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/pper2024/15867590.java b/codes/pper2024/15867590.java
deleted file mode 100644
index 24f513b3..00000000
--- a/codes/pper2024/15867590.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/pplac2/.keep b/codes/pplac2/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/pplac2/15814992.java b/codes/pplac2/15814992.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/pplac2/15814992.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/pppp0000/15840340.java b/codes/pppp0000/15840340.java
deleted file mode 100644
index 24f513b3..00000000
--- a/codes/pppp0000/15840340.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/progle/17034577.java b/codes/progle/17034577.java
deleted file mode 100644
index b2047e96..00000000
--- a/codes/progle/17034577.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * 对传入的数组进行排序，使得数组中的元素按照升序排列
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 外层循环控制排序的总轮数，每轮排序后最大的元素会冒泡到它应该在的位置
- for (int i = 0; i < n - 1; i++) {
- // 内层循环进行每轮的元素比较和交换
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果当前元素大于下一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
- // 排序完成，无需返回值，因为数组 a 已经被原地修改
-} //end
diff --git a/codes/promse/11152350.java b/codes/promse/11152350.java
deleted file mode 100644
index b9bf7818..00000000
--- a/codes/promse/11152350.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/publicstringms/.keep b/codes/publicstringms/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/publicstringms/15844875.java b/codes/publicstringms/15844875.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/publicstringms/15844875.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/pui9001/11232878.java b/codes/pui9001/11232878.java
deleted file mode 100644
index deb24387..00000000
--- a/codes/pui9001/11232878.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i=0 ; ia[k+1]) {
- int temp=a[k];
- a[k]=a[k+1];
- a[k+1]=temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/pumpkin/15658869.java b/codes/pumpkin/15658869.java
deleted file mode 100644
index 2571c1de..00000000
--- a/codes/pumpkin/15658869.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。
- * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制所有趟排序
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每一趟排序多少次
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/puzzle/15806930.java b/codes/puzzle/15806930.java
deleted file mode 100644
index 24f513b3..00000000
--- a/codes/puzzle/15806930.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/pyqyzjznbw1/.15782703.java.swp b/codes/pyqyzjznbw1/.15782703.java.swp
deleted file mode 100644
index 5cedd8292c4b3a074c5ec3730e69da803c942d96..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001
literal 12288
zcmeI2&rcIU6vqb>ZsHG2Jdb)PQrm5d76@WEcrnqF!59cJ+ja|Ex4Ub*trmkK&{`s`
zhKPv@Mo0sZAe3kfp|&3U3;Y*MXG>4sIr+BRA_8i{Ns>3ox6|2q^L_7qCOtH*$8qDz
zHQHu(5E#b@+2oG<-SsEQYLbwUqG-nBe+{uG;&-2SM%}#R9&`t8yV}(@-ruw9*aO3m
z~6}6Zx>>W@PiSsHxA=Kmter2_OL^fCP{L5;%|qG_{UAgvt+9t8c8%bvx$j
z5+@{p1dsp{Kmter2_OL^fCP{L5jAtMU$w&YRAOR$R1dsp{Kmter3H-MN
z`bCX;71=NLQ=6?{QarpwBVi$A7lOPfQH%4u%k6fyw^-HKz3P9A;ortxl@M78391yc
zgNGp4y-LtRhA77gvhRR*ayd)yLw}UbkLYiv*?6ivGgo>w
zrcY({mFMhPdTYrt3qL+ju;k0)dPYypvE|WXZV4ib`BW*tyscWl5~58;9RVo9(E-y%
zDpMO3K~7j&t+kYiI9nZIg~d{O1+0s?G^A&RVaQr6%;-zAP{BrFwDfwdJd!gqt!0X9
zi!44``uMh*Z!4E*<`S#9AdmPfPv*t;JbHS8B|quo!}|2NX;yxeV(Em@HRPPig0~v+
zNTQd9HC}@$s)#=7iFiDca9s&$MsvM=ls`v}E@h(|xawxE@=Ci@KEwy1V^)ak=}ET!
z)WliJjg_aqu=V-h!uUPH%z(cjfEtaf$R>aeTuaq|A;*$g^TuG;*vi&Yn_HE;HO*OK
TQvWb(md76F&8E5LX4w4+`#hB{
diff --git a/codes/pyqyzjznbw1/15782703,java b/codes/pyqyzjznbw1/15782703,java
deleted file mode 100644
index 065a9b16..00000000
--- a/codes/pyqyzjznbw1/15782703,java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 依次比较相邻的两个数，将较大的数移到后面，较小的数移到前面
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环，控制所有元素遍历的次数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环，从前往后依次比较相邻的两个元素
- if (a[j] > a[j + 1]) { // 如果前面的数比后面的数大，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/pyqyzjznbw1/15782703.java b/codes/pyqyzjznbw1/15782703.java
deleted file mode 100644
index 98db56b2..00000000
--- a/codes/pyqyzjznbw1/15782703.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 依次比较相邻的两个数，将较大的数移到后面，较小的数移到前面
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环，控制所有元素遍历的次数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环，从前往后依次比较相邻的两个元素
- if (a[j] > a[j + 1]) { // 如果前面的数比后面的数大，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //enD
diff --git a/codes/pysunlightse/.keep b/codes/pysunlightse/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/pysunlightse/15846452.java b/codes/pysunlightse/15846452.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/pysunlightse/15846452.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/pzzzzzzzzz/.keep b/codes/pzzzzzzzzz/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/pzzzzzzzzz/15778160.java b/codes/pzzzzzzzzz/15778160.java
deleted file mode 100644
index 667eee0f..00000000
--- a/codes/pzzzzzzzzz/15778160.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/q1229173945/15755759.java b/codes/q1229173945/15755759.java
deleted file mode 100644
index d18a9e37..00000000
--- a/codes/q1229173945/15755759.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/q225692/15860954.java b/codes/q225692/15860954.java
deleted file mode 100644
index 54c5f386..00000000
--- a/codes/q225692/15860954.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
\ No newline at end of file
diff --git a/codes/q6666666868/11202065.java b/codes/q6666666868/11202065.java
deleted file mode 100644
index 9e7534d4..00000000
--- a/codes/q6666666868/11202065.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡 排序 函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-}//end
\ No newline at end of file
diff --git a/codes/qaz123qaz/15859565 b/codes/qaz123qaz/15859565
deleted file mode 100644
index 98737781..00000000
--- a/codes/qaz123qaz/15859565
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/qaz123qaz/15859565.java b/codes/qaz123qaz/15859565.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/qaz123qaz/15859565.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/qazwsx061jk/15838272.java b/codes/qazwsx061jk/15838272.java
deleted file mode 100644
index 24f513b3..00000000
--- a/codes/qazwsx061jk/15838272.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/qianshi/13339610.java b/codes/qianshi/13339610.java
deleted file mode 100644
index 03527ec5..00000000
--- a/codes/qianshi/13339610.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
\ No newline at end of file
diff --git a/codes/qianxiaxingkong/11737212.java b/codes/qianxiaxingkong/11737212.java
deleted file mode 100644
index adf2deb6..00000000
--- a/codes/qianxiaxingkong/11737212.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 外层循环控制排序轮数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环控制每轮排序的次数
- for (int j = 0; j < n - i - 1; j++) {
- // 比较相邻两个元素的大小，如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
-
-
diff --git a/codes/qianyege/.keep b/codes/qianyege/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/qianyege/15846025.java b/codes/qianyege/15846025.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/qianyege/15846025.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/qichang0921/15671954.java b/codes/qichang0921/15671954.java
deleted file mode 100644
index e19af71f..00000000
--- a/codes/qichang0921/15671954.java
+++ /dev/null
@@ -1,23 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过重复遍历待排序的数组，比较相邻的元素并交换它们（如果它们在错误的顺序），
- * 直到没有更多的交换需要，即该数组已经排序。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序的趟数
- boolean swapped = false; // 用于标记某一趟是否发生了交换
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每一趟排序多少次
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- swapped = true; // 标记发生了交换
- }
- }
- if (!swapped) { // 如果某一趟没有发生交换，说明数组已经有序，可以提前退出
- break;
- }
- }
-} // end
diff --git a/codes/qierbao/15832037.java b/codes/qierbao/15832037.java
deleted file mode 100644
index abc13ab4..00000000
--- a/codes/qierbao/15832037.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数通过冒泡排序算法将输入的数组按照升序排列
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 外层循环控制排序的轮数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环控制每轮的比较次数
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
-
-
diff --git a/codes/qigela/.keep b/codes/qigela/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/qigela/15757052.java b/codes/qigela/15757052.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/qigela/15757052.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/qihuan/15568203.java b/codes/qihuan/15568203.java
deleted file mode 100644
index ac777e0f..00000000
--- a/codes/qihuan/15568203.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * 功能：对输入的整数数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 外层循环控制所有元素是否已排序
- for (int i = 0; i < n - 1; i++) {
- // 内层循环负责两两相邻元素比较，并根据大小交换位置
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/qingfeng/15541061.java b/codes/qingfeng/15541061.java
deleted file mode 100644
index ecf81b23..00000000
--- a/codes/qingfeng/15541061.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
diff --git a/codes/qingkouwei/15823415.java b/codes/qingkouwei/15823415.java
deleted file mode 100644
index 243a1d66..00000000
--- a/codes/qingkouwei/15823415.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过比较相邻的元素，如果前一个元素比后一个元素大，则交换它们的位置，直到整个数组有序。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/qingqingjiang/15876459.java b/codes/qingqingjiang/15876459.java
deleted file mode 100644
index 2bfcb318..00000000
--- a/codes/qingqingjiang/15876459.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过多次遍历数组，比较相邻元素并交换，实现数组的升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/qingyunzhishang/15861715.java b/codes/qingyunzhishang/15861715.java
deleted file mode 100644
index 14984b85..00000000
--- a/codes/qingyunzhishang/15861715.java
+++ /dev/null
@@ -1,26 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过多次遍历数组，每次比较相邻元素并交换位置，使得较大的元素逐渐“浮”到数组的末尾。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- // 每一轮排序的标记，用于判断是否有交换发生
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果当前元素大于下一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 标记有交换发生
- swapped = true;
- }
- }
- // 如果这一轮没有发生交换，说明数组已经有序，直接退出循环
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/qiqixiongdi/.keep b/codes/qiqixiongdi/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/qiqixiongdi/15846620.java b/codes/qiqixiongdi/15846620.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/qiqixiongdi/15846620.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/qiu040905/.15783626.java.swo b/codes/qiu040905/.15783626.java.swo
deleted file mode 100644
index 8497d30f8d6815c0cea349b29efd32f9d8330fb9..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001
literal 12288
zcmeI2&ubGw6vwB6c&du^4|wXOCZ@AV+B799UOjk{cxcICb~nL^$!<(G(ITx1^(WOr
zpjM=Z_yf;^;2|;X-=XL122t_kNe{kBvN3kSLl1?*d+^=2GxMGI9v{ddB)WFx;w4B<
zX$<42dh}!SA!B9RcKr4KvYfBx63KY1G<$RLh9!$pTX(Km^MNbNsvsAJBWu!Gj8u%P
zwq4+cZDuR{x~yu`+MG7SqcgL~cp{dV%8Qx^)SwL_Km>M6U_2d>Y5g-CYfCvx)B0vQ8Apxf}#%|->2L`hrALOwed9b8J1c(3;AOb{y2oM1x
zKm>>Y5g-CYfC%hE0>WhM&NyS=Q0n)8|NH;%BaC^d&!`sa8LE!bQ4!Q3)ThIYeLy`%
zrBTzU3DiN>Y5g-D4LtqIw&srt}jHTZ5
z-?!jO?TCdugdv)NbKqo)r4&<}qk#r>==*{OX_&CQ^N-(_(<|4%maYVF?JjdL*>jv9o}Y$WLrcys!=%J!dF-U6Fr5VpA`nGMT!zEGd+3yXr}UjE
zkbhljtahXOVx`l1-EG|c@o}}&-u5;cZgb6Bf7flTfB<*xxx2ODZ9c+HR;ua+X+Xsh
z4yKwdP0*{lUdUdy%Z{3CAp_zJs1dE+C?U=u1Q$x8EQ&a)yLHcdTE|M*v)|#%`nKDA
jJ7U6)0h2lw0(2b=L%qBA>)!j9{YvhGHdbOh6k>k>rm^D8
diff --git a/codes/qiu040905/.15783626.java.swp b/codes/qiu040905/.15783626.java.swp
deleted file mode 100644
index 2ebab4ccbc79effd936a0f4ffafcb5e4de48d6ab..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001
literal 12288
zcmeI2&ubGw6vwB6c&ZiaAMn&mO-y$;Y12qlyn65?@z9dP>~4Y+liiqXVvDpY)QVCq
z1ZqV*#2tvffY#n6#8nNZ<|BkICgiB*m3
zwp~;V+ssv!o1&)9spr&rMVntpC6e*vY=PH#CEoG$
zCZcmhfCvx)B0vO)01+SpM1Tm4Apxg6!R}z+hX%c$7{rNvaWJJo1c(3;AOb{y2oM1x
zKm>>Y5g-CYfC!8s0d6vOcapJhDEa+Ac>n)B#h8csf@-6lq8cb26+<0CeLl+AN7N%!
z1~rG8Mjb}|!hAnb--Fy^$c9=b0z`la5CI}U1c(3;AOb{y2#hU(RZx_iWir6A+Q0sL
z7oN!#zEprHXj!-bPOel=Gr2fA&>%MhU)UfF6V~?s_-#4;bpF9?_>iJNxAn$*{7NRy
zg4@^}R$!ymMIL7Qj*G+nGjMxo$=el}5m>B%mDDtb^I$;?G?c(;G#a>vPT@O6;7o(~
z>ymACn!V@i-S+EV^WKk7o88Wyx6^c6Ti*7&UV9xlxLeQM-5u}6LtJF#nqCwJR2}YM
zsN2E>y{7BM+*P~c$j+9sz|Vqg(dxGnQ5ZzvQkhqH30rk{?|V-gm a[j + 1]) {
- // 交换 a[j] 和 a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
-
diff --git a/codes/qiuwenjie/.keep b/codes/qiuwenjie/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/qiuwenjie/15846265.java b/codes/qiuwenjie/15846265.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/qiuwenjie/15846265.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/qixiaobao/15829693.java b/codes/qixiaobao/15829693.java
deleted file mode 100644
index df41992f..00000000
--- a/codes/qixiaobao/15829693.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数通过冒泡排序算法将输入的数组按照升序排列
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 外层循环控制排序的轮数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环控制每轮的比较次数
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
-
diff --git a/codes/qjpdjk578/15514740.java b/codes/qjpdjk578/15514740.java
deleted file mode 100644
index 4dd34424..00000000
--- a/codes/qjpdjk578/15514740.java
+++ /dev/null
@@ -1,26 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- if (n <= 1) {
- return; // 如果数组长度小于等于1，则不需要排序
- }
-
- for (int i = 0; i < n; ++i) {
- // 提前退出冒泡循环的标志位
- boolean flag = false;
- for (int j = 0; j < n - i - 1; ++j) {
- // 相邻元素两两对比，如果顺序不符合要求，就调整位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- flag = true; // 表示有数据交换
- }
- }
- if (!flag) break; // 没有数据交换，提前退出
- }
-} //end
diff --git a/codes/qq13189019228/15808396.java b/codes/qq13189019228/15808396.java
deleted file mode 100644
index 166dea5d..00000000
--- a/codes/qq13189019228/15808396.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数通过冒泡排序算法对数组进行排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮的比较次数
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/qq2121809344/15831326.java b/codes/qq2121809344/15831326.java
deleted file mode 100644
index 0c4c26a9..00000000
--- a/codes/qq2121809344/15831326.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int[]a,int n){
- for(int i=0;ia[j+1]){
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
diff --git a/codes/qq753755635/15717531.java b/codes/qq753755635/15717531.java
deleted file mode 100644
index 45a9d6a2..00000000
--- a/codes/qq753755635/15717531.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 功能：对给定的整数数组进行冒泡排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/qqyy123/15845835.java b/codes/qqyy123/15845835.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/qqyy123/15845835.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/qsh123/15845262.java b/codes/qsh123/15845262.java
deleted file mode 100644
index ac65fbb1..00000000
--- a/codes/qsh123/15845262.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++){
- for (int j = 0; j < n - i - 1; j++){
- if (a[j] > a[j + 1]){
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/qwaszx/15543578.java b/codes/qwaszx/15543578.java
deleted file mode 100644
index e62ce220..00000000
--- a/codes/qwaszx/15543578.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/qwe123457/15854887.java b/codes/qwe123457/15854887.java
deleted file mode 100644
index db00df43..00000000
--- a/codes/qwe123457/15854887.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组进行冒泡排序，使得数组中的元素按从小到大的顺序排列
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 外层循环控制排序趟数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环负责进行每趟排序，通过相邻元素的比较和交换来移动较大元素到数组的末尾
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
- // 经过 n-1 趟排序后，数组已经变为有序
-} // end
diff --git a/codes/qwer121234/15859995.java b/codes/qwer121234/15859995.java
deleted file mode 100644
index 54c5f386..00000000
--- a/codes/qwer121234/15859995.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
\ No newline at end of file
diff --git a/codes/qwer121256/15860383.java b/codes/qwer121256/15860383.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/qwer121256/15860383.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/qwer121278/15860433.java b/codes/qwer121278/15860433.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/qwer121278/15860433.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/qwer121290/.keep b/codes/qwer121290/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/qwer121290/15860549.java b/codes/qwer121290/15860549.java
deleted file mode 100644
index 54c5f386..00000000
--- a/codes/qwer121290/15860549.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
\ No newline at end of file
diff --git a/codes/qwerplm6/15587872.java b/codes/qwerplm6/15587872.java
deleted file mode 100644
index ae82e695..00000000
--- a/codes/qwerplm6/15587872.java
+++ /dev/null
@@ -1,35 +0,0 @@
-/**
-
- * 冒泡排序函数
-
- * aa bb cc
-
- * @param a 待排序的数组
-
- * @param n 待排序的数组长度
-
- */
-
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0; i < n-1 ; i++){
-
- for (int j = 0;j < n-1-i;j++){
-
- if(a[j] > a[j+1]){
-
- int temp = a[j];
-
- a[j] = a[j+1];
-
- a[j+1] = temp;
-
- }
-
- }
-
- }
-
-
-
-} //end
diff --git a/codes/qwert4678/.keep b/codes/qwert4678/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/qwert4678/15743469.java b/codes/qwert4678/15743469.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/qwert4678/15743469.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/qwfasfy4/.keep b/codes/qwfasfy4/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/qwfasfy4/15831401.java b/codes/qwfasfy4/15831401.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/qwfasfy4/15831401.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/ranball/15775950.java b/codes/ranball/15775950.java
deleted file mode 100644
index b011cb91..00000000
--- a/codes/ranball/15775950.java
+++ /dev/null
@@ -1,16 +0,0 @@
-public static void bubbleSort(int[] a, int n) {
- // 外层循环控制排序趟数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环控制每一趟排序多少次
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果当前元素大于下一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- // 交换元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
-
diff --git a/codes/renhaihang/15681912.java b/codes/renhaihang/15681912.java
deleted file mode 100644
index 92c1bacf..00000000
--- a/codes/renhaihang/15681912.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素两两比较并交换位置，使得每一轮循环后最大（或最小）的元素被交换到数组的末尾。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- // 如果当前元素大于下一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/replying/11277017.java b/codes/replying/11277017.java
deleted file mode 100644
index cacd12f1..00000000
--- a/codes/replying/11277017.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;ia[j+1]){
- a[j] = a[j]+a[j+1];
- a[j+1] = a[j]-a[j+1];
- a[j] = a[j]-a[j+1];
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/reseta/.keep b/codes/reseta/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/reseta/15854468.java b/codes/reseta/15854468.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/reseta/15854468.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/rhp1234/15674333.java b/codes/rhp1234/15674333.java
deleted file mode 100644
index 5538e5d1..00000000
--- a/codes/rhp1234/15674333.java
+++ /dev/null
@@ -1,26 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数通过冒泡排序算法对整数数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- // 用于标记是否发生交换，以优化排序过程
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换两个元素
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 标记发生了交换
- swapped = true;
- }
- }
- // 如果没有发生交换，则数组已经有序，可以提前结束排序
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/rice18302947981/15717388.java b/codes/rice18302947981/15717388.java
deleted file mode 100644
index a72d8eb5..00000000
--- a/codes/rice18302947981/15717388.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 遍历数组的所有元素
- for (int i = 0; i < n - 1; i++) {
- // 从第一个元素开始，比较相邻的两个元素，如果前一个元素大于后一个元素，则交换它们的位置
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j + 1] 的值
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/rider666/18719506.java b/codes/rider666/18719506.java
deleted file mode 100644
index 7710bcd3..00000000
--- a/codes/rider666/18719506.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int []a,int n) {
- for(int i=0;ia[j+1]){
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
- }
\ No newline at end of file
diff --git a/codes/rlzvpz/.keep b/codes/rlzvpz/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/rlzvpz/15777666.java b/codes/rlzvpz/15777666.java
deleted file mode 100644
index 343fcd48..00000000
--- a/codes/rlzvpz/15777666.java
+++ /dev/null
@@ -1,18 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- } //end
\ No newline at end of file
diff --git a/codes/robert_bo/15545727.java b/codes/robert_bo/15545727.java
deleted file mode 100644
index 4370113d..00000000
--- a/codes/robert_bo/15545727.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
-// 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换元素位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/robert_bo/15669897.java b/codes/robert_bo/15669897.java
deleted file mode 100644
index 72e7f26a..00000000
--- a/codes/robert_bo/15669897.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/robert_bo/15669960.java b/codes/robert_bo/15669960.java
deleted file mode 100644
index 85112f92..00000000
--- a/codes/robert_bo/15669960.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/rockandro1l/.keep b/codes/rockandro1l/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/rockandro1l/15844987.java b/codes/rockandro1l/15844987.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/rockandro1l/15844987.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/roklly/11207828.java b/codes/roklly/11207828.java
deleted file mode 100644
index 1c888994..00000000
--- a/codes/roklly/11207828.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/root0day/10353744.java b/codes/root0day/10353744.java
deleted file mode 100644
index 33f02428..00000000
--- a/codes/root0day/10353744.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n-1; i++) {
- for (int j = i+1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[i];
- a[i] = a[j];
- a[j] = temp;
- }
- }
- }
-} //end
diff --git a/codes/roy12345666/15845812.java b/codes/roy12345666/15845812.java
deleted file mode 100644
index b92ee04c..00000000
--- a/codes/roy12345666/15845812.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。
- * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一趟排序多少次
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/rree123/15719870.java b/codes/rree123/15719870.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/rree123/15719870.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/rrffhj/.keep b/codes/rrffhj/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/rrffhj/15778997.java b/codes/rrffhj/15778997.java
deleted file mode 100644
index 5edd6bf0..00000000
--- a/codes/rrffhj/15778997.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/rrr170459/15857158.java b/codes/rrr170459/15857158.java
deleted file mode 100644
index 271d2f1d..00000000
--- a/codes/rrr170459/15857158.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 将数组a按照从小到大的顺序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- // 交换a[j]和a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/rtsp8080/11303570.java b/codes/rtsp8080/11303570.java
deleted file mode 100644
index 24b49b4b..00000000
--- a/codes/rtsp8080/11303570.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0 ; i < n - 1 ; i++){
- for(int j = 0 ; j < n - 1 - i ; j++){
- if(a[j] > a[j + 1]){
- int tmp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = tmp;
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/ruoruokpl/.keep b/codes/ruoruokpl/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/ruoruokpl/15815244.java b/codes/ruoruokpl/15815244.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/ruoruokpl/15815244.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/ruoruone/15775867.java b/codes/ruoruone/15775867.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/ruoruone/15775867.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/ryange/.keep b/codes/ryange/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/ryange/15846346.java b/codes/ryange/15846346.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/ryange/15846346.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/ryer767gfgs/.keep b/codes/ryer767gfgs/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/ryer767gfgs/15743395.java b/codes/ryer767gfgs/15743395.java
deleted file mode 100644
index 96508c13..00000000
--- a/codes/ryer767gfgs/15743395.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/s0nder/15635858.java b/codes/s0nder/15635858.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/s0nder/15635858.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/s18836251852/15717550.java b/codes/s18836251852/15717550.java
deleted file mode 100644
index 06f37284..00000000
--- a/codes/s18836251852/15717550.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组a进行冒泡排序，使其变得有序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++){ // 外层循环，控制需要排序的趟数
- for(int j = 0; j < n - 1 - i; j++){ // 内层循环，负责每趟的排序
- if(a[j] > a[j + 1]){ // 如果前一个元素比后一个元素大，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/s18893442896/16477528.java b/codes/s18893442896/16477528.java
deleted file mode 100644
index 92b177d2..00000000
--- a/codes/s18893442896/16477528.java
+++ /dev/null
@@ -1,36 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-/*public static void bubbleSort(int [] a, int n){
- if (array == null || n <= 1) {
- return;
- }
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (array[j] > array[j + 1]) {
- int temp = array[j];
- array[j] = array[j + 1];
- array[j + 1] = temp;
- }
- }
- }
-}*/
-public static void bubbleSort(int[] array, int length) {
- if (array == null || length <= 1) {
- return;
- }
-
- for (int i = 0; i < length - 1; i++) {
- for (int j = 0; j < length - i - 1; j++) {
- if (array[j] > array[j + 1]) {
- // 交换 array[j] 和 array[j + 1]
- int temp = array[j];
- array[j] = array[j + 1];
- array[j + 1] = temp;
- }
- }
- }
- }
diff --git a/codes/s19555077769/15839271.java b/codes/s19555077769/15839271.java
deleted file mode 100644
index 47e0d6ef..00000000
--- a/codes/s19555077769/15839271.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 功能：对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 遍历数组，从第一个元素到倒数第二个元素
- for (int j = 0; j < n - 1 - i; j++) { // 每次比较相邻的元素，最后一个元素已经是当前轮的最大值，无需再比较
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/s20050520/15545690.java b/codes/s20050520/15545690.java
deleted file mode 100644
index ae82e695..00000000
--- a/codes/s20050520/15545690.java
+++ /dev/null
@@ -1,35 +0,0 @@
-/**
-
- * 冒泡排序函数
-
- * aa bb cc
-
- * @param a 待排序的数组
-
- * @param n 待排序的数组长度
-
- */
-
-public static void bubbleSort(int [] a, int n){
-
- for(int i = 0; i < n-1 ; i++){
-
- for (int j = 0;j < n-1-i;j++){
-
- if(a[j] > a[j+1]){
-
- int temp = a[j];
-
- a[j] = a[j+1];
-
- a[j+1] = temp;
-
- }
-
- }
-
- }
-
-
-
-} //end
diff --git a/codes/sa17737119814/15860032.java b/codes/sa17737119814/15860032.java
deleted file mode 100644
index 271d2f1d..00000000
--- a/codes/sa17737119814/15860032.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 将数组a按照从小到大的顺序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- // 交换a[j]和a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/sa17833901967/15859863.java b/codes/sa17833901967/15859863.java
deleted file mode 100644
index 271d2f1d..00000000
--- a/codes/sa17833901967/15859863.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 将数组a按照从小到大的顺序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- // 交换a[j]和a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/sad546aa/.keep b/codes/sad546aa/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/sad546aa/15743452.java b/codes/sad546aa/15743452.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/sad546aa/15743452.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/sadboy/10979809.java b/codes/sadboy/10979809.java
deleted file mode 100644
index 653d8503..00000000
--- a/codes/sadboy/10979809.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- int temp = 0;
- for (int i = 0; i < arr.length-1; i++) {
- for (int j = 0; j < arr.length-1 -i; j++) {
- if (arr[j] > arr[j+1]){
- temp = arr[j];
- arr[j] = arr[j+1];
- arr[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/sadboy/15628230.java b/codes/sadboy/15628230.java
deleted file mode 100644
index c50ecb8b..00000000
--- a/codes/sadboy/15628230.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int sad = 0; sad < n - i - 1; sad++) {
- if(a[sad] > a[sad + 1]) {
- int temp = a[sad];
- a [sad] = a[sad + 1];
- a[sad + 1] = temp;
- }
- }
- }
-
-
-} //end,sad
diff --git a/codes/saf546qafd/.keep b/codes/saf546qafd/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/saf546qafd/15743461.java b/codes/saf546qafd/15743461.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/saf546qafd/15743461.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/safafsaiuiu24/.keep b/codes/safafsaiuiu24/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/safafsaiuiu24/15831227.java b/codes/safafsaiuiu24/15831227.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/safafsaiuiu24/15831227.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/safasf342351/.keep b/codes/safasf342351/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/safasf342351/15743467.java b/codes/safasf342351/15743467.java
deleted file mode 100644
index 96508c13..00000000
--- a/codes/safasf342351/15743467.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/safasf647/.keep b/codes/safasf647/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/safasf647/15831068.java b/codes/safasf647/15831068.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/safasf647/15831068.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/saffasckkk77/.keep b/codes/saffasckkk77/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/saffasckkk77/15743383.java b/codes/saffasckkk77/15743383.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/saffasckkk77/15743383.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/sag546fa/.keep b/codes/sag546fa/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/sag546fa/15799007.java b/codes/sag546fa/15799007.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/sag546fa/15799007.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/sahofav587/11220243.java b/codes/sahofav587/11220243.java
deleted file mode 100644
index deb24387..00000000
--- a/codes/sahofav587/11220243.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i=0 ; ia[k+1]) {
- int temp=a[k];
- a[k]=a[k+1];
- a[k+1]=temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/sakut2/15592208.java b/codes/sakut2/15592208.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/sakut2/15592208.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/sam9029/.java.swp b/codes/sam9029/.java.swp
deleted file mode 100644
index b94c1c39673fe39ba0f06402fd2d196d3e8aff1d..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001
literal 12288
zcmeI&y^6v>5Ww-(UOe;#a$0LvgGcreEG)IK+eFd$!G=pNqJ`q?-NW3yf{D6Sz{W=5
zzmN<&FvIK*QiLRsli|qmyHe!qqqyDH@GQi)F{#}@iqSNPdtR{c&1}Ao51x0BKfC?3
zRB|jDx;jjwEK2vCBwQM^al^bSaTC2&vaj6kN@u!MNdf@`o)@T%y?*cdsJC06PO~w7
zz9k(HKmY**5I_I{1Q0;rZ3NP|B2M|V)%(OYR_=Qn-{wFJiU0x#Ab5oH(biGw%U5!6
H`_ujc-{mPV
diff --git a/codes/sam9029/9968905.java b/codes/sam9029/9968905.java
deleted file mode 100644
index 4817bae9..00000000
--- a/codes/sam9029/9968905.java
+++ /dev/null
@@ -1,23 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- //变量
- int template = 0; // 交换变量
-
- for(int i = 0; i < n-1; i++){
- for(int j = 0;j < n-1-i; j ++){
- if(a[j] > a[j+1]){
- template = a[j];
- a[j] = a[j+1];
- a[j+1] = template;
- }
- }
- }
-
-} //end
-
diff --git a/codes/samzoe_openanolis/15733701.java b/codes/samzoe_openanolis/15733701.java
deleted file mode 100644
index 7ec373ae..00000000
--- a/codes/samzoe_openanolis/15733701.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过对相邻的元素进行两两比较，顺序相反则进行交换，每一轮比较会将当前未排序部分的最大值“冒泡”到未排序部分的末尾。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环控制所有轮数
- for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮比较的次数
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/sandbox/11142279.java b/codes/sandbox/11142279.java
deleted file mode 100644
index b9bf7818..00000000
--- a/codes/sandbox/11142279.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n) {
- for (int i=0 ; ia[j+1]) {
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/sangeta/.keep b/codes/sangeta/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/sangeta/15720730.java b/codes/sangeta/15720730.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/sangeta/15720730.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/sansiya/15776109.java b/codes/sansiya/15776109.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/sansiya/15776109.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/sanya123/15772128.java b/codes/sanya123/15772128.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/sanya123/15772128.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/sanzhanggui/15824093.java b/codes/sanzhanggui/15824093.java
deleted file mode 100644
index d2133d7a..00000000
--- a/codes/sanzhanggui/15824093.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 遍历数组，比较相邻元素，如果顺序错误则交换位置
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- // 如果当前元素大于下一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/sar34dg674/.keep b/codes/sar34dg674/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/sar34dg674/15831280.java b/codes/sar34dg674/15831280.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/sar34dg674/15831280.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/say1ka/16051921.java b/codes/say1ka/16051921.java
deleted file mode 100644
index 2e90626b..00000000
--- a/codes/say1ka/16051921.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int i, j;
-
- for(i=0; i a[j]){//前面的数字大于后面的数字就交换
- //交换a[j-1]和a[j]
- int temp;
- temp = a[j-1];
- a[j-1] = a[j];
- a[j]=temp;
- }
- }
- }
-}
diff --git a/codes/sayslot/11250439.java b/codes/sayslot/11250439.java
deleted file mode 100644
index 7db1ed71..00000000
--- a/codes/sayslot/11250439.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int []arr, int n) {
- for(int i=0; i < n-1; i++) {
- for(int j=0; j < n-i-1; j++) {
- if(arr[j]>arr[j+1]) {
- int temp = arr[j+1];
- arr[j+1] = arr[j];
- arr[j] = temp;
- }
- }
- }
-}
\ No newline at end of file
diff --git a/codes/sccc2124/.keep b/codes/sccc2124/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/sccc2124/15831363.java b/codes/sccc2124/15831363.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/sccc2124/15831363.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/sda2022421943/15859661.java b/codes/sda2022421943/15859661.java
deleted file mode 100644
index 54c5f386..00000000
--- a/codes/sda2022421943/15859661.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
\ No newline at end of file
diff --git a/codes/sdafaf4251/.keep b/codes/sdafaf4251/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/sdafaf4251/15743466.java b/codes/sdafaf4251/15743466.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/sdafaf4251/15743466.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/sdasr5542/.keep b/codes/sdasr5542/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/sdasr5542/15743114.java b/codes/sdasr5542/15743114.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/sdasr5542/15743114.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/sdd42424/.keep b/codes/sdd42424/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/sdd42424/15824581.java b/codes/sdd42424/15824581.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/sdd42424/15824581.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/sdfghfd34/.keep b/codes/sdfghfd34/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/sdfghfd34/15826951.java b/codes/sdfghfd34/15826951.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/sdfghfd34/15826951.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/sdg56sdfasf/.keep b/codes/sdg56sdfasf/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/sdg56sdfasf/15831417.java b/codes/sdg56sdfasf/15831417.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/sdg56sdfasf/15831417.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/sdsacc23/.keep b/codes/sdsacc23/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/sdsacc23/15825736.java b/codes/sdsacc23/15825736.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/sdsacc23/15825736.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/sdt345sdfs/.keep b/codes/sdt345sdfs/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/sdt345sdfs/15743451.java b/codes/sdt345sdfs/15743451.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/sdt345sdfs/15743451.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/seebee/16266160.java b/codes/seebee/16266160.java
deleted file mode 100644
index 55088774..00000000
--- a/codes/seebee/16266160.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/selena/11289878.java b/codes/selena/11289878.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/selena/11289878.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/seven/15710966.java b/codes/seven/15710966.java
deleted file mode 100644
index c57f5a28..00000000
--- a/codes/seven/15710966.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过对相邻的元素进行两两比较，顺序相反则进行交换，每一轮比较会将当前未排序部分的最大值“冒泡”到未排序部分的末尾。
- *
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序的轮数
- // i 表示当前已经排序好的元素个数，因此每一轮排序后，最大的元素会移到正确的位置
- for (int j = 0; j < n - i - 1; j++) { // 内层循环，控制每轮中比较的次数
- // j 表示当前比较的元素索引，从0开始到n-i-2，因为最后i个元素已经是排序好的
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素
- // 则交换这两个元素的位置，保证较大的元素向数组的末尾移动
- // 交换 a[j] 和 a[j+1]
- int temp = a[j]; // 使用临时变量temp存储a[j]的值
- a[j] = a[j + 1]; // 将a[j+1]的值赋给a[j]
- a[j + 1] = temp; // 将temp（即原来的a[j]的值）赋给a[j+1]
- }
- }
- }
-} // end bubbleSort函数
diff --git a/codes/sevenpppplus/10371725.java b/codes/sevenpppplus/10371725.java
deleted file mode 100644
index df0dbf59..00000000
--- a/codes/sevenpppplus/10371725.java
+++ /dev/null
@@ -1,20 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int[] a, int n) {
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
- System.out.println("冒泡升序排序后的结果是:");
- for (int j : a) System.out.print(j + " ");
- } //end
diff --git a/codes/sf35463af/.keep b/codes/sf35463af/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/sf35463af/15831476.java b/codes/sf35463af/15831476.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/sf35463af/15831476.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/sfaf234214/.keep b/codes/sfaf234214/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/sfaf234214/15831503.java b/codes/sfaf234214/15831503.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/sfaf234214/15831503.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/sfasffasf2434/.keep b/codes/sfasffasf2434/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/sfasffasf2434/15831014.java b/codes/sfasffasf2434/15831014.java
deleted file mode 100644
index 96508c13..00000000
--- a/codes/sfasffasf2434/15831014.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/sfccwad902/.keep b/codes/sfccwad902/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/sfccwad902/15826644.java b/codes/sfccwad902/15826644.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/sfccwad902/15826644.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/sfdafas422/.keep b/codes/sfdafas422/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/sfdafas422/15743380.java b/codes/sfdafas422/15743380.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/sfdafas422/15743380.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/sgdfg56/.keep b/codes/sgdfg56/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/sgdfg56/15743475.java b/codes/sgdfg56/15743475.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/sgdfg56/15743475.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/sgdfgw234/.keep b/codes/sgdfgw234/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/sgdfgw234/15829828.java b/codes/sgdfgw234/15829828.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/sgdfgw234/15829828.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/shangxing117/.keep b/codes/shangxing117/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/shangxing117/15742267.java b/codes/shangxing117/15742267.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/shangxing117/15742267.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/shankailun10/.keep b/codes/shankailun10/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/shankailun10/9637756.java b/codes/shankailun10/9637756.java
deleted file mode 100644
index 4dbc2659..00000000
--- a/codes/shankailun10/9637756.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- *
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 你的代码，使无序数组 a 变得有序
- int i, j;
- for (i = 0; i < n; i++) {//表示n次排序过程。
- for (j = 1; j < n - i; j++) {
- if (a[j - 1] > a[j]) {//前面的数字大于后面的数字就交换
- //交换a[j-1]和a[j]
- int temp;
- temp = a[j - 1];
- a[j - 1] = a[j];
- a[j] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/shankailun10/9638206.java b/codes/shankailun10/9638206.java
deleted file mode 100644
index 4dbc2659..00000000
--- a/codes/shankailun10/9638206.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- *
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 你的代码，使无序数组 a 变得有序
- int i, j;
- for (i = 0; i < n; i++) {//表示n次排序过程。
- for (j = 1; j < n - i; j++) {
- if (a[j - 1] > a[j]) {//前面的数字大于后面的数字就交换
- //交换a[j-1]和a[j]
- int temp;
- temp = a[j - 1];
- a[j - 1] = a[j];
- a[j] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/shankailun10/9682326.java b/codes/shankailun10/9682326.java
deleted file mode 100644
index 4dbc2659..00000000
--- a/codes/shankailun10/9682326.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- *
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 你的代码，使无序数组 a 变得有序
- int i, j;
- for (i = 0; i < n; i++) {//表示n次排序过程。
- for (j = 1; j < n - i; j++) {
- if (a[j - 1] > a[j]) {//前面的数字大于后面的数字就交换
- //交换a[j-1]和a[j]
- int temp;
- temp = a[j - 1];
- a[j - 1] = a[j];
- a[j] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/sharpery/15562912.java b/codes/sharpery/15562912.java
deleted file mode 100644
index c2afaa24..00000000
--- a/codes/sharpery/15562912.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
diff --git a/codes/shelly/9674981.java b/codes/shelly/9674981.java
deleted file mode 100644
index 7aa905f3..00000000
--- a/codes/shelly/9674981.java
+++ /dev/null
@@ -1,24 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int j=0;ja[i+1])
- {
- temp=a[i];
- a[i]=a[i+1];
- a[i+1]=temp;
- }
- }
- }
- //System.out.println(a);
-
-} //end
diff --git a/codes/shelove/11217672.java b/codes/shelove/11217672.java
deleted file mode 100644
index 272a12fc..00000000
--- a/codes/shelove/11217672.java
+++ /dev/null
@@ -1,18 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- } //end
\ No newline at end of file
diff --git a/codes/shenshenwa/15846503.java b/codes/shenshenwa/15846503.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/shenshenwa/15846503.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/sherlinz0/9688047.java b/codes/sherlinz0/9688047.java
deleted file mode 100644
index e7fed9e2..00000000
--- a/codes/sherlinz0/9688047.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n - 1; i++){
- for(int j = 0; j < n - i - 1; j++){
- if(a[j] > a[j + 1]) {
- int t = a[j];
- a[j] = a[j + 1];
- a[j + 1] = t;
- }
- }
- }
-} //end
diff --git a/codes/shiguang173/15759081.java b/codes/shiguang173/15759081.java
deleted file mode 100644
index 76cbddd8..00000000
--- a/codes/shiguang173/15759081.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int b = 0; b < n - i - 1; b++) {
- if(a[b] > a[b + 1]) {
- int temp = a[b];
- a [b] = a[b + 1];
- a[b + 1] = temp;
- }
- }
- }
-
-
-} //end
diff --git a/codes/shihantao/.keep b/codes/shihantao/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/shihantao/10039704.java b/codes/shihantao/10039704.java
deleted file mode 100644
index e3648990..00000000
--- a/codes/shihantao/10039704.java
+++ /dev/null
@@ -1,17 +0,0 @@
- /* 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/shihantao1/.keep b/codes/shihantao1/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/shiove/15669581.java b/codes/shiove/15669581.java
deleted file mode 100644
index 7b731aa8..00000000
--- a/codes/shiove/15669581.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/shiyigela/.keep b/codes/shiyigela/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/shiyigela/15758629.java b/codes/shiyigela/15758629.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/shiyigela/15758629.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/shongz/15517802.java b/codes/shongz/15517802.java
deleted file mode 100644
index e98e6cc6..00000000
--- a/codes/shongz/15517802.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数实现了冒泡排序算法，将数组中的元素按照从小到大的顺序排列
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) { // 外层循环，表示遍历所有未排序的元素
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环，用于比较相邻的元素并进行交换
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/shrcc1314/.keep b/codes/shrcc1314/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/shrcc1314/15844211.java b/codes/shrcc1314/15844211.java
deleted file mode 100644
index 96508c13..00000000
--- a/codes/shrcc1314/15844211.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/shuchaoyang/15534407.java b/codes/shuchaoyang/15534407.java
deleted file mode 100644
index 46e84220..00000000
--- a/codes/shuchaoyang/15534407.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n-1 ; i++){
- for (int j = 0;j < n-1-i;j++){
- if(a[j] > a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/shuijiao/15776076.java b/codes/shuijiao/15776076.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/shuijiao/15776076.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/shunvdouniu/15841229.java b/codes/shunvdouniu/15841229.java
deleted file mode 100644
index 4350d9c6..00000000
--- a/codes/shunvdouniu/15841229.java
+++ /dev/null
@@ -1,12 +0,0 @@
-public static void bubbleSort(int[] arr, int length) {
- for (int i = 0; i < length - 1; i++) {
- for (int j = 0; j < length - i - 1; j++) {
- if (arr[j] > arr[j + 1]) {
- // 交换 arr[j] 和 arr[j+1]
- int temp = arr[j];
- arr[j] = arr[j + 1];
- arr[j + 1] = temp;
- }
- }
- }
- }
diff --git a/codes/shuoshu131/18614920.java b/codes/shuoshu131/18614920.java
deleted file mode 100644
index 52e509ff..00000000
--- a/codes/shuoshu131/18614920.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/shuyiyi/15683952.java b/codes/shuyiyi/15683952.java
deleted file mode 100644
index 54c5f386..00000000
--- a/codes/shuyiyi/15683952.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
\ No newline at end of file
diff --git a/codes/sianjen/10330887.java b/codes/sianjen/10330887.java
deleted file mode 100644
index efa6ab36..00000000
--- a/codes/sianjen/10330887.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i=0;ia[j+1]){
- int temp=a[j];
- a[j]=a[j+1];
- a[j+1]=temp;
- }
- }
- }
-
-} //end
diff --git a/codes/sichen123/15721908.java b/codes/sichen123/15721908.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/sichen123/15721908.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/silverSmith/15774806.java b/codes/silverSmith/15774806.java
deleted file mode 100644
index 7745e0a9..00000000
--- a/codes/silverSmith/15774806.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素两两比较，将较大的元素交换到数组的末尾，经过多轮比较后，整个数组变得有序。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- // 每一轮排序，最后一个元素已经是最大的，所以不需要再比较
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果当前元素大于下一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换a[j]和a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/siqiwang/.keep b/codes/siqiwang/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/siqiwang/15311318.java b/codes/siqiwang/15311318.java
deleted file mode 100644
index 343fcd48..00000000
--- a/codes/siqiwang/15311318.java
+++ /dev/null
@@ -1,18 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- } //end
\ No newline at end of file
diff --git a/codes/sisiya/15723000.java b/codes/sisiya/15723000.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/sisiya/15723000.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/siwuge2/.keep b/codes/siwuge2/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/siwuge2/15720932.java b/codes/siwuge2/15720932.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/siwuge2/15720932.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/sjms1u2n3s4h5/10104996.java b/codes/sjms1u2n3s4h5/10104996.java
deleted file mode 100644
index ea1a4cbb..00000000
--- a/codes/sjms1u2n3s4h5/10104996.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- int temp = 0;
- for(int i=0; ii; j--)
- {
- if(a[j] < a[j-1])
- {
- temp = a[j];
- a[j] = a[j-1];
- a[j-1] = temp;
- }
- }
-
-} //end
diff --git a/codes/sk1234/15778693.java b/codes/sk1234/15778693.java
deleted file mode 100644
index de89a751..00000000
--- a/codes/sk1234/15778693.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组a进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换a[j]和a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/sk123456/15858299.java b/codes/sk123456/15858299.java
deleted file mode 100644
index 271d2f1d..00000000
--- a/codes/sk123456/15858299.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 将数组a按照从小到大的顺序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数
- for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数
- if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置
- // 交换a[j]和a[j + 1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/skysky/15776206.java b/codes/skysky/15776206.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/skysky/15776206.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/slamer/11242607.java b/codes/slamer/11242607.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/slamer/11242607.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/smartpulse/.keep b/codes/smartpulse/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/smartpulse/15774449.java b/codes/smartpulse/15774449.java
deleted file mode 100644
index 6426772f..00000000
--- a/codes/smartpulse/15774449.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n - i - 1; j++) {
- if(a[j] > a[j + 1]) {
- int temp = a[j];
- a [j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-
-
-} //end
\ No newline at end of file
diff --git a/codes/smcO0O/.java b/codes/smcO0O/.java
deleted file mode 100644
index 8b137891..00000000
--- a/codes/smcO0O/.java
+++ /dev/null
@@ -1 +0,0 @@
-
diff --git a/codes/smcO0O/10708545.java b/codes/smcO0O/10708545.java
deleted file mode 100644
index c105bd77..00000000
--- a/codes/smcO0O/10708545.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n - 1; i++){
- for(int j = 0; j < n - 1 - i; j++){
- if(a[j] > a[j + 1])
- {
- int swap = 0;
- swap = a[j];
- a[j] = a[j+1];
- a[j+1] = swap;
- }
- }
- }
-
-} //end
diff --git a/codes/smesa6/11229202.java b/codes/smesa6/11229202.java
deleted file mode 100644
index cdabc2e0..00000000
--- a/codes/smesa6/11229202.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = i + 1; j < n; j++) {
- if (a[i] > a[j]) {
- int temp = a[j];
- a[j] = a[i];
- a[i] = temp;
-
- }
- }
- }
-
-} //end
\ No newline at end of file
diff --git a/codes/snowfog/11357833.java b/codes/snowfog/11357833.java
deleted file mode 100644
index 272a12fc..00000000
--- a/codes/snowfog/11357833.java
+++ /dev/null
@@ -1,18 +0,0 @@
- /**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
- public static void bubbleSort(int [] arr, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = (i + 1); j < n; j++) {
- if (arr[i] > arr[j]) {
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- } //end
\ No newline at end of file
diff --git a/codes/solo1017805211/.java b/codes/solo1017805211/.java
deleted file mode 100644
index 69b530c2..00000000
--- a/codes/solo1017805211/.java
+++ /dev/null
@@ -1,23 +0,0 @@
-
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
-
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
-
-
diff --git a/codes/solo1017805211/16409853.java b/codes/solo1017805211/16409853.java
deleted file mode 100644
index 4f26415a..00000000
--- a/codes/solo1017805211/16409853.java
+++ /dev/null
@@ -1,24 +0,0 @@
-
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
-
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
-
-
-
diff --git a/codes/solo1017805211/16441292.java b/codes/solo1017805211/16441292.java
deleted file mode 100644
index e690f9a9..00000000
--- a/codes/solo1017805211/16441292.java
+++ /dev/null
@@ -1,22 +0,0 @@
-
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
-
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
-
-
-
diff --git a/codes/solo1017805211/16442270.java b/codes/solo1017805211/16442270.java
deleted file mode 100644
index af9b35f0..00000000
--- a/codes/solo1017805211/16442270.java
+++ /dev/null
@@ -1,23 +0,0 @@
-
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
-
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
-
-
-
diff --git a/codes/solo1017805211/16445723.java b/codes/solo1017805211/16445723.java
deleted file mode 100644
index 0bd357ce..00000000
--- a/codes/solo1017805211/16445723.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
-
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/solo1017805211/16558637.java b/codes/solo1017805211/16558637.java
deleted file mode 100644
index 0bd357ce..00000000
--- a/codes/solo1017805211/16558637.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
-
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/someoneunknown/.keep b/codes/someoneunknown/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/someoneunknown/15815800.java b/codes/someoneunknown/15815800.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/someoneunknown/15815800.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/sqScripter/.keep b/codes/sqScripter/.keep
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/sqScripter/15846693.java b/codes/sqScripter/15846693.java
deleted file mode 100644
index 6e9861fa..00000000
--- a/codes/sqScripter/15846693.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
-
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
\ No newline at end of file
diff --git a/codes/ss12wzh/15780057.java b/codes/ss12wzh/15780057.java
deleted file mode 100644
index 91234774..00000000
--- a/codes/ss12wzh/15780057.java
+++ /dev/null
@@ -1,26 +0,0 @@
-/**
- * 冒泡排序函数
- * 冒泡排序是一种简单的排序算法，它重复地走访过要排序的元素，一次比较两个元素，如果他们的顺序错误就把他们交换过来。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) {
- // 标记是否有交换，用于优化，如果在一趟排序中没有发生交换，则数组已经有序
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 发生了交换，标记为true
- swapped = true;
- }
- }
- // 如果在一趟排序中没有发生交换，则数组已经有序，可以提前结束
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/ssr88888888/10999180.java b/codes/ssr88888888/10999180.java
deleted file mode 100644
index 607a9246..00000000
--- a/codes/ssr88888888/10999180.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡 排序 函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-}//end
diff --git a/codes/sssdzh/15830739.java b/codes/sssdzh/15830739.java
deleted file mode 100644
index e54f7b63..00000000
--- a/codes/sssdzh/15830739.java
+++ /dev/null
@@ -1,27 +0,0 @@
-/**
- * 冒泡排序函数
- * 遍历数组，通过相邻元素比较和交换，将最大（或最小）的元素逐渐“浮”到数组的一端。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- // 标记变量，用于检测本次循环是否发生了交换，如果没有交换说明数组已经有序
- boolean swapped = false;
- for (int j = 0; j < n - i - 1; j++) {
- // 如果当前元素大于下一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- // 标记本次循环发生了交换
- swapped = true;
- }
- }
- // 如果在某一轮循环中没有发生交换，说明数组已经有序，直接退出
- if (!swapped) {
- break;
- }
- }
-} //end
diff --git a/codes/sssyl547222/15827096.jaba b/codes/sssyl547222/15827096.jaba
deleted file mode 100644
index e69de29b..00000000
diff --git a/codes/sssyl547222/15827096.java b/codes/sssyl547222/15827096.java
deleted file mode 100644
index d0df6489..00000000
--- a/codes/sssyl547222/15827096.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 对数组a进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++){
- for(int j = 0; j < n - 1 - i; j++){
- if(a[j] > a[j + 1]){
- // 交换a[j]和a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/ssy123/15792965.java b/codes/ssy123/15792965.java
deleted file mode 100644
index cf9befa4..00000000
--- a/codes/ssy123/15792965.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数对输入的数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 遍历所有数组元素
- for (int i = 0; i < n - 1; i++) {
- // Last i elements are already in place
- for (int j = 0; j < n - i - 1; j++) {
- // 如果当前元素大于下一个元素，则交换它们
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/ssya12/15718593.java b/codes/ssya12/15718593.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/ssya12/15718593.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/steven_0324/15724446.java b/codes/steven_0324/15724446.java
deleted file mode 100644
index 23f19729..00000000
--- a/codes/steven_0324/15724446.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 该函数用于对整数数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (a[j] > a[j + 1]) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/stevenchendy/10044195.java b/codes/stevenchendy/10044195.java
deleted file mode 100644
index 3a58202b..00000000
--- a/codes/stevenchendy/10044195.java
+++ /dev/null
@@ -1,25 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;i a[j+1]){
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-
-} //end
-
-
-
-
-
-
diff --git a/codes/stevending1st/15193096.java b/codes/stevending1st/15193096.java
deleted file mode 100644
index 79c1730e..00000000
--- a/codes/stevending1st/15193096.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for(int i = 0; i < n - 1; i++) {
- for(int j = 0; j < n -1 - i; j++) {
- if( a[j] > a[j + 1]) {
- int temp = a[j+1];
- a[j+1] = a[j];
- a[j] = temp;
- }
- }
- }
-} //end
diff --git a/codes/subNvue/11264972.java b/codes/subNvue/11264972.java
deleted file mode 100644
index 9e7534d4..00000000
--- a/codes/subNvue/11264972.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡 排序 函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < i; j++) {
- if (a[i] < a[j]) {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- }
- }
-}//end
\ No newline at end of file
diff --git a/codes/suisuiya/15775252.java b/codes/suisuiya/15775252.java
deleted file mode 100644
index 98737781..00000000
--- a/codes/suisuiya/15775252.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int liuy = 0; liuy < n - i - 1; liuy++) {
- if(a[liuy] > a[liuy + 1]) {
- int temp = a[liuy];
- a [liuy] = a[liuy + 1];
- a[liuy + 1] = temp;
- }
- }
- }
-
-
-} //end,liuy
diff --git a/codes/suixin186/15758969.java b/codes/suixin186/15758969.java
deleted file mode 100644
index f2b711a4..00000000
--- a/codes/suixin186/15758969.java
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i = 0; i < n; i++) {
- for(int huat = 0; huat < n - i - 1; huat++) {
- if(a[huat] > a[huat + 1]) {
- int temp = a[huat];
- a [huat] = a[huat + 1];
- a[huat + 1] = temp;
- }
- }
- }
-
-
-} //end,huat
diff --git a/codes/suiyue97/15816307.java b/codes/suiyue97/15816307.java
deleted file mode 100644
index 8a9fb777..00000000
--- a/codes/suiyue97/15816307.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 使用冒泡排序算法对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- // 如果前一个元素大于后一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/sundong/15615609.java b/codes/sundong/15615609.java
deleted file mode 100644
index d3167e56..00000000
--- a/codes/sundong/15615609.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/**
- * 冒泡排序函数
- * 通过相邻元素两两比较和交换，将较大的元素逐步“浮”到数组的末尾，实现排序。
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- // 外层循环控制排序的轮数
- for (int i = 0; i < n - 1; i++) {
- // 内层循环控制每轮排序的比较次数
- for (int j = 0; j < n - 1 - i; j++) {
- // 如果当前元素大于下一个元素，则交换它们的位置
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
- // 当所有轮排序完成后，数组 a 变得有序
-} // end
diff --git a/codes/sunfei2024/15869590.java b/codes/sunfei2024/15869590.java
deleted file mode 100644
index 24f513b3..00000000
--- a/codes/sunfei2024/15869590.java
+++ /dev/null
@@ -1,11 +0,0 @@
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}
diff --git a/codes/sunjinglei/9956147.java b/codes/sunjinglei/9956147.java
deleted file mode 100644
index 2421b8ea..00000000
--- a/codes/sunjinglei/9956147.java
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- for (int i = 0; i < n- 1; i++) {
- for (int j = 0; j < n-1 - i; j++) {
- if (a[j] > a[j + 1]) {
- int temp = a[j];
- a[j] = a[j+1];
- a[j+1] = temp;
- }
- }
- }
-} //end
diff --git a/codes/sunxiaoke/15838991.java b/codes/sunxiaoke/15838991.java
deleted file mode 100644
index 47e0d6ef..00000000
--- a/codes/sunxiaoke/15838991.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- * 冒泡排序函数
- * 功能：对数组进行升序排序
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int[] a, int n) {
- for (int i = 0; i < n - 1; i++) { // 遍历数组，从第一个元素到倒数第二个元素
- for (int j = 0; j < n - 1 - i; j++) { // 每次比较相邻的元素，最后一个元素已经是当前轮的最大值，无需再比较
- if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-} // end
diff --git a/codes/sunxiaoshou/15541950.java b/codes/sunxiaoshou/15541950.java
deleted file mode 100644
index d6663ea3..00000000
--- a/codes/sunxiaoshou/15541950.java
+++ /dev/null
@@ -1,12 +0,0 @@
-public static void bubbleSort(int [] a,int n){
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - 1 - i; j++) {
- if (a[j] > a[j + 1]) {
- // 交换 a[j] 和 a[j+1]
- int temp = a[j];
- a[j] = a[j + 1];
- a[j + 1] = temp;
- }
- }
- }
-}//end
diff --git a/codes/sunys312/10087139.java b/codes/sunys312/10087139.java
deleted file mode 100644
index 0557f90f..00000000
--- a/codes/sunys312/10087139.java
+++ /dev/null
@@ -1,19 +0,0 @@
-/**
- * 冒泡排序函数
- * aa bb cc
- * @param a 待排序的数组
- * @param n 待排序的数组长度
- */
-public static void bubbleSort(int [] a, int n){
- // 你的代码，使无序数组 a 变得有序
- for(int i=0;i