Scribd
Upload
44 views

Linear Search (Area Code Example)

The document describes and compares the efficiencies of linear and binary search algorithms. It provides examples of linear search, which searches sequentially through each element to find a target value, requiring up to N steps in the worst case for a list of N elements. Binary search is more efficient, repeatedly dividing the search space in half and requiring only log2N steps on average. A table shows the number of steps required grows linearly for linear search but logarithmically for binary search as the number of elements increases.

Uploaded by

Davi Teodoro
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
44 views

Linear Search (Area Code Example)

The document describes and compares the efficiencies of linear and binary search algorithms. It provides examples of linear search, which searches sequentially through each element to find a target value, requiring up to N steps in the worst case for a list of N elements. Binary search is more efficient, repeatedly dividing the search space in half and requiring only log2N steps on average. A table shows the number of steps required grows linearly for linear search but logarithmically for binary search as the number of elements increases.

Uploaded by

Davi Teodoro
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 4

Linear Search (Area Code Example)

201 202 203 205 206 207 208 209 210 212 213 214 215 216 217 218 219 224 225 228 229 231
0

10

11

12

13

14

15

16

17

18

19

20

21

234 239 240 248 251 252 253 254 256 260 262 267 269 270 276 281 283 301 302 303 304 305
22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

307 308 309 310 312 313 314 315 316 317 318 319 320 321 323 325 330 331 334 336 337 339
44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

347 351 352 360 361 364 385 386 401 402 404 405 406 407 408 409 410 412 413 414 415 416
66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

87

417 419 423 424 425 430 432 434 435 440 443 445 469 470 475 478 479 480 484 501 502 503
88

89

90

91

92

93

94

95

96

97

98

99

100

101

102

103

104

105

106

107

108

109

504 505 507 508 509 510 512 513 515 516 517 518 520 530 540 541 551 559 561 562 563 564
110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

567 570 571 573 574 575 580 585 586 601 602 603 605 606 607 608 609 610 612 614 615 616
132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

617 618 619 620 623 626 630 631 636 641 646 650 651 660 661 662 678 682 701 702 703 704
154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

706 707 708 712 713 714 715 716 717 718 719 720 724 727 731 732 734 740 754 757 760 762
176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

763 765 769 770 772 773 774 775 779 781 785 786 801 802 803 804 805 806 808 810 812 813
198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

814 815 816 817 818 828 830 831 832 835 843 845 847 848 850 856 857 858 859 860 862 863
220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

864 865 870 878 901 903 904 906 907 908 909 910 912 913 914 915 916 917 918 919 920 925
242

243

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

260

261

262

263

928 931 936 937 940 941 947 949 951 952 954 956 959 970 971 972 973 978 979 980 985 989
264

265

266

267

268

269

270

271

272

273

274

275

276

277

278

279

280

281

282

283

284

285

Binary Search (Area Code Example)


143 + 165
213
161
285 0 + 285
177
165
168
, the
which
isthe
the
650
atto
index
element
630
160:
708
178:
Binary
Continue
The
search
650
with
needs
greater
less
equal
than
totoat
than
look
650,
805,
708,
662,
651,
602,
630,
646,
so
soonly
discard
so2 process
discard
eight
elements
the
is
second
805
662
646
first
half.
half.
find
214:
169:
164:
650. 142:
Startkey
with
theiselement
index
, which
isfinished.
the
602
at 165:
index
651
166:
2 at
201 202 203 205 206 207 208 209 210 212 213 214 215 216 217 218 219 224 225 228 229 231
0

10

11

12

13

14

15

16

17

18

19

20

21

234 239 240 248 251 252 253 254 256 260 262 267 269 270 276 281 283 301 302 303 304 305
22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

307 308 309 310 312 313 314 315 316 317 318 319 320 321 323 325 330 331 334 336 337 339
44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

347 351 352 360 361 364 385 386 401 402 404 405 406 407 408 409 410 412 413 414 415 416
66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

87

417 419 423 424 425 430 432 434 435 440 443 445 469 470 475 478 479 480 484 501 502 503
88

89

90

91

92

93

94

95

96

97

98

99

100

101

102

103

104

105

106

107

108

109

504 505 507 508 509 510 512 513 515 516 517 518 520 530 540 541 551 559 561 562 563 564
110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

567 570 571 573 574 575 580 585 586 601 602 603 605 606 607 608 609 610 612 614 615 616
132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

617 618 619 620 623 626 630 631 636 641 646 650 651 660 661 662 678 682 701 702 703 704
154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

706 707 708 712 713 714 715 716 717 718 719 720 724 727 731 732 734 740 754 757 760 762
176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

763 765 769 770 772 773 774 775 779 781 785 786 801 802 803 804 805 806 808 810 812 813
198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

814 815 816 817 818 828 830 831 832 835 843 845 847 848 850 856 857 858 859 860 862 863
220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

864 865 870 878 901 903 904 906 907 908 909 910 912 913 914 915 916 917 918 919 920 925
242

243

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

260

261

262

263

928 931 936 937 940 941 947 949 951 952 954 956 959 970 971 972 973 978 979 980 985 989
264

265

266

267

268

269

270

271

272

273

274

275

276

277

278

279

280

281

282

283

284

285

Simulating Selection Sort


public void run() {
int[] test = { 809, 503, 946, 367, 987, 838, 259, 236, 659, 361 };
private void sort(int[] array) {
sort(test);
for ( int lh = 0 ; lh < array.length ; lh++ ) {
} private int findSmallest(int[] array, int p1, int p2)test
{
int rh = findSmallest(array, lh, array.length);
int smallestIndex = p1;
swapElements(array, lh, rh);
for ( int i = p1 + 1 ; i < p2 ; i++ ) {
}
if (array[i] < array[smallestIndex]) smallestIndex = i;
}
}
lh
rh
array
return smallestIndex;
36789
10
0123456789
}
smallestIndex i
p1
p2
array

10
123456789

01367

10

809 503 946 367 987 838 259 236 659 361
809 1503 2946 3367 4987 5838 6259 7236 8659 9361
0
0

skip simulation

Comparing Search Efficiencies


Number of steps required for linear vs. binary search:
linear
N

binary
log2 N
10

100

1000

10

1,000,000

20

1,000,000,000

30

You might also like