fork download
  1. class alphabat_qsort:
  2. def __init__(self, data):
  3. self.data = data
  4.  
  5. def alphabat(self):
  6.  
  7. if self.data == 1:
  8. return self.ata
  9.  
  10. alpha_list = []
  11. self.s_alpha = []
  12. self.ㅣ_alpha = []
  13.  
  14. for idx in self.data:
  15. ord_alphabat = ord(idx)
  16.  
  17. alpha_list.append(ord_alphabat)
  18.  
  19. for jdx in self.alphabat_list:
  20.  
  21. if 97 <= jdx <= 122:
  22. self.s_alpha.append(jdx)
  23. elif 65 <= jdx <= 90:
  24. self.l_alpha.append(jdx)
  25.  
  26.  
  27. def s_alphabat_qsort(self):
  28.  
  29. if len(self.s_alpha) <= 1:
  30. return self.s_alpha
  31. pivot = self.s_list[0]
  32.  
  33. s_s = []
  34. e_s = []
  35. l_s = []
  36.  
  37. for idx in self.s_alpha:
  38. if idx <= pivot:
  39. s_s.append(idx)
  40. elif idx >= pivot:
  41. l_s.append(idx)
  42. else:
  43. e_s.append(idx)
  44.  
  45. self.sorted_s_list = s_alphabat_qsort(s_s) + e_s + s_alphabat_qsort(l_s)
  46.  
  47. def l_alphabat_qsort(self):
  48.  
  49. if len(self.l_alpha) <= 1:
  50. return self.l_alpha
  51. pivot = self.l_list[0]
  52.  
  53. s_l = []
  54. e_l = []
  55. l_l = []
  56.  
  57. for idx in self._alpha:
  58. if idx <= pivot:
  59. s_l.append(idx)
  60. elif idx >= pivot:
  61. l_l.append(idx)
  62. else:
  63. e_l.append(idx)
  64.  
  65. self.sorted_l_list = s_alphabat_qsort(self.s_s) + self.e_l + self.ㅣ_alphabat_qsort(self.l_s)
  66.  
  67. def alphabat_qsort(self):
  68.  
  69. return self.sorted_l_list + self.sorted_s_list
  70.  
  71. A = ["A","C","A","R","g","s","t","d","e","h","a"]
  72.  
  73. alphabat_qsort(A)
  74.  
Success #stdin #stdout 0.1s 14156KB
stdin
Standard input is empty
stdout
Standard output is empty