1. Advanced Data Structure using C++

More documents

Recommendations

Info

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110) Algorithm for Heap Sort Create_Heap(A,N) Where A = Linear Array. N = Number of elements in linear array, A. The index variable Count controls the number of insertion. The integer variable j denotes the index of the parent of key k[i], key contains he element being inserted into an existing heap. <strong>1.</strong> [ Repeat for each element to be placed in heap ] Repeat step 2 to step 7 for Count = 2 to N 2. [ Obtain child to be placed at heap level ] i = Count key = A [Count] 3. [ Obtain the position of parent for his child ] j = i div 2 4. [ Place the child in existing heap ] Repeat step 5 to 6 while i > 1 and key > A[ j] 5. [ Move the parent down to the position of the child ] A[i] = A[j] 6. [ Obtain the position of the new parent ] i = j j = i div 2 if j < 1 then Prepared By : Er. Harvinder Singh Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 14 ‐
LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110) j = 1 [ End of if statement ] [ End of step 4 loop ] 7. [ Copy the child record into its proper place ] A [i] = key [ End of step 1 for loop ] 8. [ Finished ] Return Algorithm : Heap_Sort ( A,N ) <strong>1.</strong> [ Create the initial heap ] Call Create_Heap (A,N) 2. [ Perform the sort ] Repeat step 3 to 10 for Count = N to i‐1 3. [ Exchange the first element with the last unsorted element ] A [i] = A [Count] 4. [ Initialise Pass] i = 1 key = A[i] j = 2 5. [ Obtain index of largest son ] if j+1 < Count then if A[j+1] > A[j] then j = j +1 [ End of inner if statement] Prepared By : Er. Harvinder Singh Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 15 ‐
Page 1 and 2: ADVANCED DATA STRUCTURE NOTES (MT
Page 3 and 4: LECTURE NOTES OF ADVANCED DATA STRU
Page 9 and 10: 70 121 432 12 638 LECTURE NOTES OF
Page 13: 3 91 11 50 LECTURE NOTES OF ADVANCE
Page 25 and 26: COLLISION LECTURE NOTES OF ADVANCED
Page 27 and 28: 4. Rehashing LECTURE NOTES OF ADVAN
Page 47 and 48: Instructions: LECTURE NOTES OF ADVA
Page 65 and 66:
LECTURE NOTES OF ADVANCED DATA STRU
Page 67 and 68:
Page 69 and 70:
Page 71 and 72:
Page 73 and 74:
Page 75 and 76:
Page 77 and 78:
Page 79 and 80:
Page 81 and 82:
Page 83 and 84:
Page 85 and 86:
Page 87 and 88:
Page 89 and 90:
Page 91 and 92:
Page 93 and 94:
Page 95 and 96:
Page 97 and 98:
Page 99 and 100:
DESTINATION DESTINATION LECTURE NOT
Page 101 and 102:
Page 103 and 104:
Page 105 and 106:
Page 107 and 108:
Page 109 and 110:
Page 111 and 112:
Algorithm LECTURE NOTES OF ADVANCED
Page 113 and 114:
Page 115 and 116:
Page 117 and 118:
Page 119 and 120:
Page 121 and 122:
Page 123 and 124:
Page 125 and 126:
Page 127 and 128:
Page 129 and 130:
Page 131 and 132:
Page 133 and 134:
Page 135 and 136:
Page 137 and 138:
Page 139 and 140:
Page 141 and 142:
Page 143 and 144:
queue LECTURE NOTES OF ADVANCED DAT
Page 145 and 146:
Page 147 and 148:
Page 149 and 150:
Page 151 and 152:
Page 153 and 154:
SEARCHING LECTURE NOTES OF ADVANCED
Page 155 and 156:
Page 157 and 158:
Page 159 and 160:
Page 161 and 162:
Page 163 and 164:
Page 165 and 166:
Page 167 and 168:
Step 2: Step 3 LECTURE NOTES OF ADV
Page 169 and 170:
Page 171 and 172:
Page 173 and 174:
Page 175 and 176:
Page 177 and 178:
a LECTURE NOTES OF ADVANCED DATA ST
Page 179 and 180:
Page 181 and 182:
Page 183 and 184:
D LECTURE NOTES OF ADVANCED DATA ST
Page 185 and 186:
Page 187 and 188:
1 3 LECTURE NOTES OF ADVANCED DATA
Page 189 and 190:
Page 191 and 192:
Page 193 and 194:
Page 195 and 196:
Page 197 and 198:
Page 199 and 200:
Page 201 and 202:
Page 203 and 204:
Page 205 and 206:
Page 207 and 208:
Page 209 and 210:
Page 211 and 212:
Page 213 and 214:
Page 215 and 216:
Page 217 and 218:
Page 219 and 220:
Page 221 and 222:
Search LECTURE NOTES OF ADVANCED DA
Page 223 and 224:
show all

1. Advanced Data Structure using C++

Create successful ePaper yourself

Delete template?

Save as template?