Professional Documents
Culture Documents
C(1)=A(1)=5 )A(1)<B(1
C(2)=B(1)=11 )A(2)>B(1
C(3)=B(2)=17 )A(2)>B(2
C(4)=B(3)=41 )A(2)>B(3
C(5)=A(2)=43 )A(2)<B(4
C(6)=A(3)=54 )A(3)<B(3
C(7)=B(4)=66
C(8)=B(5)=93
ﻋﺪد اﻟﻤﻘﺎرﻧﺎت اﻟﻤﺴﺘﺨﺪﻣﺔ ﻓﻲ اﻟﺘﺮﺗﻴﺐ ﺑﺎﻟﺪﻣﺞ اﻟﺒﺴﻴﻂ هﻲ ) )( Ln (N+M
1
Radix Sort Algorithm
ﺧﻮارزﻣﻴﺔ اﻟﺘﺮﺗﻴﺐ ﺑﺎﺳﺘﺨﺪام اﻻﺳﺎس
ﻓﻜﺮﺗﻬﺎ-:
ﻓﻲ هﺬا اﻟﻨﻮع ﻣﻦ اﻟﺘﺮﺗﻴﺐ ﻻﻧﺤﺘﺎج ﻻﺟﺮاء أي ﻣﻘﺎرﻧﺎت ﺑﻴﻦ اﻟﻌﻨﺎﺻﺮﺑﻞ ﻳﺘﻢ ﺗﻮزﻳﻊ اﻟﻌﻨﺎﺻﺮ ﺣﺴﺐ ﻣﻔﺘﺎح ﻣﻌﻴﻦ اﻟﻰ ﻣﻠﻔ ﺎت ﺛﺎﻧﻮﻳ ﺔ ﻓﻠ ﻮ آ ﺎن
اﻟﻤﻔﺘﺎح هﻮ اﻻﺳﺎس ﻟﻠﻨﻈﺎم اﻟﻌﺸﺮي ﻓﺎﻧﻬﺎ ﺗﻌﺘﻤﺪ ان اﻟﻌﺪد ﻳﺘﻜﻮن ﻣﻦ اﺣﺎد ,ﻋﺸﺮات,ﻣﺌﺎت......اﻟﺦ.
اذن ﻓﻲ هﺬﻩ اﻟﺤﺎﻟﺔ ﻳﺘﻢ ﺗﺮﺗﻴﺐ ﻣﻠﻒ اﻻدﺧﺎل ﻋﻦ ﻃﺮﻳﻖ ﺗﻮزﻳﻊ ﻗﻴﻮد ﻣﻠﻔﺎت ﻓﺮﻋﻴﺔ وﻳﻜﻮن ﻋﺪدهﺎ ﺑﻘﺪر ﻋﺪد اﻋﺪاد ذﻟﻚ اﻟﻨﻈﺎم .
ﻓﻲ اﻟﻤﺮﺣﻠﺔ اﻻوﻟﻰ ﻧﺤﺼﻞ اﻋﺪاد ﻣﺮﺗﺒﺔ ﺣﺴﺐ اﻻﺣﺎد.
ﻓﻲ اﻟﻤﺮﺣﻠﺔ اﻟﺜﺎﻧﻴﺔ ﻧﺤﺼﻞ اﻋﺪاد ﻣﺮﺗﺒﺔ ﺣﺴﺐ اﻟﻌﺸﺮات.
ﻓﻲ اﻟﻤﺮﺣﻠﺔ اﻟﺜﺎﻟﺜﺔ ﻧﺤﺼﻞ اﻋﺪاد ﻣﺮﺗﺒﺔ ﺣﺴﺐ ﻣﺌﺎﺗﻬﺎ ....اﻟﺦ.
ﻣﺜﺎل -:رﺗﺐ ﻋﻨﺎﺻﺮ اﻟﻘﺎﺋﻤﺔ اﻟﺘﺎﻟﻴﺔ ﺑﺎﺳﺘﺨﺪام ﻃﺮﻳﻘﺔ اﻟﺘﺮﺗﻴﺐ ﺑﺎﺳﺘﺨﺪام اﻻﺳﺎس اﻟﻌﺸﺮي
ﺧﻄﻮات اﻟﺤﻞ-:
اﻟﻘﺎﺋﻤﺔ ﺑﻌﺪ اﻟﻤﺮﺣﻠﺔ 2 ﻣﻠﻒ اﻟﻘﺎﺋﻤﺔ ﺑﻌﺪ اﻟﻤﺮﺣﻠﺔ 1 ﻣﻠﻒ اﻻﺣﺎد اﻟﻘﺎﺋﻤﺔ
اﻟﻤﺮﺣﻠﺔ2 اﻟﻌﺸﺮات اﻟﻤﺮﺣﻠﺔ 1
5 5 0 41 ﻻﻳﻮﺟﺪ 0 66
11 11,17 1 11 11,41 1 5
17 ﻻﻳﻮﺟﺪ 2 43 ﻻﻳﻮﺟﺪ 2 17
41 ﻻﻳﻮﺟﺪ 3 93 93,43 3 93
43 41,43 4 54 54 4 41
54 54 5 5 5 5 11
66 66 6 66 66 6 54
93 ﻻﻳﻮﺟﺪ 7 17 17 7 43
ﻻﻳﻮﺟﺪ 8 ﻻﻳﻮﺟﺪ 8 54
93 9 ﻻﻳﻮﺟﺪ 9 43
.3ﻧﻘﺎرن اﻟﻌﻨﺼﺮ اﻟﺜﺎﻧﻲ ﻣﻦ اﻟﻘﺎﺋﻤﺔ Aﻣﻊ ﻧﻈﺮﻳﻪ ﻣﻦ اﻟﻘﺎﺋﻤﺔ اﻟﺜﺎﻧﻴﺔ Bوﻧﻀﻌﻬﺎ ﺑﺎﻟﺘﺮﺗﻴﺐ ﻓﻲ اﻟﻘﺎﺋﻤﺔ D
2
. C,D .4ﻧﻜﺮر اﻟﺨﻄﻮات 2,3وﻧﺤﺼﻞ ﻋﻠﻰ ﻋﻨﺎﺻﺮ ﺑﻄﻮل 2ﻓﻲ اﻟﻘﺎﺋﻤﺘﻴﻦ
A,B .5ﺑﻨﻔﺲ اﻟﻄﺮﻳﻘﺔ ﻧﺪﻣﺞ ﻋﻨﺎﺻﺮ اﻟﻘﺎﺋﻤﺘﻴﻦ C,Dﻟﻨﺤﺼﻞ ﻋﻠﻰ ﻋﻨﺎﺻﺮ ﺑﻄﻮل 4ﻓﻲ اﻟﻘﺎﺋﻤﺘﻴﻦ
.6ﺑﻨﻔﺲ اﻟﻄﺮﻳﻘﺔ ﻧﻘﻮم ﺑﺪﻣﺞ ﻋﻨﺎﺻﺮ اﻟﻘﺎﺋﻤﺘﻴﻦ A,Bﻟﻨﺤﺼﻞ ﻋﻠﻰ ﻋﻨﺎﺻﺮ ﺑﻄﻮل ﺛﻤﺎﻧﻴﺔ.
.7ﻧﺴﺘﻤﺮ ﺑﻬﺬا اﻻﺳﻠﻮب ﻟﺤﻴﻦ اﻟﺤﺼﻮل ﻋﻠﻰ ﻗﺎﺋﻤﺔ ﻣﺮﺗﺒﺔ.
وهﻲ اﺣﺪ ﻃﺮق اﻟﺘﺮﺗﻴﺐ اﻟﺨﺎرﺟﻲ .
ﻣﺜﺎل -:رﺗﺐ ﻋﻨﺎﺻﺮ اﻟﻘﺎﺋﻤﺔ اﻟﺘﺎﻟﻴﺔ ﺑﺎﺳﺘﺨﺪام ﻃﺮﻳﻘﺔ اﻟﺪﻣﺞ اﻟﻤﺘﻮازي ذي اﻟﻤﺴﺎرﻳﻦ
C: 5,11,17,41,43,54,66,93
3