YU-GI-OH! For this assignment, you will be provided one text file named monsters.txt containing the description of monsters in the following format: Blue-Eyes White Dragon 3000 2500 The monsters will be read into an array as a struct. Your task is to sort and search accordingly with a given feature (attack or defence).

procedure bubbleSort(A : list of sortable items) n := length(A) repeat swapped = false for i := 1 to n - 1 inclusive do /* if this pair is out of order */ if A[i - 1] > A[i] then /* swap them and remember something changed */ swap(A[i - 1], A[i]) swapped := true end if end for until not swapped end procedure

Blue-Eyes White Dragon 3000 2500

Dark Magician 2500 2100

Exodia The Forbidden One 5000 5000

Celtic Guardian 1400 1200

Copycat 0 0

Time Wizard 500 400

Blue-Eyes White Dragon 3000 2500

Baby Dragon 1200 700

Kuriboh 300 200

Summoned Skull 2500 1200

Blue-Eyes White Dragon 3000 2500

Red-Eyes B. Dragon 2400 200

c++ language