بحث عن كتاب
كتاب Worst Case لJames Patterson

تحميل كتاب Worst Case PDF

المؤلف : James Patterson
سنة النشر : 2010
عدد الصفحات : غير محدد
عن الكتاب : 2010م - 1443هـ Worst Case Introduction A well-known problem in data structures is the set union problem, defined as follows: Carry out a sequence of intermixed operations of the following three kinds on labeled sets: make set(e, l): Create a new set with label l containing the single element e. This operation requires that e initially be in no set. find label(e): Return the label of the set containing element e. unite(e, f): Combine the sets containing elements e and finto a single set, whose label is the label of the old set containing element e. This operation requires that elements e andfinitially be in different sets. Because of the constraint on make set, the sets existing at any time are disjoint and define a partition of the dements into equivalence classes. For this reason the set union problem has been called the equivalence problem by some authors. A solution to the set union problem can be used in the compiling of FORTRAN Authors addre ,sses: R. E. Tarjan, AT&T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ 07974; J. van Leeuwen, Department of Computer Science, University of Utrecht, Utrecht, The Netherlands. .
أعلان

نبذة عن كتاب Worst Case

كتاب Worst Case

2010م - 1443هـ Worst Case Introduction A well-known problem in data structures is the set union problem, defined as follows: Carry out a sequence of intermixed operations of the following three kinds on labeled sets: make set(e, l): Create a new set with label l containing the single element e. This operation requires that e initially be in no set. find label(e): Return the label of the set containing element e. unite(e, f): Combine the sets containing elements e and finto a single set, whose label is the label of the old set containing element e. This operation requires that elements e andfinitially be in different sets. Because of the constraint on make set, the sets existing at any time are disjoint and define a partition of the dements into equivalence classes. For this reason the set union problem has been called the equivalence problem by some authors. A solution to the set union problem can be used in the compiling of FORTRAN Authors addre ,sses: R. E. Tarjan, AT&T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ 07974; J. van Leeuwen, Department of Computer Science, University of Utrecht, Utrecht, The Netherlands. .


هذا الكتاب من تأليف James Patterson و حقوق الكتاب محفوظة لصاحبها

تحميل
التحميل حجم الكتاب
تحميل غير محدد فى الوقت الحالى
أضافة مراجعة
0.0 / 5
بناء على 0 مراجعة
1 (0)
2 (0)
3 (0)
4 (0)
5 (0)
كتب ذات صلة