#3.2 - Quicksort

ALGORITMOS E ESTRUTURAS
DE DADOS I
Métodos de ordenação - Quicksort
Baseado nos slides dos Profs. Michael Móra e Afonso Sales

Quicksort
void quicksort(int [] v, int low, int high) {
int pivot;
if ((high-low) > 0) {
pivot = partition(v, low, high);
quicksort(v, low, pivot-1);
quicksort(v, pivot+1, high);
}
v
}
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5
int partition(int [] v, int low, int high) {
int i, p, firsthigh;
firsthigh = low;
p = high;
for (i=low; i<high; i++)
if (v[i] < v[p]) {
swap(v, i, firsthigh);
firsthigh = firsthigh + 1;
}
swap(v, p, firsthigh);
return firsthigh;
}
• Que função o algoritmo desempenha?

• Como funciona?
Quicksort (árvore de recursão)
quicksort(v, 0, 9)
v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5 3
quicksort(v, 0, 9)
pivot = ?
v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5
quicksort(v, 0, 9)
pivot = 4
v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5
quicksort(v, 0, 9)
pivot = 4
quicksort(v, 0, 3)
v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5
quicksort(v, 0, 9)
pivot = 4
quicksort(v, 0, 3)
pivot = ?
v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5
quicksort(v, 0, 9)
pivot = 4
quicksort(v, 0, 3)
pivot = 3
v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5 8
quicksort(v, 0, 9)
pivot = 4
quicksort(v, 0, 3)
pivot = 3
quicksort(v, 0, 2)
v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5 9
quicksort(v, 0, 9)
pivot = 4
quicksort(v, 0, 3)
pivot = 3
quicksort(v, 0, 2)
pivot = ?
v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5
quicksort(v, 0, 9)
pivot = 4
quicksort(v, 0, 3)
pivot = 3
quicksort(v, 0, 2)
pivot = 2
v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5
quicksort(v, 0, 9)
pivot = 4
quicksort(v, 0, 3)
pivot = 3
quicksort(v, 0, 2)
pivot = 2
quicksort(v, 0, 1)
v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5
quicksort(v, 0, 9)
pivot = 4
quicksort(v, 0, 3)
pivot = 3
quicksort(v, 0, 2)
pivot = 2
quicksort(v, 0, 1)
pivot = ?
v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5
quicksort(v, 0, 9)
pivot = 4
quicksort(v, 0, 3)
pivot = 3
quicksort(v, 0, 2)
pivot = 2
quicksort(v, 0, 1)
pivot = 0
v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5
quicksort(v, 0, 9)
pivot = 4
quicksort(v, 0, 3)
pivot = 3
quicksort(v, 0, 2)
pivot = 2
quicksort(v, 0, 1)
pivot = 0
v
quicksort(v, 0, -1) 0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5
quicksort(v, 0, 9)
pivot = 4
quicksort(v, 0, 3)
pivot = 3
quicksort(v, 0, 2)
pivot = 2
quicksort(v, 0, 1)
pivot = 0
v
quicksort(v, 0, -1) 0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5
quicksort(v, 0, 9)
pivot = 4
quicksort(v, 0, 3)
pivot = 3
quicksort(v, 0, 2)
pivot = 2
quicksort(v, 0, 1)
pivot = 0
v
quicksort(v, 0, -1) quicksort(v, 1, 1) 0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5
quicksort(v, 0, 9)
pivot = 4
quicksort(v, 0, 3)
pivot = 3
quicksort(v, 0, 2)
pivot = 2
quicksort(v, 0, 1)
pivot = 0
v
6 1 12 40 1 29 2 3 17 5
quicksort(v, 0, 9)
pivot = 4
quicksort(v, 0, 3)
pivot = 3
quicksort(v, 0, 2)
pivot = 2
quicksort(v, 0, 1)
pivot = 0
v
6 1 12 40 1 29 2 3 17 5
quicksort(v, 0, 9)
pivot = 4
quicksort(v, 0, 3)
pivot = 3
quicksort(v, 0, 2)
pivot = 2
quicksort(v, 0, 1) quicksort(v, 3, 2)
pivot = 0
v
6 1 12 40 1 29 2 3 20 17 5
quicksort(v, 0, 9)
pivot = 4
quicksort(v, 0, 3)
pivot = 3
quicksort(v, 0, 2)
pivot = 2
pivot = 0
v
6 1 12 40 1 29 2 3 2117 5
quicksort(v, 0, 9)
pivot = 4
quicksort(v, 0, 3)
pivot = 3
quicksort(v, 0, 2)
pivot = 2
pivot = 0
v
6 1 12 40 1 29 2 3 22 17 5
quicksort(v, 0, 9)
pivot = 4
quicksort(v, 0, 3)
pivot = 3
pivot = 2
pivot = 0
v
6 1 12 40 1 29 2 3 23 17 5
quicksort(v, 0, 9)
pivot = 4
quicksort(v, 0, 3)
pivot = 3
pivot = 2
pivot = 0
v
6 1 12 40 1 29 2 3 24 17 5
quicksort(v, 0, 9)
pivot = 4
quicksort(v, 0, 3)
pivot = 3
pivot = 2
pivot = 0
v
6 1 12 40 1 29 2 3 25 17 5
quicksort(v, 0, 9)
pivot = 4
pivot = 3
pivot = 2
pivot = 0
v
6 1 12 40 1 29 2 3 17 5
quicksort(v, 0, 9)
pivot = 4
pivot = 3 pivot = ?
pivot = 2
pivot = 0
v
6 1 12 40 1 29 2 3 17 5
quicksort(v, 0, 9)
pivot = 4
pivot = 3 pivot = 5
pivot = 2
pivot = 0
v
6 1 12 40 1 29 2 3 17 5
quicksort(v, 0, 9)
pivot = 4
pivot = 3 pivot = 5
quicksort(v, 0, 2) quicksort(v, 4, 3) quicksort(v, 5, 4)

pivot = 2
pivot = 0
v
6 1 12 40 1 29 2 3 17 5
quicksort(v, 0, 9)
pivot = 4
pivot = 3 pivot = 5

pivot = 2
pivot = 0
v
6 1 12 40 1 29 2 3 17 5
quicksort(v, 0, 9)
pivot = 4
pivot = 3 pivot = 5
quicksort(v, 0, 2) quicksort(v, 4, 3) quicksort(v, 5, 4) quicksort(v, 6, 9)

pivot = 2
pivot = 0
v
6 1 12 40 1 29 2 3 17 5
quicksort(v, 0, 9)
pivot = 4
pivot = 3 pivot = 5

pivot = 2 pivot = ?
pivot = 0
v
6 1 12 40 1 29 2 3 17 5
quicksort(v, 0, 9)
pivot = 4
pivot = 3 pivot = 5

pivot = 2 pivot = 8
pivot = 0
v
6 1 12 40 1 29 2 3 17 5
quicksort(v, 0, 9)
pivot = 4
pivot = 3 pivot = 5

pivot = 2 pivot = 8

pivot = 0
v
6 1 12 40 1 29 2 3 34 17 5
quicksort(v, 0, 9)
pivot = 4
pivot = 3 pivot = 5

pivot = 2 pivot = 8

pivot = 0 pivot = ?
v
6 1 12 40 1 29 2 3 35 17 5
quicksort(v, 0, 9)
pivot = 4
pivot = 3 pivot = 5

pivot = 2 pivot = 8

pivot = 0 pivot = 7
v
6 1 12 40 1 29 2 3 36 17 5
quicksort(v, 0, 9)
pivot = 4
pivot = 3 pivot = 5
v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5
pivot = 2 pivot = 8

pivot = 0 pivot = 7
quicksort(v, 0, -1) quicksort(v, 1, 1) quicksort(v, 6, 6)

37
quicksort(v, 0, 9)
pivot = 4
pivot = 3 pivot = 5
v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5

pivot = 2 pivot = 8

pivot = 0 pivot = 7
quicksort(v, 0, -1) quicksort(v, 1, 1) quicksort(v, 6, 6)

38
quicksort(v, 0, 9)
pivot = 4
pivot = 3 pivot = 5
v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5

pivot = 2 pivot = 8

pivot = 0 pivot = 7
quicksort(v, 0, -1) quicksort(v, 1, 1) quicksort(v, 6, 6) quicksort(v, 8, 7)

39
quicksort(v, 0, 9)
pivot = 4
pivot = 3 pivot = 5
v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5

pivot = 2 pivot = 8

pivot = 0 pivot = 7

40
quicksort(v, 0, 9)
pivot = 4
pivot = 3 pivot = 5
v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5

pivot = 2 pivot = 8

pivot = 0 pivot = 7

41
quicksort(v, 0, 9)
pivot = 4
pivot = 3 pivot = 5
v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5

pivot = 2 pivot = 8

pivot = 0 pivot = 7

42
quicksort(v, 0, 9)
pivot = 4
pivot = 3 pivot = 5
v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5

pivot = 2 pivot = 8

pivot = 0 pivot = 7

43
quicksort(v, 0, 9)
pivot = 4
pivot = 3 pivot = 5
v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5

pivot = 2 pivot = 8

pivot = 0 pivot = 7

44
quicksort(v, 0, 9)
pivot = 4
pivot = 3 pivot = 5
v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5

pivot = 2 pivot = 8

pivot = 0 pivot = 7

45
quicksort(v, 0, 9)
pivot = 4
pivot = 3 pivot = 5
v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5

pivot = 2 pivot = 8

pivot = 0 pivot = 7

46
47
Quicksort (passo a passo)

v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5
Executa: quicksort(v, 0, 9)
48

v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5
Verifica: (9-0) > 0

49

v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5
low high
firsthigh p
i
Executa: pivot = partition(v, 0, 9)

50

v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5
low high
firsthigh p
i

51

v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5
low high
firsthigh p
i

52

v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5
low high
firsthigh p
i

53

v
0 1 2 3 4 5 6 7 8 9
6 1 12 40 1 29 2 3 17 5
low high
firsthigh p
i

54

v
0 1 2 3 4 5 6 7 8 9
1 6 12 40 1 29 2 3 17 5
low high
firsthigh p
i

55

v
0 1 2 3 4 5 6 7 8 9
1 6 12 40 1 29 2 3 17 5
low high
firsthigh p
i

56

v
0 1 2 3 4 5 6 7 8 9
1 6 12 40 1 29 2 3 17 5
low high
firsthigh p
i

57

v
0 1 2 3 4 5 6 7 8 9
1 6 12 40 1 29 2 3 17 5
low high
firsthigh p
i

58

v
0 1 2 3 4 5 6 7 8 9
1 6 12 40 1 29 2 3 17 5
low high
firsthigh p
i

59

v
0 1 2 3 4 5 6 7 8 9
1 6 12 40 1 29 2 3 17 5
low high
firsthigh p
i

60

v
0 1 2 3 4 5 6 7 8 9
1 6 12 40 1 29 2 3 17 5
low high
firsthigh p
i

61

v
0 1 2 3 4 5 6 7 8 9
1 6 12 40 1 29 2 3 17 5
low high
firsthigh p
i

62

v
0 1 2 3 4 5 6 7 8 9
1 6 12 40 1 29 2 3 17 5
low high
firsthigh p
i

63

v
0 1 2 3 4 5 6 7 8 9
1 1 12 40 6 29 2 3 17 5
low high
firsthigh p
i

64

v
0 1 2 3 4 5 6 7 8 9
1 1 12 40 6 29 2 3 17 5
low high
firsthigh p
i

65

v
0 1 2 3 4 5 6 7 8 9
1 1 12 40 6 29 2 3 17 5
low high
firsthigh p
i

66

v
0 1 2 3 4 5 6 7 8 9
1 1 12 40 6 29 2 3 17 5
low high
firsthigh p
i

67

v
0 1 2 3 4 5 6 7 8 9
1 1 12 40 6 29 2 3 17 5
low high
firsthigh p
i

68

v
0 1 2 3 4 5 6 7 8 9
1 1 12 40 6 29 2 3 17 5
low high
firsthigh p
i

69

v
0 1 2 3 4 5 6 7 8 9
1 1 12 40 6 29 2 3 17 5
low high
firsthigh p
i

70

v
0 1 2 3 4 5 6 7 8 9
1 1 2 40 6 29 12 3 17 5
low high
firsthigh p
i

71

v
0 1 2 3 4 5 6 7 8 9
1 1 2 40 6 29 12 3 17 5
low high
firsthigh p
i

72

v
0 1 2 3 4 5 6 7 8 9
1 1 2 40 6 29 12 3 17 5
low high
firsthigh p
i

73

v
0 1 2 3 4 5 6 7 8 9
1 1 2 40 6 29 12 3 17 5
low high
firsthigh p
i

74

v
0 1 2 3 4 5 6 7 8 9
1 1 2 40 6 29 12 3 17 5
low high
firsthigh p
i

75

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 6 29 12 40 17 5
low high
firsthigh p
i

76

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 6 29 12 40 17 5
low high
firsthigh p
i

77

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 6 29 12 40 17 5
low high
firsthigh p
i

78

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 6 29 12 40 17 5
low high
firsthigh p
i

79

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 6 29 12 40 17 5
low high
firsthigh p
i

80

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 6 29 12 40 17 5
low high
firsthigh p
i

81

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p
i
Retorna: firsthigh = 4
82

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
Retornou: pivot = partition(v, 0, 9) = 4

83

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
84

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
Verifica: (3-0) > 0

85

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

86

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

87

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

88

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

89

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

90

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

91

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

92

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

93

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

94

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

95

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p
i

96

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p
i

97

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p
i

98

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p
i

99

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
p
i firsthigh

100

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
p
firsthigh

101

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
p
firsthigh

102

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
p
firsthigh
103

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
Retournou: pivot = partition(v, 0, 3) = 3

104

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
105

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
Verifica: (2-0) > 0

106

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

107

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

108

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

109

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

110

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

111

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

112

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

113

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

114

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

115

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
p
i firsthigh

116

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
p
firsthigh

117

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
p
firsthigh

118

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
p
firsthigh
119

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6

120

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
121

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
Verifica: (1-0) > 0

122

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

123

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

124

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

125

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

126

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p
127

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6

128

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
Executa: quicksort(v, 0, -1)

129

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
Verifica: (-1-0) > 0

130

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
Falhou! Apenas retorna recursão.

Verifica: (-1-0) > 0
131

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
132

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
Verifica: (1-1) > 0

133

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6

Verifica: (1-1) > 0
134

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
Retorna recursão.
135

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
136

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
Verifica: (2-3) > 0

137

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6

Verifica: (2-3) > 0
138

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
Retorna recursão.
139

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
140

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
Verifica: (3-4) > 0

141

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6

Verifica: (3-4) > 0
142

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
Retorna recursão.
143

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
144

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
Verifica: (9-5) > 0

145

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

146

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

147

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

148

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

149

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

150

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

151

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

152

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

153

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

154

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 29 12 40 17 6
low high
firsthigh p

155

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 40 17 29
low high
firsthigh p
156

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 40 17 29

157

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 40 17 29
158

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 40 17 29
Verifica: (4-5) > 0

159

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 40 17 29

Verifica: (4-5) > 0
160

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 40 17 29
161

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 40 17 29
Verifica: (9-6) > 0

162

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 40 17 29
low high
firsthigh p

163

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 40 17 29
low high
firsthigh p

164

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 40 17 29
low high
firsthigh p

165

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 40 17 29
low high
firsthigh p

166

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 40 17 29
low high
firsthigh p

167

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 40 17 29
low high
firsthigh p

168

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 40 17 29
low high
firsthigh p

169

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 40 17 29
low high
firsthigh p

170

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 40 17 29
low high
firsthigh p

171

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 40 17 29
low high
firsthigh p

172

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 40 29
low high
firsthigh p

173

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 40 29
low high
firsthigh p

174

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 40 29
low high
firsthigh p

175

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 40 29
low high
firsthigh p

176

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 29 40
low high
firsthigh p
177

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 29 40

178

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 29 40
179

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 29 40
Verifica: (7-6) > 0

180

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 29 40
low high
firsthigh p

181

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 29 40
low high
firsthigh p

182

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 29 40
low high
firsthigh p

183

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 29 40
low high
firsthigh p

184

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 29 40
low high
p
i firsthigh

185

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 29 40
low high
p
firsthigh

186

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 29 40
low high
p
firsthigh

187

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 29 40
low high
p
firsthigh
Retorna: firsthigh = 7 i

188

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 29 40

189

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 29 40
190

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 29 40
Verifica: (6-6) > 0

191

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 29 40

Verifica: (6-6) > 0
192

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 29 40
193

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 29 40
Verifica: (7-8) > 0

194

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 29 40

Verifica: (7-8) > 0
195

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 29 40
Retorna recursão.
196

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 29 40
197

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 29 40
Verifica: (9-9) > 0

198

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 29 40

Verifica: (9-9) > 0
199

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 29 40
Retorna recursão.
200

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 29 40
Retorna recursão.
201

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 29 40
Retorna recursão.
202

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 29 40
Retornou para chamada inicial:

quicksort(v, 0, 9)
203

v
0 1 2 3 4 5 6 7 8 9
1 1 2 3 5 6 12 17 29 40
Vetor está ordenado!!!

Quicksort
• Qual é a complexidade do algoritmo?
• Qual é o O()?
• No pior caso (vetor já ordenado): o particionamente é feito
de maneira que se tem um subproblema com n-1
elementos e outro com 0 elementos, ou seja, o pivô é o
primeiro ou último elemento, sendo então o algoritmo O(n2).
• No melhor caso: o particionamento é “comportado” e os
subproblemas tem sempre n/2 elementos, sendo então o
algoritmo O(n × log n).
• No caso médio (normalmente o que acontece): o
particionamento ora é bom ora é ruim, mas na média dada
a aleatoriedade dos elementos no vetor, algoritmo tem
complexidade igual a O(n × log n).

#3.2 - Quicksort

Enviado por

Dados do documento

Direitos autorais

Formatos disponíveis

Compartilhar este documento

Compartilhar ou incorporar documento

Opções de compartilhamento

Você considera este documento útil?

Este conteúdo é inapropriado?

Direitos autorais:

Formatos disponíveis

#3.2 - Quicksort

Enviado por

Direitos autorais:

Formatos disponíveis

ALGORITMOS E ESTRUTURAS

Métodos de ordenação - Quicksort

Baseado nos slides dos Profs. Michael Móra e Afonso Sales

• Que função o algoritmo desempenha?

quicksort(v, 0, 2) quicksort(v, 4, 3) quicksort(v, 5, 4)

quicksort(v, 0, 2) quicksort(v, 4, 3) quicksort(v, 5, 4)

quicksort(v, 0, 2) quicksort(v, 4, 3) quicksort(v, 5, 4) quicksort(v, 6, 9)

quicksort(v, 0, 2) quicksort(v, 4, 3) quicksort(v, 5, 4) quicksort(v, 6, 9)

quicksort(v, 0, 2) quicksort(v, 4, 3) quicksort(v, 5, 4) quicksort(v, 6, 9)

quicksort(v, 0, 2) quicksort(v, 4, 3) quicksort(v, 5, 4) quicksort(v, 6, 9)

quicksort(v, 0, 1) quicksort(v, 3, 2) quicksort(v, 6, 7)

quicksort(v, 0, 2) quicksort(v, 4, 3) quicksort(v, 5, 4) quicksort(v, 6, 9)

quicksort(v, 0, 1) quicksort(v, 3, 2) quicksort(v, 6, 7)

quicksort(v, 0, 2) quicksort(v, 4, 3) quicksort(v, 5, 4) quicksort(v, 6, 9)

quicksort(v, 0, 1) quicksort(v, 3, 2) quicksort(v, 6, 7)

quicksort(v, 0, 1) quicksort(v, 3, 2) quicksort(v, 6, 7)

quicksort(v, 0, -1) quicksort(v, 1, 1) quicksort(v, 6, 6)

quicksort(v, 0, 2) quicksort(v, 4, 3) quicksort(v, 5, 4) quicksort(v, 6, 9)

quicksort(v, 0, 1) quicksort(v, 3, 2) quicksort(v, 6, 7)

quicksort(v, 0, -1) quicksort(v, 1, 1) quicksort(v, 6, 6)

quicksort(v, 0, 2) quicksort(v, 4, 3) quicksort(v, 5, 4) quicksort(v, 6, 9)

quicksort(v, 0, 1) quicksort(v, 3, 2) quicksort(v, 6, 7)

quicksort(v, 0, -1) quicksort(v, 1, 1) quicksort(v, 6, 6) quicksort(v, 8, 7)

quicksort(v, 0, 2) quicksort(v, 4, 3) quicksort(v, 5, 4) quicksort(v, 6, 9)

quicksort(v, 0, 1) quicksort(v, 3, 2) quicksort(v, 6, 7)

quicksort(v, 0, -1) quicksort(v, 1, 1) quicksort(v, 6, 6) quicksort(v, 8, 7)

quicksort(v, 0, 2) quicksort(v, 4, 3) quicksort(v, 5, 4) quicksort(v, 6, 9)

quicksort(v, 0, 1) quicksort(v, 3, 2) quicksort(v, 6, 7)

quicksort(v, 0, -1) quicksort(v, 1, 1) quicksort(v, 6, 6) quicksort(v, 8, 7)

quicksort(v, 0, 2) quicksort(v, 4, 3) quicksort(v, 5, 4) quicksort(v, 6, 9)

quicksort(v, 0, 1) quicksort(v, 3, 2) quicksort(v, 6, 7) quicksort(v, 9, 9)

quicksort(v, 0, -1) quicksort(v, 1, 1) quicksort(v, 6, 6) quicksort(v, 8, 7)

quicksort(v, 0, 2) quicksort(v, 4, 3) quicksort(v, 5, 4) quicksort(v, 6, 9)

quicksort(v, 0, 1) quicksort(v, 3, 2) quicksort(v, 6, 7) quicksort(v, 9, 9)

quicksort(v, 0, -1) quicksort(v, 1, 1) quicksort(v, 6, 6) quicksort(v, 8, 7)

quicksort(v, 0, 2) quicksort(v, 4, 3) quicksort(v, 5, 4) quicksort(v, 6, 9)

quicksort(v, 0, 1) quicksort(v, 3, 2) quicksort(v, 6, 7) quicksort(v, 9, 9)

quicksort(v, 0, -1) quicksort(v, 1, 1) quicksort(v, 6, 6) quicksort(v, 8, 7)

quicksort(v, 0, 2) quicksort(v, 4, 3) quicksort(v, 5, 4) quicksort(v, 6, 9)

quicksort(v, 0, 1) quicksort(v, 3, 2) quicksort(v, 6, 7) quicksort(v, 9, 9)

quicksort(v, 0, -1) quicksort(v, 1, 1) quicksort(v, 6, 6) quicksort(v, 8, 7)

quicksort(v, 0, 2) quicksort(v, 4, 3) quicksort(v, 5, 4) quicksort(v, 6, 9)

quicksort(v, 0, 1) quicksort(v, 3, 2) quicksort(v, 6, 7) quicksort(v, 9, 9)

quicksort(v, 0, -1) quicksort(v, 1, 1) quicksort(v, 6, 6) quicksort(v, 8, 7)

Quicksort (passo a passo)

Quicksort (passo a passo)

Verifica: (9-0) > 0

Quicksort (passo a passo)

Executa: pivot = partition(v, 0, 9)

Quicksort (passo a passo)

Executa: pivot = partition(v, 0, 9)

Quicksort (passo a passo)

Executa: pivot = partition(v, 0, 9)

Quicksort (passo a passo)

Executa: pivot = partition(v, 0, 9)

Quicksort (passo a passo)

Executa: pivot = partition(v, 0, 9)

Quicksort (passo a passo)

Executa: pivot = partition(v, 0, 9)

Quicksort (passo a passo)

Executa: pivot = partition(v, 0, 9)

Quicksort (passo a passo)

Executa: pivot = partition(v, 0, 9)

Quicksort (passo a passo)